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...
المؤلفون الرئيسيون: | Pachόn, R, Trefethen, N |
---|---|
التنسيق: | Report |
منشور في: |
Oxford University Computing Laboratory
2008
|
مواد مشابهة
-
Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
حسب: Pachon, R, وآخرون
منشور في: (2008) -
Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
حسب: Pachon, R, وآخرون
منشور في: (2009) -
Piecewise smooth chebfuns
حسب: Pachόn, R, وآخرون
منشور في: (2008) -
Chebfun and Numerical Quadrature
حسب: Hale, N, وآخرون
منشور في: (2012) -
Chebfun and numerical quadrature
حسب: Hale, N, وآخرون
منشور في: (2012)