Linear Minimax Approximation as the Limit of Best L_p -Approximation

DOI10.1137/0711013MaRDI QIDQ4772055zbMATH OpenOpenAlexFDO

Authors Roger Fletcher, James A. Grant, M. D. Hebden

Publication date 1974

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0711013

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Best approximation, Chebyshev systems (41A50) Approximation by arbitrary linear expressions (41A45)

Cited in

(9)

• On best \(p\)-approximation from affine subspaces: Asymptotic expansion
• Approximation in normed linear spaces
• Hoffman's error bounds and uniform Lipschitz continuity of best \(l_ p\)-approximations
• Asymptotic behaviour of best \(l_p\)-approximations from affine subspaces
• Dependence on p of the best \(L^ p\) approximation operator
• Polya properties in
• Rate of convergence of the discrete Pólya algorithm
• Linear Chebyshev approximation without Chebyshev sets
• The Chebyshev approximation of a rectangular matrix by matrices of smaller rank as the limit of \(\ell_p\)-approximation

This page was built for publication: Linear Minimax Approximation as the Limit of Best $L_p $-Approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4772055)