Advances in Numerical Analysis · 2016 · 12 citations · 11 references
ComputingComputer ScienceMathematicsAlgorithmsComputational GeometryGeometryApproximation AlgorithmsGeometric ApproximationNumerical AlgorithmsBarycentric Coordinate SystemsChebyshev ApproximationInterpolation PointsLagrange InterpolationLagrange's EquationsUpper Bound ComputationUpper Bounds
Lebesgue constant for Lagrange approximation at Sinc points will be examined. We introduce a new barycentric form for Lagrange approximation at Sinc points. Using Thiele’s algorithm we show that the Lebesgue constant grows logarithmically as the number of interpolation Sinc points increases. A comparison between the obtained upper bound of Lebesgue constant using Sinc points and other upper bounds for different set of points, like equidistant and Chebyshev points, is introduced.
11
Some New Aspects of Rational Interpolation
Claus Schneider, Wilhelm Werner · Mathematics of Computation · 1986 · 127 citations · Full text