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...
Główni autorzy: | Pachόn, R, Trefethen, N |
---|---|
Format: | Report |
Wydane: |
Oxford University Computing Laboratory
2008
|
Podobne zapisy
-
Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
od: Pachon, R, i wsp.
Wydane: (2008) -
Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
od: Pachon, R, i wsp.
Wydane: (2009) -
Piecewise smooth chebfuns
od: Pachόn, R, i wsp.
Wydane: (2008) -
Chebfun and Numerical Quadrature
od: Hale, N, i wsp.
Wydane: (2012) -
Chebfun and numerical quadrature
od: Hale, N, i wsp.
Wydane: (2012)