A numerical comparison of seven grids for polynomial interpolation on the interval
The quest for an optimal set of grid points for polynomial interpolation on a real interval has been greatly complicated by the fact that there are many different measures of ``optimal. In this article, six definitions of optimality are given: in the sense of Cauchy, Lebesgue, Fejér and Erdős, and furthermore the cardinal-function-minimizing optimality and the Vandermonde-function-minimizing optimality. The goal of Cauchy optimality is to minimize the classical function \(w(x)= \prod^n_{k=1} (x- x_k)\). The other measures depend upon the Lagrange polynomials here called cardinal functions. In this paper four of these optimality measures are computed for seven representative sets of grid points. The first grid consists of the roots of the Chebyshev polynomials. The second, third and fourth grids are Lobatto grids for Gegenbauer polynomials. The fifth and sixth sets of grid points will be the Lebesgue-optimal and Erdős-optimal grids numerically computed by \textit{Q. Chen} and \textit{I. Babuska} [Comput. Methods Appl. Mech. Eng. 128, No. 3-4, 405-417 (1995; Zbl 0862.65006); ibid. 147, No. 1, 89-94 (1996; Zbl 0877.65004); Commun. Numer. Methods Eng. 12, No. 8, 483-495 (1996; Zbl 0860.65001)], and the last grid is the expanded Chebyshev grid proposed by \textit{L. Brutman} [SIAM J. Numer. Anal. 15, 694-704 (1978; Zbl 0391.41002)]. It is shown that the grid which minimizes the Lebesgue constant is the best because it performs fairly well all of the considered four criteria.
- Optimal Lebesgue function type sums
- Lebesgue functions and Lebesgue constants in polynomial interpolation
- A comparison of interpolation grids over the triangle or the tetrahedron
- On the optimal Lebesgue constants for polynomial interpolation
- Near-optimal polynomial interpolation on spherical triangles
- A new triangular and tetrahedral basis for high‐order (hp) finite element methods
- A Practical Guide to Pseudospectral Methods
- A triangular spectral element method; applications to the incompressible Navier-Stokes equations.
- Approximate optimal points for polynomial interpolation of real functions in an interval and in a triangle
- Bounding the Lebesgue function for Lagrange interpolatin in a simplex
- From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex
- Hierarchical \(hp\) finite elements in hybrid domains
- scientific article; zbMATH DE number 4161349 (Why is no real title available?)
- scientific article; zbMATH DE number 43996 (Why is no real title available?)
- scientific article; zbMATH DE number 193036 (Why is no real title available?)
- scientific article; zbMATH DE number 1083107 (Why is no real title available?)
- scientific article; zbMATH DE number 937354 (Why is no real title available?)
- On the Lebesgue Function for Polynomial Interpolation
- Quasi-regional mapping for the \(p\)-version of the finite element method
- Spectral approximation for elliptic boundary value problems
- Spectral elements for transport-dominated equations
- Tetrahedral hp finite elements: Algorithms and flow simulations
- The optimal symmetrical points for polynomial interpolation of real functions in the tetrahedron
- Optimal Lebesgue function type sums
- The optimal symmetrical points for polynomial interpolation of real functions in the tetrahedron
- Novel differential quadrature element method for vibration analysis of hybrid nonlocal Euler-Bernoulli beams
- Differential quadrature domain decomposition method for a class of parabolic equations
- Prolate spheroidal wavefunctions as an alternative to Chebyshev and Legendre polynomials for spectral element and pseudospectral algorithms
- A general integration scheme in quadrature element method
- An efficient quadrature method for vibration analysis of thin elliptical plates with continuous and discontinuous edge conditions
- A rotation-free quadrature element formulation for free vibration analysis of thin sectorial plates with arbitrary boundary supports
- Novel weak form quadrature element method with expanded Chebyshev nodes
- On the generation of symmetric Lebesgue-like points in the triangle
- A Lobatto interpolation grid in the tetrahedron
- Elastoplastic buckling analysis of thick rectangular plates by using the differential quadrature method
- A note on total degree polynomial optimization by Chebyshev grids
- A new paradigm for deriving the higher-order 2D Hermite polynomial basis. I: A fully integrated wqem formulation for some fourth-order systems
- Computing Fekete and Lebesgue points: Simplex, square, disk
- A comparison of interpolation grids over the triangle or the tetrahedron
This page was built for publication: A numerical comparison of seven grids for polynomial interpolation on the interval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963113)
