A Steepest Ascent Method for the Chebyshev Problem
From MaRDI portal
Publication:5610681
DOI10.2307/2004966zbMath0208.40605MaRDI QIDQ5610681
Publication date: 1969
Full work available at URL: https://doi.org/10.2307/2004966
65F20: Numerical solutions to overdetermined systems, pseudoinverses
41A50: Best approximation, Chebyshev systems
65D15: Algorithms for approximation of functions
Related Items
The strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrix, Computational methods of linear algebra, Chebyshev solution of overdetermined systems of linear equations
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