On the discrete linear L\(_1\) approximation and L\(_1\) solutions of overdetermined linear equations

DOI10.1016/0021-9045(74)90037-9zbMath0273.41017OpenAlexW2081719555MaRDI QIDQ2264933

Nabih N. Abdelmalek

Publication date: 1974

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(74)90037-9

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Numerical approximation and computational geometry (primarily algorithms) (65D99) Approximation by arbitrary linear expressions (41A45)

Related Items

Chebyshev and L₁solutions of overdetermined systems of linear equations with bounded variables ⋮ Piecewise linear L₁approximation of planar curves† ⋮ Polygonal approximation of planar curves in theL₁norm ⋮ Robust estimation based on the least absolute deviations method and the Kalman filter ⋮ Linear one-sided approximation algorithms for the solution of overdetermined systems of linear inequalities ⋮ Linear programming for weighted deviation problems using compact basis techniques ⋮ Correcting Data Corruption Errors for Multivariate Function Approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
• Note on a Paper by Zuhovickii˘ Concerning the Tchebycheff Problem for Linear Equations
• Linear Programming Techniques for Regression Analysis
• On the Best Linear Chebyshev Approximation
• On $L_1 $ Approximation II: Computation for Discrete Functions and Discretization Effects
• Linear L ₁ Approximation for a Discrete Point Set and L ₁ Solutions of Overdetermined Linear Equations
• An Algorithm for Minimax Polynomial Curve-Fitting of Discrete Data