Barycentric−Remez algorithms for best polynomial approximation in the chebfun system
Variants of the Remez algorithm for best polynomial approximation are presented based on two key features: the use of the barycentric interpolation formula to represent the trial polynomials, and the setting of the whole computation in the chebfun system, where the determination of local and global...
Main Authors: | Pachόn, R, Trefethen, N |
---|---|
Formato: | Report |
Publicado em: |
Oxford University Computing Laboratory
2008
|
Registos relacionados
-
Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
Por: Pachon, R, et al.
Publicado em: (2008) -
Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
Por: Pachon, R, et al.
Publicado em: (2009) -
Piecewise smooth chebfuns
Por: Pachόn, R, et al.
Publicado em: (2008) -
Chebfun and Numerical Quadrature
Por: Hale, N, et al.
Publicado em: (2012) -
Chebfun and numerical quadrature
Por: Hale, N, et al.
Publicado em: (2012)