Computing Gaussian quadrature rules with high relative accuracy
From MaRDI portal
Publication:2679683
DOI10.1007/s11075-022-01297-9zbMath1506.65053OpenAlexW4281614030WikidataQ114224276 ScholiaQ114224276MaRDI QIDQ2679683
T. Laudadio, Nicola Mastronardi, Paul Van Dooren
Publication date: 23 January 2023
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-022-01297-9
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast variants of the Golub and Welsch algorithm for symmetric weight functions in Matlab
- Accurate singular values and differential qd algorithms
- Orthogonal polynomials (in Matlab)
- Chebfun and numerical quadrature
- Computing the eigenvectors of nonsymmetric tridiagonal matrices
- The QR and QL algorithms for symmetric matrices
- Fast computation of Gauss quadrature nodes and weights on the whole real line
- On Computing Eigenvectors of Symmetric Tridiagonal Matrices
- Accurate Singular Values of Bidiagonal Matrices
- A Fast Algorithm for the Calculation of the Roots of Special Functions
- LAPACK Users' Guide
- Factorizations of Transfer Functions
- Forward Instability of Tridiagonal QR
- Accuracy and Stability of Numerical Algorithms
- Fast and Accurate Computation of Gauss--Legendre and Gauss--Jacobi Quadrature Nodes and Weights
- Error Analysis of Recurrence Equations
- Computational Aspects of Three-Term Recurrence Relations
- Calculation of Gauss Quadrature Rules
- Error Analysis of Miller's Recurrence Algorithm