Location of Repository

Fast and accurate computation of Gauss-Legendre and Gauss-Jacobi quadrature nodes and weights

By Nicholas Hale and Alex Townsend


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 \geq 100$

Topics: Special functions, Approximations and expansions, Numerical analysis
Publisher: Unspecified
Year: 2012
OAI identifier: oai:generic.eprints.org:1600/core69
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://eprints.maths.ox.ac.uk/... (external link)
  • http://eprints.maths.ox.ac.uk/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.