Lebesgue constant using sinc points
From MaRDI portal
Summary: 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.
Recommendations
- The Lebesgue constant for sinc approximations
- Lebesgue constants for Leja points
- Lebesgue points via the Poincaré inequality
- On the Lebesgue constants
- scientific article; zbMATH DE number 92477
- scientific article; zbMATH DE number 502890
- The Lebesgue constants for Leja points are subexponential
- Lebesgue Points for Fractional Integral
- Lebesgue points of fractional integrals
- Sharp bounds for the arc lemniscate sine function
Cites work
- A Practical Guide to Pseudospectral Methods
- An Extension of the Floater–Hormann Family of Barycentric Rational Interpolants
- An improved upper bound on the Lebesgue constant of Berrut's rational interpolation operator
- Barycentric rational interpolation with no poles and high rates of approximation
- Bounding the Lebesgue constant for Berrut's rational interpolant at general nodes
- Fehlerfortpflanzung bei Interpolation
- Handbook of Sinc numerical methods. With CD-ROM.
- scientific article; zbMATH DE number 435359 (Why is no real title available?)
- scientific article; zbMATH DE number 3936360 (Why is no real title available?)
- scientific article; zbMATH DE number 3708924 (Why is no real title available?)
- Improved approximation via use of transformations
- Lebesgue constants in polynomial interpolation
- Matrices for the direct determination of the barycentric weights of rational interpolation
- On Lebesgue constants of local parabolic splines
- On the Lebesgue constant of Berrut's rational interpolant at equidistant nodes
- On the Lebesgue Function for Polynomial Interpolation
- Problems and results on the theory of interpolation. II
- Proof of the conjectures of Bernstein and Erdős concerning the optimal nodes for polynomial interpolation
- Rational functions for guaranteed and experimentally well-conditioned global interpolation
- Reusing Chebyshev points for polynomial interpolation
- Some New Aspects of Rational Interpolation
- The Lebesgue constant for sinc approximations
- Two results on polynomial interpolation in equally spaced points
- Weighted interpolation for equidistant nodes
Cited in
(10)- Troesch's problem solved by sinc methods
- Discontinuous Galerkin methods using poly-sinc approximation
- Poly-Sinc solution of stochastic elliptic differential equations
- Convergence rate estimation of poly-sinc-based discontinuous Galerkin methods
- Polynomial-Sinc collocation method combined with the Legendre-Gauss quadrature rule for numerical solution of distributed order fractional differential equations
- Poly-sinc collocation method for solving coupled Burgers' equations with a large Reynolds number
- Estimates for the Lebesgue functions and the Nevai formula for the sinc-approximations of continuous functions on an interval
- The Lebesgue constant for sinc approximations
- Fractional Fokker-Planck equation
- Adaptive piecewise Poly-Sinc methods for function approximation
This page was built for publication: Lebesgue constant using sinc points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1750803)
