On the discrete linear L₁ approximation and L₁ solutions of overdetermined linear equations
From MaRDI portal
Publication:2264933
Cites work
- Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
- An Algorithm for Minimax Polynomial Curve-Fitting of Discrete Data
- An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
- scientific article; zbMATH DE number 3167494 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- scientific article; zbMATH DE number 3186062 (Why is no real title available?)
- Linear L 1 Approximation for a Discrete Point Set and L 1 Solutions of Overdetermined Linear Equations
- Linear Programming Techniques for Regression Analysis
- Note on a Paper by Zuhovickii˘ Concerning the Tchebycheff Problem for Linear Equations
- Note on Jordan elimination, linear programming and Tchebyscheff approximation
- On L₁ Approximation II: Computation for Discrete Functions and Discretization Effects
- On the Best Linear Chebyshev Approximation
Cited in
(8)- Linear programming for weighted deviation problems using compact basis techniques
- Robust estimation based on the least absolute deviations method and the Kalman filter
- Correcting data corruption errors for multivariate function approximation
- 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
- Identification of corrupted data via k-means clustering for function approximation
This page was built for publication: On the discrete linear L\(_1\) approximation and L\(_1\) solutions of overdetermined linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264933)