Chebyshev approximation via polynomial mappings and the convergence behaviour of Krylov subspace methods
Electronic transactions on numerical analysis, Tome 12 (2001), pp. 205-215
Let $\varphi $be a polynomial satisfying some mild conditions. Given a set R $\subset C$, a continuous function m f on R and its best approximation p$\ast $from $\Pi \circ \varphi m$ n - 1 n - 1 with respect to the maximum norm, we show that p$\ast n - 1$ is a best approximation to f $\circ \varphi $on the inverse polynomial image S of R, i.e. $\varphi (S) = R$, where the extremal m m signature is given explicitly. A similar result is presented for constrained Chebyshev polynomial approximation.
Classification : 41A10, 30E10, 65F10
Keywords: Chebyshev polynomial, optimal polynomial, extremal signature, Krylov subspace method, convergence rate
@article{ETNA_2001__12__a2,
     author = {Fischer,  Bernd and Peherstorfer,  Franz},
     title = {Chebyshev approximation via polynomial mappings and the convergence behaviour of {Krylov} subspace methods},
     journal = {Electronic transactions on numerical analysis},
     pages = {205--215},
     year = {2001},
     volume = {12},
     zbl = {0978.41004},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ETNA_2001__12__a2/}
}
TY  - JOUR
AU  - Fischer,  Bernd
AU  - Peherstorfer,  Franz
TI  - Chebyshev approximation via polynomial mappings and the convergence behaviour of Krylov subspace methods
JO  - Electronic transactions on numerical analysis
PY  - 2001
SP  - 205
EP  - 215
VL  - 12
UR  - http://geodesic.mathdoc.fr/item/ETNA_2001__12__a2/
LA  - en
ID  - ETNA_2001__12__a2
ER  - 
%0 Journal Article
%A Fischer,  Bernd
%A Peherstorfer,  Franz
%T Chebyshev approximation via polynomial mappings and the convergence behaviour of Krylov subspace methods
%J Electronic transactions on numerical analysis
%D 2001
%P 205-215
%V 12
%U http://geodesic.mathdoc.fr/item/ETNA_2001__12__a2/
%G en
%F ETNA_2001__12__a2
Fischer,  Bernd; Peherstorfer,  Franz. Chebyshev approximation via polynomial mappings and the convergence behaviour of Krylov subspace methods. Electronic transactions on numerical analysis, Tome 12 (2001), pp. 205-215. http://geodesic.mathdoc.fr/item/ETNA_2001__12__a2/