On the convergence of an algorithm for discrete \(L_p\) approximation

DOI10.1007/BF01401047zbMath0427.65010OpenAlexW2429034345MaRDI QIDQ1136475

Jerry M. Wolfe

Publication date: 1979

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132622

zbMATH Keywords

algorithmbest approximationconvergence propertiesdiscrete Lp approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)

Related Items (max. 100)

Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems ⋮ An algorithm for non-negative norm minimal solutions ⋮ Computational experience with an algorithm for discrete \(L_ 1\) approximation ⋮ An algorithm for discrete linear \(L_ p\) approximation ⋮ Unicity in piecewise polynomial 𝐿¹-approximation via an algorithm ⋮ On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory ⋮ On the convergence of a class of nonlinear approximation methods ⋮ Convex \(L^ p\) approximation ⋮ 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

• On two methods for discrete \(L_p\) approximation
• Computational experiences with discrete L\(_p\)-approximation
• The calculation of linear best Lp approximations
• Calculation of linear bestL p -approximations
• Best L p Approximation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the convergence of an algorithm for discrete \(L_p\) approximation