Optimal interpolation with polynomials having fixed roots

DOI10.1016/0021-9045(87)90075-XMaRDI QIDQ1107753zbMATH OpenFDO

Authors Theodore Kilgore

Publication date 1987

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

Full work available at URL https://doi.org/10.1016/0021-9045(87)90075-X

zbMATH Keywords

Bernstein polynomialsn-convex functionoptimal interpolation

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Approximation by polynomials (41A10) Best approximation, Chebyshev systems (41A50)

Review text

The author investigates optimal interpolation of potor transforms every continuous, n-convex function into an r-convex function. Their proof is based on the fact that the Bernstein polynomials of a continuous, n- convex function F (which converges uniformly to F) are themselves n- convex. We express the result of Bojanic and Roulier in a slightly different notation and terminology and then we take a similar approach, after obtaining various decompositions of an n-convex function, to obtain new sufficient conditions that a continuous linear operator transforms every continuous n-convex function into an r-convex function.

Recommendations

• Continuous linear transformations of n-convex functions
• On \(j\)-convex preserving interpolation operators
• scientific article; zbMATH DE number 66953
• Interpolatory pointwise estimates for convex polynomial approximation
• Optimality of piecewise image-linear interpolating operators

Cites work

• A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm
• A note on functions with interlacing roots
• Optimal interpolation with incomplete polynomials
• Optimization of the norm of the Lagrange interpolation operator
• Proof of the conjectures of Bernstein and Erdős concerning the optimal nodes for polynomial interpolation
• Some remarks on polynomials

Cited in

(9)

• A lower bound on the norm of interpolation with an extended Tchebycheff system
• Continuous linear transformations of n-convex functions
• Optimal interpolation in a general setting - a beginning
• Best interpolation with polynomials lacking the linear term
• Optimal interpolation with exponentially weighted polynomials on an unbounded interval
• A minimax problem admitting the equioscillation characterization of Bernstein and Erdös
• Optimality of piecewise image-linear interpolating operators
• scientific article; zbMATH DE number 4019649 (Why is no real title available?)
• On the simultaneous approximation of derivatives by Lagrange and Hermite interpolation

This page was built for publication: Optimal interpolation with polynomials having fixed roots

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