Chebfun is a collection of algorithms and a software system in object-oriented MATLAB that extends familiar powerful methods of numerical computation involving numbers to continuous or piecewise-continuous functions. It also implements continuous analogues of linear algebra notions like the QR decomposition and the SVD, and solves ordinary differential equations. The mathematical basis of the system combines tools of Chebyshev expansions, fast Fourier transform, barycentric interpolation, recursive zerofinding, and automatic differentiation. (Source:

References in zbMATH (referenced in 353 articles , 2 standard articles )

Showing results 1 to 20 of 353.
Sorted by year (citations)

1 2 3 ... 16 17 18 next

  1. An, Congpei; Wu, Hao-Ning: Tikhonov regularization for polynomial approximation problems in Gauss quadrature points (2021)
  2. Bremer, James; Pang, Qiyuan; Yang, Haizhao: Fast algorithms for the multi-dimensional Jacobi polynomial transform (2021)
  3. Martinson, W. Duncan; Ninomiya, Hirokazu; Byrne, Helen Mary; Maini, Philip Kumar: Comparative analysis of continuum angiogenesis models (2021)
  4. Mourrain, Bernard; Telen, Simon; Van Barel, Marc: Truncated normal forms for solving polynomial systems: generalized and efficient algorithms (2021)
  5. Nakatsukasa, Yuji; Townsend, Alex: Error localization of best (L_1) polynomial approximants (2021)
  6. Peiris, V.; Sharon, N.; Sukhorukova, N.; Ugon, J.: Generalised rational approximation and its application to improve deep learning classifiers (2021)
  7. Trefethen, Lloyd N.; Nakatsukasa, Yuji; Weideman, J. A. C.: Exponential node clustering at singularities for rational approximation, quadrature, and PDEs (2021)
  8. van den Bos, L. M. M.; Sanderse, B.: A geometrical interpretation of the addition of nodes to an interpolatory quadrature rule while preserving positive weights (2021)
  9. Van Gorder, Robert A.; Klika, Václav; Krause, Andrew L.: Turing conditions for pattern forming systems on evolving manifolds (2021)
  10. Wang, Haiyong: How much faster does the best polynomial approximation converge than Legendre projection? (2021)
  11. Yan, David; Pugh, M. C.; Dawson, F. P.: Adaptive time-stepping schemes for the solution of the Poisson-Nernst-Planck equations (2021)
  12. Abdi, Ali; Hosseini, Seyyed Ahmad; Podhaisky, Helmut: Numerical methods based on the Floater-Hormann interpolants for stiff VIEs (2020)
  13. Allen, Larry; Kirby, Robert C.: Structured inversion of the Bernstein mass matrix (2020)
  14. Askham, Travis; Rachh, Manas: A boundary integral equation approach to computing eigenvalues of the Stokes operator (2020)
  15. Berrut, Jean-Paul; Elefante, Giacomo: A periodic map for linear barycentric rational trigonometric interpolation (2020)
  16. Boullé, Nicolas; Townsend, Alex: Computing with functions in the ball (2020)
  17. Breden, Maxime; Kuehn, Christian: Computing invariant sets of random differential equations using polynomial chaos (2020)
  18. Bu, Ling-Ze; Zhao, Wei; Wang, Wei: Tensor train-Karhunen-Loève expansion: new theoretical and algorithmic frameworks for representing general non-Gaussian random fields (2020)
  19. Campos Pinto, M.; Charles, F.; Després, B.; Herda, M.: A projection algorithm on the set of polynomials with two bounds (2020)
  20. Chan, Tat Lung (Ron): An SFP-FCC method for pricing and hedging early-exercise options under Lévy processes (2020)

1 2 3 ... 16 17 18 next

Further publications can be found at: