Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm

DOI10.1007/BF01436088zbMath0231.65040OpenAlexW1998487066MaRDI QIDQ2550611

V. P. Sreedharan

Publication date: 1971

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

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

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items

A least distance algorithm for a smooth strictly convex norm ⋮ Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems ⋮ Duality theorem for a generalized Fermat-Weber problem ⋮ An algorithm for computing nonnegative minimal norm solutions ⋮ An algorithm for the best approximation by elements of a polyhedral set in banach spaces ⋮ Computational methods of linear algebra ⋮ An algorithm for non-negative norm minimal solutions ⋮ A subgradient projection algorithm ⋮ Lösung überbestimmter linearer Gleichungssysteme im Sinne einer energetischen Norm ⋮ The distance between two convex sets ⋮ A class of programming problems whose objective function contains a norm ⋮ A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems ⋮ An Algorithm For A Minimum Norm Solution Of A System Of Linear Inequalities ⋮ An algorithm for non—negative least error minimal norm solutions ⋮ An algorithm for approximation by elements of a cone in a banach space ⋮ On an algorithm for best approximate solutions to Av=b in normed linear spaces ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solutions of overdetermined linear equations which minimize error in an abstract norm
• The Lawson Algorithm and Extensions
• Chebyshev and $l^1 $-Solutions of Linear Equations Using Least Squares Solutions