Title of article
Approximation related to quotient functionals Original Research Article
Author/Authors
S. Setzer، نويسنده , , G. Steidl، نويسنده , , T. Teuber، نويسنده , , G. Moerkotte، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
14
From page
545
To page
558
Abstract
We examine the best approximation of componentwise positive vectors or positive continuous functions ff by linear combinations View the MathML sourcefˆ=∑jαjφj of given vectors or functions φjφj with respect to functionals QpQp, 1≤p≤∞1≤p≤∞, involving quotients View the MathML sourcemax{f/fˆ,fˆ/f} rather than differences View the MathML source|f−fˆ|. We verify the existence of a best approximating function under mild conditions on View the MathML source{φj}j=1n. For discrete data, we compute a best approximating function with respect to QpQp, p=1,2,∞p=1,2,∞ by second order cone programming. Special attention is paid to the Q∞Q∞ functional in both the discrete and the continuous setting. Based on the computation of the subdifferential of our convex functional Q∞Q∞ we give an equivalent characterization of the best approximation by using its extremal set. Then we apply this characterization to prove the uniqueness of the best Q∞Q∞ approximation for Chebyshev sets View the MathML source{φj}j=1n.
Keywords
polynomial approximation , Chebyshev sets , Convex optimization , Second order cone programming , best approximation
Journal title
Journal of Approximation Theory
Serial Year
2010
Journal title
Journal of Approximation Theory
Record number
852759
Link To Document