Computational experience with an algorithm for discrete \(L_ 1\) approximation

DOI10.1007/BF02237982zbMath0458.65008OpenAlexW109146843MaRDI QIDQ1151717

S. Baboolal, G. Alistair Watson

Publication date: 1981

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02237982

zbMATH Keywords

linear approximationconvergence resultcomputational experiencediscrete \(L_1\) approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)

Related Items (1)

Nonlinear eigenvector algorithms for local optimization in multivariate data analysis

Uses Software

• NAG
• Algorithm 478

Cites Work

• Unnamed Item
• Unnamed Item
• On the convergence of an algorithm for discrete \(L_p\) approximation
• Computational experiences with discrete L\(_p\)-approximation
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
• $L_p $-Criteria for the Estimation of Location Parameters
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation

This page was built for publication: Computational experience with an algorithm for discrete \(L_ 1\) approximation