Gaussian quadrature for sums: A rapidly convergent summation scheme
From MaRDI portal
Publication:3584808
DOI10.1090/S0025-5718-09-02289-3zbMath1205.40005MaRDI QIDQ3584808
Publication date: 30 August 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
Numerical quadrature and cubature formulas (65D32) Approximation to limiting values (summation of series, etc.) (40A25)
Related Items (3)
Quadrature rules for numerical integration based on Haar wavelets and hybrid functions ⋮ Alternatives to the Euler-Maclaurin formula for calculating infinite sums ⋮ Numerical integration of multi-dimensional highly oscillatory, gentle oscillatory and non-oscillatory integrands based on wavelets and radial basis functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bessel polynomials
- On summation formulas due to Plana, Lindelöf and Abel, and related Gauss-Christoffel rules. I
- The Hardy-Littlewood function: an exercise in slowly convergent series
- Gaussian Quadrature Involving Einstein and Fermi Functions with an Application to Summation of Series
- Practical Extrapolation Methods
- The SIAM 100-Digit Challenge
- Convergence acceleration by means of numerical quadrature
- Calculation of Gauss Quadrature Rules
- A Method of Computing Limit Values
This page was built for publication: Gaussian quadrature for sums: A rapidly convergent summation scheme