Solutions of overdetermined linear equations which minimize error in an abstract norm

DOI10.1007/BF02163232zbMath0185.40603OpenAlexW1991854813MaRDI QIDQ2536329

V. P. Sreedharan

Publication date: 1969

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131905

zbMATH Keywords

numerical analysis

Related Items

Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems ⋮ Properties of the approximate generalized inverses of a class of matrices ⋮ On the characterization of the extremal points of the unit sphere of matrices ⋮ Duality theorem for a generalized Fermat-Weber problem ⋮ Theorems of the alternative and duality ⋮ Computational methods of linear algebra ⋮ An algorithm for non-negative norm minimal solutions ⋮ Minimization technique for a convex function with application to multiple regression model ⋮ Lösung überbestimmter linearer Gleichungssysteme im Sinne einer energetischen Norm ⋮ An overdetermined linear system ⋮ A class of programming problems whose objective function contains a norm ⋮ Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm ⋮ Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm ⋮ A characterization of an element of best simultaneous approximation ⋮ On a particular case of the inconsistent linear matrix equation \(AX+YB=C\)

Cites Work

• Chebyshev and $l^1 $-Solutions of Linear Equations Using Least Squares Solutions
• Unnamed Item
• Unnamed Item
• Unnamed Item