A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3167494 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3248502 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
- Chebyshev and l^1 -Solutions of Linear Equations Using Least Squares Solutions
- Construction of nearest points in the \(L^ p\), p even, and \(L^ \infty\) norms. I
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
- Newton's method for convex programming and Tschebyscheff approximation
- Note on Jordan elimination, linear programming and Tchebyscheff approximation
- Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations
- On Solving Nonlinear Equations with a One-Parameter Operator Imbedding
- On the Best Linear Chebyshev Approximation
- The Solution of Nonlinear Systems of Equations by A-Stable Integration Techniques
- Über diskrete und lineare Tschebyscheff-Approximationen
Cited in
(5)
This page was built for publication: A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4045511)
