Settings help

FL Name Style:

FL Specification Language:

D01 (Quad) Chapter Introduction – A description of the Chapter and an overview of the algorithms available.

Routine
Mark of
Introduction

Purpose
One-dimensional quadrature, adaptive, finite interval, strategy due to Patterson, suitable for well-behaved integrands
One-dimensional quadrature, adaptive, finite interval, weight function $\mathrm{cos}\left(\omega x\right)$ or $\mathrm{sin}\left(\omega x\right)$
One-dimensional quadrature, adaptive, finite interval, weight function with end-point singularities of algebraico-logarithmic type
One-dimensional quadrature, adaptive, finite interval, weight function $1/\left(x-c\right)$, Cauchy principal value (Hilbert transform)
One-dimensional quadrature, adaptive, semi-infinite interval, weight function $\mathrm{cos}\left(\omega x\right)$ or $\mathrm{sin}\left(\omega x\right)$
Multidimensional quadrature, Sag–Szekeres method, general product region or $n$-sphere
One-dimensional quadrature, integration of function defined by data values, Gill–Miller method
Multidimensional quadrature over hyper-rectangle, Monte Carlo method
Multidimensional quadrature, general product region, number-theoretic method
Multidimensional quadrature, general product region, number-theoretic method, variant of d01gcf efficient on vector machines
Korobov optimal coefficients for use in d01gcf or d01gdf, when number of points is prime
Korobov optimal coefficients for use in d01gcf or d01gdf, when number of points is product of two primes
Multidimensional quadrature over an $n$-sphere, allowing for badly behaved integrands
Multidimensional quadrature over an $n$-simplex
Determine required array dimensions for d01raf
One-dimensional quadrature, adaptive, finite interval, strategy due to Piessens and de Doncker, allowing for badly behaved integrands
One-dimensional quadrature, adaptive, infinite or semi-infinite interval, strategy due to Piessens and de Doncker
Pre-computed weights and abscissae for Gaussian quadrature rules, restricted choice of rule
Calculation of weights and abscissae for Gaussian quadrature rules, general choice of rule
Calculation of weights and abscissae for Gaussian quadrature rules, method of Golub and Welsch
Generates recursion coefficients needed by d01tdf to calculate a Gaussian quadrature rule
One-dimensional Gaussian quadrature, choice of weight functions (vectorized)
Non-automatic routine to evaluate
Option setting routine
Option getting routine
One-dimensional quadrature, adaptive, finite interval, strategy due to Piessens and de Doncker, allowing for badly behaved integrands (single abscissa interface)