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)