Creating stable quadrature rules with preassigned points by interpolation

DOI10.1007/s10092-015-0145-0zbMath1343.65023OpenAlexW768978197MaRDI QIDQ295365

Hassan Majidian

Publication date: 13 June 2016

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10092-015-0145-0

zbMATH Keywords

stabilitynumerical examplepolynomial interpolationGaussian quadrature rule

Mathematics Subject Classification ID

Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32)

Related Items (2)

Constrained mock-Chebyshev least squares quadrature ⋮ Modified filon-Clenshaw-Curtis rules for oscillatory integrals with a nonlinear oscillator

Uses Software

• FastGaussQuadrature

Cites Work

• Unnamed Item
• On the constrained mock-Chebyshev least-squares
• Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
• Chebyshev interpolation with approximate nodes of unrestricted multiplicity
• Stable high-order quadrature rules with equidistant points
• Numerical Differentiation of Approximated Functions with Limited Order-of-Accuracy Deterioration
• Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
• A Fast Algorithm for the Calculation of the Roots of Special Functions
• Barycentric Lagrange Interpolation
• The numerical stability of barycentric Lagrange interpolation
• Fast and Accurate Computation of Gauss--Legendre and Gauss--Jacobi Quadrature Nodes and Weights

This page was built for publication: Creating stable quadrature rules with preassigned points by interpolation