Computing the Strict Chebyshev Solution of Overdetermined Linear Equations

DOI10.2307/2006127zbMath0398.65020OpenAlexW4241830712MaRDI QIDQ4181889

Nabih N. Abdelmalek

Publication date: 1977

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

zbMATH Keywords

Linear ProgrammingOverdetermined Linear EquationsStrict Chebyshev Solution

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Linear programming (90C05) Algorithms for approximation of functions (65D15)

Related Items (4)

Strict Chebyshev approximation for general systems of 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 ⋮ The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)

Cites Work

• Tchebycheff approximation in a compact metric space
• A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation
• Chebyshev solution of overdetermined systems of linear equations
• Approximations in $L^p $ and Chebyshev Approximations
• On the Best Linear Chebyshev Approximation
• A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the Strict Chebyshev Solution of Overdetermined Linear Equations