Mathematics of Computation · 1997 · 20 citations · 23 references
ComputingMathematicsAlgorithmsOptimizationTheory Of ComputationConvergence AnalysisNumerical AlgorithmsConvergenceInterpolation TheoryLagrange InterpolationLegendre PolynomialsLower BoundsPolynomial InterpolationZeros
Bounds are proved for the Stieltjes polynomial $E_{n+1}$, and lower bounds are proved for the distances of consecutive zeros of the Stieltjes polynomials and the Legendre polynomials $P_n$. This sharpens a known interlacing result of Szegö. As a byproduct, bounds are obtained for the Geronimus polynomials $G_n$. Applying these results, convergence theorems are proved for the Lagrange interpolation process with respect to the zeros of $E_{n+1}$, and for the extended Lagrange interpolation process with respect to the zeros of $P_n E_{n+1}$ in the uniform and weighted $L^p$ norms. The corresponding Lebesgue constants are of optimal order.
23
P. Túrán · Analysis Mathematica · 1975 · 1.6K citations
J. R., T. J. Rivlin · Mathematics of Computation · 1976 · 327 citations
Stieltjes Polynomials and Related Quadrature Rules
Giovanni Monegato · SIAM Review · 1982 · 107 citations