Computing the Strict Chebyshev Solution of Overdetermined Linear Equations

DOI10.2307/2006127zbMATH Open0398.65020OpenAlexW4241830712MaRDI QIDQ4181889FDOQ4181889

Authors: 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 mathematical programming methods (65K05) Linear programming (90C05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Algorithms for approximation of functions (65D15)

Cites Work

• Title not available (Why is that?)
• On the Best Linear Chebyshev Approximation
• Approximations in $L^p $ and Chebyshev Approximations
• Title not available (Why is that?)
• Tchebycheff approximation in a compact metric space
• A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$
• A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation
• Chebyshev solution of overdetermined systems of linear equations

Cited In (4)

• Properties of the strict Chebyshev solutions of the linear matrix equation \(AX+YB=C\)
• Strict Chebyshev approximation for general systems of linear equations
• 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\)

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

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