A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$

DOI10.1137/0710060zbMath0232.65033OpenAlexW2014211911MaRDI QIDQ5640652

M. G. Temple, C. S. Duris

Publication date: 1973

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0710060

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (10)

Strict Chebyshev approximation for general systems of linear equations ⋮ Computing the Strict Chebyshev Solution of Overdetermined Linear Equations ⋮ Properties of the strict Chebyshev solutions of the linear matrix equation \(AX+YB=C\) ⋮ Hoffman's error bounds and uniform Lipschitz continuity of best \(l_ p\)-approximations ⋮ Computational methods of linear algebra ⋮ A simplex based algorithm for the lexicographically extended linear maxmin problem ⋮ Leximin optimality and fuzzy set-theoretic operations. ⋮ The strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrix ⋮ An algorithm for the computation of strict approximations in subspaces of spline functions ⋮ The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)

This page was built for publication: A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$