The Polya algorithm for convex approximation
From MaRDI portal
Publication:1823409
DOI10.1016/0022-247X(89)90188-1zbMath0681.41021MaRDI QIDQ1823409
Douglas W. Townsend, David A. Legg
Publication date: 1989
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)
Related Items (3)
The Pólya algorithm on tubular sets ⋮ Best \(L_ 1\) approximation by convex functions ⋮ Polya properties in
Cites Work
- Unnamed Item
- The Polya algorithm in \(L_ \infty\) approximation
- The natural best \(L^ 1\)-approximation by nondecreasing functions
- The Polya algorithm on cylindrical sets
- Natural choice of \(L_ 1-\)approximants
- On projections and monotony in \(L_p\)-spaces
- Existence of Best n-Convex Approximations
- Approximations in $L^p $ and Chebyshev Approximations
- On the Existence and Characterization of Best Nonlinear Tchebycheff Approximations
This page was built for publication: The Polya algorithm for convex approximation