Convex \(L^ p\) approximation

DOI10.1016/0021-9045(88)90105-0zbMath0657.41020OpenAlexW2342914050MaRDI QIDQ5903786

G. Alistair Watson

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0021-9045(88)90105-0

zbMATH Keywords

algorithmweighted \(L^ 2\)-norm

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items (2)

Nonlinear eigenvector algorithms for local optimization in multivariate data analysis ⋮ A matrix-based IRLS algorithm for the least \(l_p\)-norm design of 2-D FIR filters

Cites Work

• Unnamed Item
• On the convergence of an algorithm for discrete \(L_p\) approximation
• Computational experiences with discrete L\(_p\)-approximation
• Best approximation in \(L^{\infty}\) via iterative Hilbert space procedures
• Construction of nearest points in the \(L^ p\), p even, and \(L^ \infty\) norms. I
• The calculation of linear best Lp approximations
• Calculation of linear bestL p -approximations
• Best L p Approximation
• Convex \(L^ p\) approximation

This page was built for publication: Convex \(L^ p\) approximation