Journal
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
Volume 403, Issue -, Pages -Publisher
ELSEVIER
DOI: 10.1016/j.cam.2021.113850
Keywords
Patterson quadrature rules; Suboptimal rules; Stable numerical method; Stieltjes polynomials; Gauss-Kronrod quadrature
Categories
Ask authors/readers for more resources
This paper presents a stable and efficient algorithm for computing positive suboptimal extensions of the Gaussian quadrature rule with reduced polynomial exactness compared to the corresponding Kronrod extension. The algorithm is based on determining an associated Jacobi matrix and finding the nodes and weights as the matrix's eigenvalues and eigenvectors, similar to the Golub-Welsch algorithm.
We describe a stable and efficient algorithm for computing positive suboptimal extensions of the Gaussian quadrature rule with one or two degrees less of polynomial exactness than the corresponding Kronrod extension. These rules constitute a particular case of those first considered by Begumisa and Robinson (1991) and then by Patterson (1993) and have been proven to verify asymptotically good properties for a large class of weight functions. In particular, they may exist when the Gauss-Kronrod rule does not. The proposed algorithm is a nontrivial modification of the one introduced by Laurie (1997) for the Gauss-Kronrod quadrature, and it is based on the determination of an associated Jacobi matrix. The nodes and weights of the rule are then given as the eigenvalues and eigenvectors of the matrix, as in the classical Golub-Welsch algorithm (1969). (c) 2021 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available