Chebfun

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: http://freecode.com/)


References in zbMATH (referenced in 171 articles , 1 standard article )

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

1 2 3 ... 7 8 9 next

  1. Adcock, Ben; Martín-Vaquero, Jesús; Richardson, Mark: Resolution-optimal exponential and double-exponential transform methods for functions with endpoint singularities (2017)
  2. Aurentz, Jared L.; Trefethen, Lloyd N.: Block operators and spectral discretizations (2017)
  3. Bos, L.; De Marchi, S.; Vianello, M.: Polynomial approximation on Lissajous curves in the $d$-cube (2017)
  4. Chapman, S.J.; Farrell, Patrick E.: Analysis of Carrier’s problem (2017)
  5. Choi, Sou-Cheng T.; Ding, Yuhan; Hickernell, Fred J.; Tong, Xin: Local adaption for approximation and minimization of univariate functions (2017)
  6. Figueras, Jordi-Lluís; Gameiro, Marcio; Lessard, Jean-Philippe; de la Llave, Rafael: A framework for the numerical computation and a posteriori verification of invariant objects of evolution equations (2017)
  7. Georgieva, I.; Hofreither, C.: An algorithm for low-rank approximation of bivariate functions using splines (2017)
  8. Kao, Chiu-Yen; Lai, Rongjie; Osting, Braxton: Maximization of Laplace-Beltrami eigenvalues on closed Riemannian surfaces (2017)
  9. Lawrence, Piers W.; Pérez, Javier: Constructing strong linearizations of matrix polynomials expressed in Chebyshev bases (2017)
  10. Nakatsukasa, Yuji; Noferini, Vanni; Townsend, Alex: Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach (2017)
  11. Napoli, Anna; Abd-Elhameed, W.M.: An innovative harmonic numbers operational matrix method for solving initial value problems (2017)
  12. Noferini, Vanni; Pérez, Javier: Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable? (2017)
  13. Russell, Stephen; Madden, Niall: An introduction to the analysis and implementation of sparse grid finite element methods (2017)
  14. Trefethen, Lloyd N.: Cubature, approximation, and isotropy in the hypercube (2017)
  15. Wilber, Heather; Townsend, Alex; Wright, Grady B.: Computing with functions in spherical and polar geometries. II: The disk (2017)
  16. Area, Iván; Dimitrov, Dimitar K.; Godoy, Eduardo; Paschoa, Vanessa G.: Approximate calculation of sums. II: Gaussian type quadrature (2016)
  17. Bornemann, Folkmar: The SIAM 100-Digit Challenge: a decade later. Inspirations, ramifications, and other eddies left in its wake (2016)
  18. Chadha, Naresh M.; Madden, Niall: An optimal time-stepping algorithm for unsteady advection-diffusion problems (2016)
  19. Costabile, F.; Napoli, A.: A new spectral method for a class of linear boundary value problems (2016)
  20. de la Hoz, Francisco; Cuesta, Carlota M.: A pseudo-spectral method for a non-local KdV-Burgers equation posed on $\mathbbR$ (2016)

1 2 3 ... 7 8 9 next


Further publications can be found at: http://www.chebfun.org/publications/