Algorithms for solving overdetermined systems of linear equations in the \(\ell_p\)-metric, \(0

DOI10.1016/0021-9045(78)90033-3zbMath0393.41021OpenAlexW2076897074MaRDI QIDQ1252487

V. P. Sreedharan, R. W. Owens

Publication date: 1978

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

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

zbMATH Keywords

Overdetermined Systems of M Linear Equation in D UnknownsP-Homogeneous Metric

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Approximations and expansions (41A99)

Related Items (1)

Algorithms for solving overdetermined systems of linear equations in the \(\ell_p\)-metric, \(0<p<1\)

Cites Work

• Unnamed Item
• Algorithms for solving overdetermined systems of linear equations in the \(\ell_p\)-metric, \(0<p<1\)
• Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
• Least pth Power Polynomials on a Real Finite Point Set

This page was built for publication: Algorithms for solving overdetermined systems of linear equations in the \(\ell_p\)-metric, \(0<p<1\)