• D01 Introduction
• d01ah – One-dimensional quadrature, adaptive, finite interval, strategy due to Patterson, suitable for well-behaved integrands
• d01aj – One-dimensional quadrature, adaptive, finite interval, strategy due to Piessens and de Doncker, allowing for badly behaved integrands
• d01ak – One-dimensional quadrature, adaptive, finite interval, method suitable for oscillating functions
• d01al – One-dimensional quadrature, adaptive, finite interval, allowing for singularities at user-specified break-points
• d01an – One-dimensional quadrature, adaptive, finite interval, weight function cos(( omega x)) or sin(( omega x))
• d01ap – One-dimensional quadrature, adaptive, finite interval, weight function with end-point singularities of algebraico-logarithmic type
• d01aq – One-dimensional quadrature, adaptive, finite interval, weight function 1/(x-c), Cauchy principal value (Hilbert transform)
• d01ar – One-dimensional quadrature, non-adaptive, finite interval with provision for indefinite integrals
• d01as – One-dimensional quadrature, adaptive, semi-infinite interval, weight function cos(( omega x)) or sin(( omega x))
• d01at – One-dimensional quadrature, adaptive, finite interval, variant of d01aj efficient on vector machines
• d01au – One-dimensional quadrature, adaptive, finite interval, variant of d01sk efficient on vector machines
• d01ba – One-dimensional Gaussian quadrature
• d01bb – Pre-computed weights and abscissae for Gaussian quadrature rules, restricted choice of rule
• d01bc – Calculation of weights and abscissae for Gaussian quadrature rules, general choice of rule
• d01da – Two-dimensional quadrature, finite region
• d01fb – Multidimensional Gaussian quadrature over hyper-rectangle
• d01fd – Multidimensional quadrature, Sag–Szekeres method, general product region or n-sphere
• d01ga – One-dimensional quadrature, integration of function defined by data values, Gill–Miller method
• d01gb – Multidimensional quadrature over hyper-rectangle, Monte–Carlo method