A Steepest Ascent Method for the Chebyshev Problem

DOI10.2307/2004966zbMath0208.40605OpenAlexW4237415965MaRDI QIDQ5610681

Marcel Meicler

Publication date: 1969

Full work available at URL: https://doi.org/10.2307/2004966

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)

Related Items (3)

Computational methods of linear algebra ⋮ Chebyshev solution of overdetermined systems of linear equations ⋮ The strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Chebyshev Solution of an Inconsistent System of $n+1$ Linear Equations in n Unknowns in Terms of Its Least Squares Solution
• Chebyshev Solution of n+1 Linear Equations in n + 1 n Unknowns
• Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations
• Representations for the Generalized Inverse of a Partitioned Matrix
• Some Applications of the Pseudoinverse of a Matrix
• A Note on the Scroggs—Odell Pseudoinverse

This page was built for publication: A Steepest Ascent Method for the Chebyshev Problem