Dependence on p of the best \(L^ p\) approximation operator

DOI10.1016/0021-9045(87)90104-3zbMath0619.41018OpenAlexW1983238956MaRDI QIDQ1089546

A. G. Egger, G. D. (Jerry) Taylor

Publication date: 1987

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(87)90104-3

zbMATH Keywords

examplesbest approximation operator

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by positive operators (41A36)

Related Items (2)

The Pólya algorithm on convex sets ⋮ Rate of convergence of the discrete Pólya algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of Polya's algorithm
• Natural choice of \(L_ 1-\)approximants
• A note on the continuity of best polynomial approximations
• Smoothness of approximation
• The continuity and differentiability of the parameters of best linear L\(_p\) approximations
• Some theorems on Cebysev approximation
• The Lipschitz constant of the operator of best approximation
• The continuity of best approximations
• Differential properties of the operator of best approximation
• Linear Minimax Approximation as the Limit of Best $L_p $-Approximation
• Approximations in $L^p $ and Chebyshev Approximations
• Applications of the Hahn-Banach Theorem in Approximation Theory

This page was built for publication: Dependence on p of the best \(L^ p\) approximation operator