The Polya algorithm in L_ approximation

DOI10.1016/0021-9045(83)90129-6MaRDI QIDQ1054928zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

uniformly convex Banach spacePolya algorithmnon-decreasing functions

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15)

Cites work

• scientific article; zbMATH DE number 3137662 (Why is no real title available?)
• scientific article; zbMATH DE number 3295416 (Why is no real title available?)
• scientific article; zbMATH DE number 3370999 (Why is no real title available?)
• scientific article; zbMATH DE number 3186062 (Why is no real title available?)
• Convergence of L p Approximations as p →∞
• Favard's Solution is the Limit of W k,p -Splines
• Isotone optimization. II
• Isotonic approximation in \(L_ s\).
• On projections and monotony in \(L_p\)-spaces

Cited in

(6)

• The Pólya algorithm on tubular sets
• The Polya algorithm for convex approximation
• 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
• Best monotone approximation in \(L_{\infty}[0,1]\)
• Best \(L_ 1\)-approximation of quasi continuous functions on [0,1] by nondecreasing functions

This page was built for publication: The Polya algorithm in \(L_ \infty\) approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1054928)