An improved error bound on Gauss quadrature
From MaRDI portal
Publication:274227
DOI10.1016/j.aml.2016.01.015zbMath1336.41012OpenAlexW2258903751MaRDI QIDQ274227
Publication date: 22 April 2016
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2016.01.015
Related Items (3)
Sensitivity Analysis for Stability of Uncertain Delay Differential Equations Using Polynomial Chaos Expansions ⋮ Monte Carlo with determinantal point processes ⋮ Polynomial (chaos) approximation of maximum eigenvalue functions. Efficiency and limitations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On a conjecture of D. B. Hunter
- On a problem proposed by H.Braß concerning the remainder term in quadrature for convex functions
- Gaussian integration of Chebyshev polynomials and analytic functions
- Error estimates for Clenshaw-Curtis quadrature
- $\mathcal{O}(1)$ Computation of Legendre Polynomials and Gauss--Legendre Nodes and Weights for Parallel Computing
- A Fast Algorithm for the Calculation of the Roots of Special Functions
- New Inequalities for the Zeros of Jacobi Polynomials
- Inequalities for the Zeros of Ultraspherical Polynomials and Bessel Functions
- On the Convergence Rates of Gauss and Clenshaw--Curtis Quadrature for Functions of Limited Regularity
- Fast and Accurate Computation of Gauss--Legendre and Gauss--Jacobi Quadrature Nodes and Weights
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- On the Gaussian Integration of Chebyshev Polynomials
This page was built for publication: An improved error bound on Gauss quadrature