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 |
---|---|
Format: | Report |
Published: |
Oxford University Computing Laboratory
2008
|
Similar Items
-
Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
by: Pachon, R, et al.
Published: (2008) -
Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
by: Pachon, R, et al.
Published: (2009) -
Piecewise smooth chebfuns
by: Pachόn, R, et al.
Published: (2008) -
Chebfun and Numerical Quadrature
by: Hale, N, et al.
Published: (2012) -
Chebfun and numerical quadrature
by: Hale, N, et al.
Published: (2012)