Best L p Approximation
From MaRDI portal
Publication:5683198
DOI10.2307/2005177zbMATH Open0266.41020OpenAlexW2053793349MaRDI QIDQ5683198FDOQ5683198
Authors: S. W. Kahng 
Publication date: 1972
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2005177
Approximation by polynomials (41A10) Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)
Cited In (8)
- The \(\ell_p\)-solution of the linear matrix equation \(AX+YB=C\)
- Calculation of linear bestL p -approximations
- The \(l^ p\)-solution of the nonlinear matrix equation XY=A
- Computational experiences with discrete L\(_p\)-approximation
- Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems
- Convex \(L^ p\) approximation
- On the convergence of an algorithm for discrete \(L_p\) approximation
- On two methods for discrete \(L_p\) approximation
This page was built for publication: Best L p Approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5683198)
