Abstract
An efficient algorithm for the accurate computation of Gauss-Legendre and Gauss-Jacobi quadrature nodes and weights is presented. The algorithm is based on Newton's root-finding method with initial guesses and function evaluations computed via asymptotic formulae. The n-point quadrature rule is computed in O(n) operations to an accuracy of essentially double precision for any n ≥ 100. © 2013 Society for Industrial and Applied Mathematics.
Original language | English (US) |
---|---|
Pages (from-to) | A652-A674 |
Number of pages | 1 |
Journal | SIAM Journal on Scientific Computing |
Volume | 35 |
Issue number | 2 |
DOIs | |
State | Published - Mar 6 2013 |
Externally published | Yes |