Convex \(L^ p\) approximation

DOI10.1016/0021-9045(83)90041-2zbMath0517.41032OpenAlexW1990335621MaRDI QIDQ5902631

Bruce L. Chalmers, G. D. (Jerry) Taylor, A. G. Egger

Publication date: 1983

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(83)90041-2

zbMATH Keywords

iterative algorithmapproximating subspaces

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation with constraints (41A29)

Related Items (5)

Nonlinear eigenvector algorithms for local optimization in multivariate data analysis ⋮ A matrix-based IRLS algorithm for the least \(l_p\)-norm design of 2-D FIR filters ⋮ Convex \(L^ p\) approximation ⋮ Best approximation in \(L^{\infty}\) via iterative Hilbert space procedures ⋮ \(\mathcal{L}^p\)-approximation using fractal functions on the Sierpiński gasket

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniform approximation with constraints
• Characterization theorems for constrained approximation problems via optimization theory
• Construction of nearest points in the \(L^ p\), p even, and \(L^ \infty\) norms. I
• A Unified Approach to Uniform Real Approximation by Polynomials with Linear Restrictions

This page was built for publication: Convex \(L^ p\) approximation