Iterative methods with certified convergence for the computation of Gauss–Jacobi quadratures are described. The methods do not require a priori estimations of the nodes to guarantee its fourth-order convergence. They are shown to be generally faster than previous methods and without practical restrictions on the range of the parameters. The evaluation of the nodes and weights of the quadrature is exclusively based on convergent processes which, together with the fourth-order convergence of the fixed point method for computing the nodes, makes this an ideal approach for high-accuracy computations, so much so that computations of quadrature rules with even millions of nodes and thousands of digits are possible on a typical laptop.

Gaussian quadrature, Iterative methods, Jacobi polynomials
doi.org/10.1007/s11075-020-01012-6
Numerical Algorithms
Centrum Wiskunde & Informatica, Amsterdam, The Netherlands

Gil, A, Segura, J, & Temme, N.M. (2020). Fast and reliable high-accuracy computation of Gauss–Jacobi quadrature. Numerical Algorithms. doi:10.1007/s11075-020-01012-6