On two methods for discrete \(L_p\) approximation

DOI10.1007/BF02253212zbMath0365.65008MaRDI QIDQ1241249

G. Alistair Watson

Publication date: 1977

Published in: Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Approximation by other special function classes (41A30)

Related Items (7)

Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems ⋮ On the convergence of an algorithm for discrete \(L_p\) approximation ⋮ On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory ⋮ Clusterwise linear regression ⋮ Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l₁- and l_∞-norms ⋮ Approximation in normed linear spaces ⋮ The \(\ell_p\)-solution of the linear matrix equation \(AX+YB=C\)

Cites Work

• Computational experiences with discrete L\(_p\)-approximation
• The calculation of linear best Lp approximations
• Best L p Approximation
• Unnamed Item

This page was built for publication: On two methods for discrete \(L_p\) approximation