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 304 articles , 2 standard articles )

Showing results 281 to 300 of 304.
Sorted by year (citations)

previous 1 2 3 ... 13 14 15 16 next

  1. Uhlig, Frank: Geometric computation of the numerical radius of a matrix (2009)
  2. Xie, Wen-Jing; Lin, Fu-Rong: A fast numerical solution method for two dimensional Fredholm integral equations of the second kind (2009)
  3. Caliari, Marco; de Marchi, Stefano; Vianello, Marco: Bivariate Lagrange interpolation at the Padua points: Computational aspects (2008)
  4. Caliari, Marco; De Marchi, Stefano; Vianello, Marco: Hyperinterpolation in the cube (2008)
  5. Driscoll, Tobin A.; Bornemann, Folkmar; Trefethen, Lloyd N.: The chebop system for automatic solution of differential equations (2008)
  6. Hale, Nicholas; Trefethen, Lloyd N.: New quadrature formulas from conformal maps (2008)
  7. Trefethen, Lloyd N.: Is Gauss quadrature better than Clenshaw-Curtis? (2008)
  8. Berrut, Jean-Paul; Welscher, Annick: Fourier and barycentric formulae for equidistant Hermite trigonometric interpolation (2007)
  9. Boyd, John P.: A test, based on conversion to the Bernstein polynomial basis, for an interval to be free of zeros applicable to polynomials in Chebyshev form and to transcendental functions approximated by Chebyshev series (2007)
  10. Boyd, John P.: Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries (2007)
  11. Boyd, John P.; Gally, Daniel H.: Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials (2007)
  12. Bueler, Ed: Error bounds for approximate eigenvalues of periodic-coefficient linear delay differential equations (2007)
  13. Trefethen, Lloyd N.: Computing numerically with functions instead of numbers (2007)
  14. Van Deun, Joris: Electrostatics and ghost poles in near best fixed pole rational interpolation (2007)
  15. Boyd, John P.: Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves (2006)
  16. Boyd, John P.: Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding (2006)
  17. Boyd, John P.: Computing real roots of a polynomial in Chebyshev series form through subdivision (2006)
  18. Caliari, Marco; Vianello, Marco; De Marchi, Stefano; Montagna, Roberto: Hyper2d: A numerical code for hyperinterpolation on rectangles (2006)
  19. Tee, T. W.; Trefethen, Lloyd N.: A rational spectral collocation method with adaptively transformed Chebyshev grid points (2006)
  20. Berrut, Jean-Paul; Baltensperger, Richard; Mittelmann, Hans D.: Recent developments in barycentric rational interpolation (2005)

previous 1 2 3 ... 13 14 15 16 next


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