NAG Fortran Library

Library Contents

A00:  Library Identification

A00AAF    Prints details of the NAG Fortran Library implementation

A02:  Complex Arithmetic

Chapter Introduction
A02AAF    Square root of complex number
A02ABF    Modulus of complex number
A02ACF    Quotient of two complex numbers

C02:  Zeros of Polynomials

Chapter Introduction
C02AFF    All zeros of complex polynomial, modified Laguerre method
C02AGF    All zeros of real polynomial, modified Laguerre method
C02AHF    All zeros of complex quadratic equation
C02AJF    All zeros of real quadratic equation
C02AKF    All zeros of real cubic equation
C02ALF    All zeros of real quartic equation
C02AMF    All zeros of complex cubic equation
C02ANF    All zeros of complex quartic equation

C05:  Roots of One or More Transcendental Equations

Chapter Introduction
C05ADF    Zero of continuous function in given interval, Bus and Dekker algorithm
C05AGF    Zero of continuous function, Bus and Dekker algorithm, from given starting value, binary search for interval
C05AJF    Zero of continuous function, continuation method, from a given starting value
C05AVF    Binary search for interval containing zero of continuous function (reverse communication)
C05AXF    Zero of continuous function by continuation method, from given starting value (reverse communication)
C05AZF    Zero in given interval of continuous function by Bus and Dekker algorithm (reverse communication)
C05NBF    Solution of system of nonlinear equations using function values only (easy-to-use)
C05NCF    Solution of system of nonlinear equations using function values only (comprehensive)
C05NDF    Solution of system of nonlinear equations using function values only (reverse communication)
C05PBF    Solution of system of nonlinear equations using first derivatives (easy-to-use)
C05PCF    Solution of system of nonlinear equations using first derivatives (comprehensive)
C05PDF    Solution of system of nonlinear equations using first derivatives (reverse communication)
C05ZAF    Check user's routine for calculating first derivatives

C06:  Summation of Series

Chapter Introduction
C06BAF    Acceleration of convergence of sequence, Shanks' transformation and epsilon algorithm
C06DBF    Sum of a Chebyshev series
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
C06EKF    Circular convolution or correlation of two real vectors, 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 multi-dimensional data
C06FJF    Multi-dimensional complex discrete Fourier transform of multi-dimensional data
C06FKF    Circular convolution or correlation of two real vectors, extra workspace for greater speed
C06FPF    Multiple one-dimensional real discrete Fourier transforms
C06FQF    Multiple one-dimensional Hermitian discrete Fourier transforms
C06FRF    Multiple one-dimensional complex discrete Fourier transforms
C06FUF    Two-dimensional complex discrete Fourier transform
C06FXF    Three-dimensional complex discrete Fourier transform
C06GBF    Complex conjugate of Hermitian sequence
C06GCF    Complex conjugate of complex sequence
C06GQF    Complex conjugate of multiple Hermitian sequences
C06GSF    Convert Hermitian sequences to general complex sequences
C06HAF    Discrete sine transform
C06HBF    Discrete cosine transform
C06HCF    Discrete quarter-wave sine transform
C06HDF    Discrete quarter-wave cosine transform
C06LAF    Inverse Laplace transform, Crump's method
C06LBF    Inverse Laplace transform, modified Weeks' method
C06LCF    Evaluate inverse Laplace transform as computed by C06LBF
C06PAF    Single one-dimensional real and Hermitian complex discrete Fourier transform, using complex data format for Hermitian sequences
C06PCF    Single one-dimensional complex discrete Fourier transform, complex data format
C06PFF    One-dimensional complex discrete Fourier transform of multi-dimensional data (using complex data type)
C06PJF    Multi-dimensional complex discrete Fourier transform of multi-dimensional data (using complex data type)
C06PKF    Circular convolution or correlation of two complex vectors
C06PPF    Multiple one-dimensional real and Hermitian complex discrete Fourier transforms, using complex data format for Hermitian sequences
C06PQF    Multiple one-dimensional real and Hermitian complex discrete Fourier transforms, using complex data format for Hermitian sequences
C06PRF    Multiple one-dimensional complex discrete Fourier transforms using complex data format
C06PSF    Multiple one-dimensional complex discrete Fourier transforms using complex data format and sequences stored as columns
C06PUF    Two-dimensional complex discrete Fourier transform, complex data format
C06PXF    Three-dimensional complex discrete Fourier transform, complex data format
C06RAF    Discrete sine transform (easy-to-use)
C06RBF    Discrete cosine transform (easy-to-use)
C06RCF    Discrete quarter-wave sine transform (easy-to-use)
C06RDF    Discrete quarter-wave cosine transform (easy-to-use)

D01:  Quadrature

Chapter Introduction
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(omega x) or sin(omega 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(omega x) or sin(omega 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
D01BBF    Pre-computed weights and abscissae for Gaussian quadrature rules, restricted choice of rule
D01BCF    Calculation of weights and abscissae for Gaussian quadrature rules, general choice of rule
D01BDF    One-dimensional quadrature, non-adaptive, finite interval
D01DAF    Two-dimensional quadrature, finite region
D01EAF    Multi-dimensional adaptive quadrature over hyper-rectangle, multiple integrands
D01FBF    Multi-dimensional Gaussian quadrature over hyper-rectangle
D01FCF    Multi-dimensional adaptive quadrature over hyper-rectangle
D01FDF    Multi-dimensional quadrature, Sag–Szekeres method, general product region or n-sphere
D01GAF    One-dimensional quadrature, integration of function defined by data values, Gill–Miller method
D01GBF    Multi-dimensional quadrature over hyper-rectangle, Monte Carlo method
D01GCF    Multi-dimensional quadrature, general product region, number-theoretic method
D01GDF    Multi-dimensional quadrature, general product region, number-theoretic method, variant of D01GCF efficient on vector machines
D01GYF    Korobov optimal coefficients for use in D01GCF or D01GDF, when number of points is prime
D01GZF    Korobov optimal coefficients for use in D01GCF or D01GDF, when number of points is product of two primes
D01JAF    Multi-dimensional quadrature over an n-sphere, allowing for badly-behaved integrands
D01PAF    Multi-dimensional quadrature over an n-simplex

D02:  Ordinary Differential Equations

Chapter Introduction
D02AGF    ODEs, boundary value problem, shooting and matching technique, allowing interior matching point, general parameters to be determined
D02BGF    ODEs, IVP, Runge–Kutta–Merson method, until a component attains given value (simple driver)
D02BHF    ODEs, IVP, Runge–Kutta–Merson method, until function of solution is zero (simple driver)
D02BJF    ODEs, IVP, Runge–Kutta method, until function of solution is zero, integration over range with intermediate output (simple driver)
D02CJF    ODEs, IVP, Adams method, until function of solution is zero, intermediate output (simple driver)
D02EJF    ODEs, stiff IVP, BDF method, until function of solution is zero, intermediate output (simple driver)
D02GAF    ODEs, boundary value problem, finite difference technique with deferred correction, simple nonlinear problem
D02GBF    ODEs, boundary value problem, finite difference technique with deferred correction, general linear problem
D02HAF    ODEs, boundary value problem, shooting and matching, boundary values to be determined
D02HBF    ODEs, boundary value problem, shooting and matching, general parameters to be determined
D02JAF    ODEs, boundary value problem, collocation and least-squares, single nth-order linear equation
D02JBF    ODEs, boundary value problem, collocation and least-squares, system of first-order linear equations
D02KAF    Second-order Sturm–Liouville problem, regular system, finite range, eigenvalue only
D02KDF