Proof of the conjectures of Bernstein and Erdős concerning the optimal nodes for polynomial interpolation
From MaRDI portal
Publication:1260310
DOI10.1016/0021-9045(78)90014-XzbMath0412.41002WikidataQ123008988 ScholiaQ123008988MaRDI QIDQ1260310
Publication date: 1978
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(78)90014-x
Related Items
A minimax problem for sums of translates on the torus, Unnamed Item, On trigonometric interpolation in an even number of points, Full recovery from point values: an optimal algorithm for Chebyshev approximability prior, Lebesgue functions and Lebesgue constants in polynomial interpolation, Subperiodic trigonometric interpolation and quadrature, On the optimal Lebesgue constants for polynomial interpolation, On asymptotics and estimates for the uniform norms of the Lagrange interpolation polynomials corresponding to the Chebyshev nodal points, Lebesgue constants for certain classes of nodes, Bounding the Lebesgue function for Lagrange interpolatin in a simplex, A note on polynomial interpolation at the Chebyshev extrema nodes, Lebesgue function for multivariate interpolation by radial basis functions, Error bounds for polynomial tensor product interpolation, Optimal interpolation with incomplete polynomials, A note on functions with interlacing roots, A lower bound on the norm of interpolation with an extended Tchebycheff system, Optimal interpolation with polynomials having fixed roots, Optimal interpolation in a general setting - a beginning, A characteristic of points in \({\mathbb{R}}^ 2\) having Lebesgue function of polynomial growth, A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm, Oscillating Tchebycheff systems, 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, In memoriam Paul Erdős (1913-1996), Note on the lower estimate of optimal Lebesgue constants, In memoriam -- Lev Brutman (1939--2001), Some new properties of Chebyshev polynomials, Hyperinterpolation on the sphere at the minimal projection order, Probability, minimax approximation, and Nash-equilibrium. Estimating the parameter of a biased coin, Lebesgue constant using sinc points, Rational approximation on infinite intervals, Polynomial solutions to second order linear homogeneous ordinary differential equations. Properties and approximation, Asymptotic behavior of Lebesgue constants in trigonometric interpolation, Extremal points for some sets of projections on C(I), Estimation of model quality, Approximate optimal points for polynomial interpolation of real functions in an interval and in a triangle, Allometry constants of finite-dimensional spaces: Theory and computations, New estimation for the Lebesgue function of Lagrange interpolation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm
- A theorem on interpolation in Haar subspaces
- Auswertung der Normen von Interpolationsoperatoren
- Covering spaces, fibre spaces, and local homeomorphisms
- Problems and results on the theory of interpolation. I
- Some conditions for a mapping to be a covering
- Optimization of the norm of the Lagrange interpolation operator
- On the Lebesgue Function for Polynomial Interpolation
- Some remarks on polynomials
