On the discrete linear L\(_1\) approximation and L\(_1\) solutions of overdetermined linear equations
From MaRDI portal
Publication:2264933
DOI10.1016/0021-9045(74)90037-9zbMath0273.41017MaRDI QIDQ2264933
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
41A50: Best approximation, Chebyshev systems
65D99: Numerical approximation and computational geometry (primarily algorithms)
41A45: Approximation by arbitrary linear expressions
Related Items
Linear programming for weighted deviation problems using compact basis techniques, Linear one-sided approximation algorithms for the solution of overdetermined systems of linear inequalities, Chebyshev and L1solutions of overdetermined systems of linear equations with bounded variables, Piecewise linear L1approximation of planar curves†, Polygonal approximation of planar curves in theL1norm
Cites Work
- 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 1 Approximation for a Discrete Point Set and L 1 Solutions of Overdetermined Linear Equations
- An Algorithm for Minimax Polynomial Curve-Fitting of Discrete Data
- Unnamed Item
- Unnamed Item
- Unnamed Item