A Steepest Ascent Method for the Chebyshev Problem

DOI10.2307/2004966MaRDI QIDQ5610681zbMATH OpenOpenAlexFDO

Authors Marcel Meicler

Publication date 1969

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

Mathematics Subject Classification ID

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

Cites work

• A Note on the Scroggs—Odell Pseudoinverse
• 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
• scientific article; zbMATH DE number 3258269 (Why is no real title available?)
• scientific article; zbMATH DE number 3111121 (Why is no real title available?)
• 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

Cited in

(3)

• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5610681)