legendre_fast_rule


legendre_fast_rule, an Octave code which implements a fast algorithm for the computation of the points and weights of the Gauss-Legendre quadrature rule.

The standard algorithm for computing the N points and weights of such a rule is by Golub and Welsch. It sets up and solves an eigenvalue problem, whose solution requires work of order N*N.

By contrast, the fast algorithm, by Glaser, Liu and Rokhlin, can compute the same information expending work of order N. For quadrature problems requiring high accuracy, where N might be 100 or more, the fast algorithm provides a significant improvement in speed.

The Gauss-Legendre quadrature rule is designed for the interval [-1,+1].

The Gauss-Legendre quadrature assumes that the integrand has the form:

        Integral ( -1 <= x <= +1 ) f(x) dx
      

The standard Gauss-Legendre quadrature rule is used as follows:

        Integral ( -1 <= x <= +1 ) f(x) dx
      
is to be approximated by
        Sum ( 1 <= i <= order ) w(i) * f(x(i)) 
      

This program allows the user to request that the rule be transformed from the standard interval [-1,+1] to the interval [a,b].

Usage:

legendre_fast_rule ( n, a, b )
where

Licensing:

The computer code and data files described and made available on this web page are distributed under the MIT license

Languages:

legendre_fast_rule is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version.

Related Data and Programs:

legendre_fast_rule_test

alpert_rule, an Octave code which sets up an Alpert quadrature rule for functions which are regular, log(x) singular, or 1/sqrt(x) singular.

chebyshev1_rule, an Octave code which can compute and print a Gauss-Chebyshev type 1 quadrature rule.

chebyshev2_rule, an Octave code which can compute and print a gauss-chebyshev type 2 quadrature rule.

clenshaw_curtis_rule, an Octave code which defines a clenshaw curtis quadrature rule.

gegenbauer_rule, an Octave code which can compute and print a gauss-gegenbauer quadrature rule.

gen_hermite_rule, an Octave code which can compute and print a generalized gauss-hermite quadrature rule.

gen_laguerre_rule, an Octave code which can compute and print a generalized gauss-laguerre quadrature rule.

hermite_rule, an Octave code which can compute and print a gauss-hermite quadrature rule.

jacobi_rule, an Octave code which can compute and print a gauss-jacobi quadrature rule.

laguerre_rule, an Octave code which can compute and print a gauss-laguerre quadrature rule.

legendre_rule, an Octave code which can compute and print a gauss-legendre quadrature rule.

patterson_rule, an Octave code which computes a gauss-patterson quadrature rule.

product_rule, an Octave code which constructs a product rule from 1d factor rules.

Reference:

  1. Andreas Glaser, Xiangtao Liu, Vladimir Rokhlin,
    A fast algorithm for the calculation of the roots of special functions,
    SIAM Journal on Scientific Computing,
    Volume 29, Number 4, pages 1420-1438, 2007.

Source Code:


Last revised on 14 February 2019.