On an algorithm for best approximate solutions to Av=b in normed linear spaces

DOI10.1016/0021-9045(73)90022-1zbMath0269.41030OpenAlexW2084282804MaRDI QIDQ2563276

C. S. Duris, Howard Anton

Publication date: 1973

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

Full work available at URL: https://doi.org/10.1016/0021-9045(73)90022-1

Mathematics Subject Classification ID

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

Related Items

An algorithm for the best approximation by elements of a polyhedral set in banach spaces, Inner, outer, and generalized inverses in banach and hilbert spaces, An algorithm for non-negative norm minimal solutions, On minimun norm and best approximate solutions of Av = b in normed spaces, A class of programming problems whose objective function contains a norm, An algorithm for approximation by elements of a cone in a banach space, A characterization of an element of best simultaneous approximation

Cites Work

• Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
• Uniqueness of Hahn-Banach Extensions and Unique Best Approximation
• The Lawson Algorithm and Extensions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item