C06EAF | Single one-dimensional real discrete Fourier transform, no extra workspace |

C06EBF | Single one-dimensional Hermitian discrete Fourier transform, no extra workspace |

C06ECF | Single one-dimensional complex discrete Fourier transform, no extra workspace |

C06FAF | Single one-dimensional real discrete Fourier transform, extra workspace for greater speed |

C06FBF | Single one-dimensional Hermitian discrete Fourier transform, extra workspace for greater speed |

C06FCF | Single one-dimensional complex discrete Fourier transform, extra workspace for greater speed |

C06FFF | One-dimensional complex discrete Fourier transform of multidimensional data |

C06FPF | Multiple one-dimensional real discrete Fourier transforms |

C06FQF | Multiple one-dimensional Hermitian discrete Fourier transforms |

C06FRF | Multiple one-dimensional complex discrete Fourier transforms |

C06PAF | Single one-dimensional real and Hermitian complex discrete Fourier transform, using complex storage format for Hermitian sequences |

C06PCF | Single one-dimensional complex discrete Fourier transform, complex data type |

C06PFF | One-dimensional complex discrete Fourier transform of multidimensional data (using complex data type) |

C06PPF | Multiple one-dimensional real and Hermitian complex discrete Fourier transforms, using row ordered complex storage format for Hermitian sequences |

C06PQF | Multiple one-dimensional real and Hermitian complex discrete Fourier transforms, using column ordered complex storage format for Hermitian sequences |

C06PRF | Multiple one-dimensional complex discrete Fourier transforms using complex data type |

C06PSF | Multiple one-dimensional complex discrete Fourier transforms using complex data type and sequences stored as columns |

D01AHF | One-dimensional quadrature, adaptive, finite interval, strategy due to Patterson, suitable for well-behaved integrands |

D01AJF | One-dimensional quadrature, adaptive, finite interval, strategy due to Piessens and de Doncker, allowing for badly behaved integrands |

D01AKF | One-dimensional quadrature, adaptive, finite interval, method suitable for oscillating functions |

D01ALF | One-dimensional quadrature, adaptive, finite interval, allowing for singularities at user-specified break-points |

D01AMF | One-dimensional quadrature, adaptive, infinite or semi-infinite interval |

D01ANF | One-dimensional quadrature, adaptive, finite interval, weight function cos(ωx) or sin(ωx) |

D01APF | One-dimensional quadrature, adaptive, finite interval, weight function with end-point singularities of algebraico-logarithmic type |

D01AQF | One-dimensional quadrature, adaptive, finite interval, weight function 1 / (x - c), Cauchy principal value (Hilbert transform) |

D01ARF | One-dimensional quadrature, non-adaptive, finite interval with provision for indefinite integrals |

D01ASF | One-dimensional quadrature, adaptive, semi-infinite interval, weight function cos(ωx) or sin(ωx) |

D01ATF | One-dimensional quadrature, adaptive, finite interval, variant of D01AJF efficient on vector machines |

D01AUF | One-dimensional quadrature, adaptive, finite interval, variant of D01AKF efficient on vector machines |

D01BAF | One-dimensional Gaussian quadrature |

D01BDF | One-dimensional quadrature, non-adaptive, finite interval |

D01GAF | One-dimensional quadrature, integration of function defined by data values, Gill–Miller method |

© The Numerical Algorithms Group Ltd, Oxford UK. 2011