The Polya algorithm in \(L_ \infty\) approximation
From MaRDI portal
Publication:1054928
DOI10.1016/0021-9045(83)90129-6zbMath0519.41027OpenAlexW2046335995MaRDI QIDQ1054928
Richard B. Darst, David A. Legg, Douglas W. Townsend
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)90129-6
Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15)
Related Items (6)
The Pólya algorithm on tubular sets ⋮ Conditional bounds and best \(L_{\infty}\)-approximations in probability spaces ⋮ Best \(L_ 1\)-approximation of bounded, approximately continuous functions on [0,1 by nondecreasing functions] ⋮ The Polya algorithm for convex approximation ⋮ Best monotone approximation in \(L_{\infty}[0,1\)] ⋮ Best \(L_ 1\)-approximation of quasi continuous functions on [0,1 by nondecreasing functions]
Cites Work
This page was built for publication: The Polya algorithm in \(L_ \infty\) approximation