Mark 20 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
D01: Quadrature
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 | Second-order Sturm–Liouville problem, regular/singular system, finite/infinite range, eigenvalue only, user-specified break-points |
| D02KEF | Second-order Sturm–Liouville problem, regular/singular system, finite/infinite range, eigenvalue and eigenfunction, user-specified break-points |
| D02LAF | Second-order ODEs, IVP, Runge–Kutta–Nystrom method |
| D02LXF | Second-order ODEs, IVP, setup for D02LAF |
| D02LYF | Second-order ODEs, IVP, diagnostics for D02LAF |
| D02LZF | Second-order ODEs, IVP, interpolation for D02LAF |
| D02M/N Introduction | |
| D02MVF | ODEs, IVP, DASSL method, setup for D02M–N routines |
| D02MZF | ODEs, IVP, interpolation for D02M–N routines, natural interpolant |
| D02NBF | Explicit ODEs, stiff IVP, full Jacobian (comprehensive) |
| D02NCF | Explicit ODEs, stiff IVP, banded Jacobian (comprehensive) |
| D02NDF | Explicit ODEs, stiff IVP, sparse Jacobian (comprehensive) |
| D02NGF | Implicit/algebraic ODEs, stiff IVP, full Jacobian (comprehensive) |
| D02NHF | Implicit/algebraic ODEs, stiff IVP, banded Jacobian (comprehensive) |
| D02NJF | Implicit/algebraic ODEs, stiff IVP, sparse Jacobian (comprehensive) |
| D02NMF | Explicit ODEs, stiff IVP (reverse communication, comprehensive) |
| D02NNF | Implicit/algebraic ODEs, stiff IVP (reverse communication, comprehensive) |
| D02NRF | ODEs, IVP, for use with D02M–N routines, sparse Jacobian, enquiry routine |
| D02NSF | ODEs, IVP, for use with D02M–N routines, full Jacobian, linear algebra set up |
| D02NTF | ODEs, IVP, for use with D02M–N routines, banded Jacobian, linear algebra set up |
| D02NUF | ODEs, IVP, for use with D02M–N routines, sparse Jacobian, linear algebra set up |
| D02NVF | ODEs, IVP, BDF method, setup for D02M–N routines |
| D02NWF | ODEs, IVP, Blend method, setup for D02M–N routines |
| D02NXF | ODEs, IVP, sparse Jacobian, linear algebra diagnostics, for use with D02M–N routines |
| D02NYF | ODEs, IVP, integrator diagnostics, for use with D02M–N routines |
| D02NZF | ODEs, IVP, setup for continuation calls to integrator, for use with D02M–N routines |
| D02PCF | ODEs, IVP, Runge–Kutta method, integration over range with output |
| D02PDF | ODEs, IVP, Runge–Kutta method, integration over one step |
| D02PVF | ODEs, IVP, setup for D02PCF and D02PDF |
| D02PWF | ODEs, IVP, resets end of range for D02PDF |
| D02PXF | ODEs, IVP, interpolation for D02PDF |
| D02PYF | ODEs, IVP, integration diagnostics for D02PCF and D02PDF |
| D02PZF | ODEs, IVP, error assessment diagnostics for D02PCF and D02PDF |
| D02QFF | ODEs, IVP, Adams method with root-finding (forward communication, comprehensive) |
| D02QGF | ODEs, IVP, Adams method with root-finding (reverse communication, comprehensive) |
| D02QWF | ODEs, IVP, setup for D02QFF and D02QGF |
| D02QXF | ODEs, IVP, diagnostics for D02QFF and D02QGF |
| D02QYF | ODEs, IVP, root-finding diagnostics for D02QFF and D02QGF |
| D02QZF | ODEs, IVP, interpolation for D02QFF or D02QGF |
| D02RAF | ODEs, general nonlinear boundary value problem, finite difference technique with deferred correction, continuation facility |
| D02SAF | ODEs, boundary value problem, shooting and matching technique, subject to extra algebraic equations, general parameters to be determined |
| D02TGF | nth-order linear ODEs, boundary value problem, collocation and least-squares |
| D02TKF | ODEs, general nonlinear boundary value problem, collocation technique |
| D02TVF | ODEs, general nonlinear boundary value problem, setup for D02TKF |
| D02TXF | ODEs, general nonlinear boundary value problem, continuation facility for D02TKF |
| D02TYF | ODEs, general nonlinear boundary value problem, interpolation for D02TKF |
| D02TZF | ODEs, general nonlinear boundary value problem, diagnostics for D02TKF |
| D02XJF | ODEs, IVP, interpolation for D02M–N routines, natural interpolant |
| D02XKF | ODEs, IVP, interpolation for D02M–N routines, C1 interpolant |
| D02ZAF | ODEs, IVP, weighted norm of local error estimate for D02M–N routines |
D03: Partial Differential Equations
D04: Numerical Differentiation
| Chapter Introduction | |
| D04AAF | Numerical differentiation, derivatives up to order 14, function of one real variable |
D05: Integral Equations
| Chapter Introduction | |
| D05AAF | Linear non-singular Fredholm integral equation, second kind, split kernel |
| D05ABF | Linear non-singular Fredholm integral equation, second kind, smooth kernel |
| D05BAF | Nonlinear Volterra convolution equation, second kind |
| D05BDF | Nonlinear convolution Volterra–Abel equation, second kind, weakly singular |
| D05BEF | Nonlinear convolution Volterra–Abel equation, first kind, weakly singular |
| D05BWF | Generate weights for use in solving Volterra equations |
| D05BYF | Generate weights for use in solving weakly singular Abel-type equations |
D06: Mesh Generation
| Chapter Introduction | |
| D06AAF | Generates a two-dimensional mesh using a simple incremental method |
| D06ABF | Generates a two-dimensional mesh using a Delaunay–Voronoi process |
| D06ACF | Generates a two-dimensional mesh using an Advancing-front method |
| D06BAF | Generates a boundary mesh |
| D06CAF | Uses a barycentering technique to smooth a given mesh |
| D06CBF | Generates a sparsity pattern of a Finite Element matrix associated with a given mesh |
| D06CCF | Renumbers a given mesh using Gibbs method |
| D06DAF | Generates a mesh resulting from an affine transformation of a given mesh |
| D06DBF | Joins together two given adjacent (possibly overlapping) meshes |
E01: Interpolation
| Chapter Introduction | |
| E01AAF | Interpolated values, Aitken's technique, unequally spaced data, one variable |
| E01ABF | Interpolated values, Everett's formula, equally spaced data, one variable |
| E01AEF | Interpolating functions, polynomial interpolant, data may include derivative values, one variable |
| E01BAF | Interpolating functions, cubic spline interpolant, one variable |
| E01BEF | Interpolating functions, monotonicity-preserving, piecewise cubic Hermite, one variable |
| E01BFF | Interpolated values, interpolant computed by E01BEF, function only, one variable |
| E01BGF | Interpolated values, interpolant computed by E01BEF, function and first derivative, one variable |
| E01BHF | Interpolated values, interpolant computed by E01BEF, definite integral, one variable |
| E01DAF | Interpolating functions, fitting bicubic spline, data on rectangular grid |
| E01RAF | Interpolating functions, rational interpolant, one variable |
| E01RBF | Interpolated values, evaluate rational interpolant computed by E01RAF, one variable |
| E01SAF | Interpolating functions, method of Renka and Cline, two variables |
| E01SBF | Interpolated values, evaluate interpolant computed by E01SAF, two variables |
| E01SGF | Interpolating functions, modified Shepard's method, two variables |
| E01SHF | Interpolated values, evaluate interpolant computed by E01SGF, function and first derivatives, two variables |
| E01TGF | Interpolating functions, modified Shepard's method, three variables |
| E01THF | Interpolated values, evaluate interpolant computed by E01TGF, function and first derivatives, three variables |
E02: Curve and Surface Fitting
E04: Minimizing or Maximizing a Function
| Chapter Introduction | |
| E04ABF | Minimum, function of one variable using function values only |
| E04BBF | Minimum, function of one variable, using first derivative |
| E04CCF | Unconstrained minimum, simplex algorithm, function of several variables using function values only (comprehensive) |
| E04DGF | Unconstrained minimum, preconditioned conjugate gradient algorithm, function of several variables using first derivatives (comprehensive) |
| E04DJF | Read optional parameter values for E04DGF from external file |
| E04DKF | Supply optional parameter values to E04DGF |
| E04FCF | Unconstrained minimum of a sum of squares, combined Gauss–Newton and modified Newton algorithm using function values only (comprehensive) |
| E04FYF | Unconstrained minimum of a sum of squares, combined Gauss–Newton and modified Newton algorithm using function values only (easy-to-use) |
| E04GBF | Unconstrained minimum of a sum of squares, combined Gauss–Newton and quasi-Newton algorithm using first derivatives (comprehensive) |
| E04GDF | Unconstrained minimum of a sum of squares, combined Gauss–Newton and modified Newton algorithm using first derivatives (comprehensive) |
| E04GYF | Unconstrained minimum of a sum of squares, combined Gauss–Newton and quasi-Newton algorithm, using first derivatives (easy-to-use) |
| E04GZF | Unconstrained minimum of a sum of squares, combined Gauss–Newton and modified Newton algorithm using first derivatives (easy-to-use) |
| E04HCF | Check user's routine for calculating first derivatives of function |
| E04HDF | Check user's routine for calculating second derivatives of function |
| E04HEF | Unconstrained minimum of a sum of squares, combined Gauss–Newton and modified Newton algorithm, using second derivatives (comprehensive) |
| E04HYF | Unconstrained minimum of a sum of squares, combined Gauss–Newton and modified Newton algorithm, using second derivatives (easy-to-use) |
| E04JYF | Minimum, function of several variables, quasi-Newton algorithm, simple bounds, using function values only (easy-to-use) |
| E04KDF | Minimum, function of several variables, modified Newton algorithm, simple bounds, using first derivatives (comprehensive) |
| E04KYF | Minimum, function of several variables, quasi-Newton algorithm, simple bounds, using first derivatives (easy-to-use) |
| E04KZF | Minimum, function of several variables, modified Newton algorithm, simple bounds, using first derivatives (easy-to-use) |
| E04LBF | Minimum, function of several variables, modified Newton algorithm, simple bounds, using first and second derivatives (comprehensive) |
| E04LYF | Minimum, function of several variables, modified Newton algorithm, simple bounds, using first and second derivatives (easy-to-use) |
| E04MFF | LP problem (dense) |
| E04MGF | Read optional parameter values for E04MFF from external file |
| E04MHF | Supply optional parameter values to E04MFF |
| E04MZF | Converts MPSX data file defining LP or QP problem to format required by E04NKF |
| E04NCF | Convex QP problem or linearly-constrained linear least-squares problem (dense) |
| E04NDF | Read optional parameter values for E04NCF from external file |
| E04NEF | Supply optional parameter values to E04NCF |
| E04NFF | QP problem (dense) |
| E04NGF | Read optional parameter values for E04NFF from external file |
| E04NHF | Supply optional parameter values to E04NFF |
| E04NKF | LP or QP problem (sparse) |
| E04NLF | Read optional parameter values for E04NKF from external file |
| E04NMF | Supply optional parameter values to E04NKF |
| E04UCF | Minimum, function of several variables, sequential QP method, nonlinear constraints, using function values and optionally first derivatives (forward communication, comprehensive) |
| E04UDF | Read optional parameter values for E04UCF or E04UFF from external file |
| E04UEF | Supply optional parameter values to E04UCF or E04UFF |
| E04UFF | Minimum, function of several variables, sequential QP method, nonlinear constraints, using function values and optionally first derivatives (reverse communication, comprehensive) |
| E04UGF | NLP problem (sparse) |
| E04UHF | Read optional parameter values for E04UGF from external file |
| E04UJF | Supply optional parameter values to E04UGF |
| E04UNF * | Minimum of a sum of squares, nonlinear constraints, sequential QP method, using function values and optionally first derivatives (comprehensive) |
| E04UQF | Read optional parameter values for E04UNF from external file |
| E04URF | Supply optional parameter values to E04UNF |
| E04USF | Minimum of a sum of squares, nonlinear constraints, sequential QP method, using function values and optionally first derivatives (comprehensive) |
| E04WBF | Initialization routine for E04DGA, E04MFA, E04NCA, E04NFA, E04NKA, E04UCA, E04UFA, E04UGA and E04USA |
| E04XAF | Estimate (using numerical differentiation) gradient and/or Hessian of a function |
| E04YAF | Check user's routine for calculating Jacobian of first derivatives |
| E04YBF | Check user's routine for calculating Hessian of a sum of squares |
| E04YCF | Covariance matrix for nonlinear least-squares problem (unconstrained) |
| E04ZCF | Check user's routines for calculating first derivatives of function and constraints |
F: Linear Algebra
| Chapter Introduction |
F01: Matrix Factorizations
| Chapter Introduction | |
| F01ABF | Inverse of real symmetric positive-definite matrix using iterative refinement |
| F01ADF | Inverse of real symmetric positive-definite matrix |
| F01BLF | Pseudo-inverse and rank of real m by n matrix (m ≥ n) |
| F01BRF | LU factorization of real sparse matrix |
| F01BSF | LU factorization of real sparse matrix with known sparsity pattern |
| F01BUF | ULD LT UT factorization of real symmetric positive-definite band matrix |
| F01BVF | Reduction to standard form, generalized real symmetric-definite banded eigenproblem |
| F01CKF | Matrix multiplication |
| F01CRF | Matrix transposition |
| F01CTF | Sum or difference of two real matrices, optional scaling and transposition |
| F01CWF | Sum or difference of two complex matrices, optional scaling and transposition |
| F01LEF | LU factorization of real tridiagonal matrix |
| F01LHF | LU factorization of real almost block diagonal matrix |
| F01MCF | LDLT factorization of real symmetric positive-definite variable-bandwidth matrix |
| F01QGF | RQ factorization of real m by n upper trapezoidal matrix (m ≤ n) |
| F01QJF | RQ factorization of real m by n matrix (m ≤ n) |
| F01QKF | Operations with orthogonal matrices, form rows of Q, after RQ factorization by F01QJF |
| F01RGF | RQ factorization of complex m by n upper trapezoidal matrix (m ≤ n) |
| F01RJF | RQ factorization of complex m by n matrix (m ≤ n) |
| F01RKF | Operations with unitary matrices, form rows of Q, after RQ factorization by F01RJF |
| F01ZAF | Convert real matrix between packed triangular and square storage schemes |
| F01ZBF | Convert complex matrix between packed triangular and square storage schemes |
| F01ZCF | Convert real matrix between packed banded and rectangular storage schemes |
| F01ZDF | Convert complex matrix between packed banded and rectangular storage schemes |
F02: Eigenvalues and Eigenvectors
F03: Determinants
| Chapter Introduction | |
| F03AAF | Determinant of real matrix (Black Box) |
| F03ABF | Determinant of real symmetric positive-definite matrix (Black Box) |
| F03ACF | Determinant of real symmetric positive-definite band matrix (Black Box) |
| F03ADF | Determinant of complex matrix (Black Box) |
| F03AEF | LLT factorization and determinant of real symmetric positive-definite matrix |
| F03AFF | LU factorization and determinant of real matrix |
F04: Simultaneous Linear Equations
| Chapter Introduction | |
| F04AAF | Solution of real simultaneous linear equations with multiple right-hand sides (Black Box) |
| F04ABF | Solution of real symmetric positive-definite simultaneous linear equations with multiple right-hand sides using iterative refinement (Black Box) |
| F04ACF | Solution of real symmetric positive-definite banded simultaneous linear equations with multiple right-hand sides (Black Box) |
| F04ADF | Solution of complex simultaneous linear equations with multiple right-hand sides (Black Box) |
| F04AEF | Solution of real simultaneous linear equations with multiple right-hand sides using iterative refinement (Black Box) |
| F04AFF | Solution of real symmetric positive-definite simultaneous linear equations using iterative refinement (coefficient matrix already factorized by F03AEF) |
| F04AGF | Solution of real symmetric positive-definite simultaneous linear equations (coefficient matrix already factorized by F03AEF) |
| F04AHF | Solution of real simultaneous linear equations using iterative refinement (coefficient matrix already factorized by F03AFF) |
| F04AJF | Solution of real simultaneous linear equations (coefficient matrix already factorized by F03AFF) |
| F04AMF | Least-squares solution of m real equations in n unknowns, rank = n, m ≥ n using iterative refinement (Black Box) |
| F04ARF | Solution of real simultaneous linear equations, one right-hand side (Black Box) |
| F04ASF | Solution of real symmetric positive-definite simultaneous linear equations, one right-hand side using iterative refinement (Black Box) |
| F04ATF | Solution of real simultaneous linear equations, one right-hand side using iterative refinement (Black Box) |
| F04AXF | Solution of real sparse simultaneous linear equations (coefficient matrix already factorized) |
| F04EAF | Solution of real tridiagonal simultaneous linear equations, one right-hand side (Black Box) |
| F04FAF | Solution of real symmetric positive-definite tridiagonal simultaneous linear equations, one right-hand side (Black Box) |
| F04FEF | Solution of the Yule–Walker equations for real symmetric positive-definite Toeplitz matrix, one right-hand side |
| F04FFF | Solution of real symmetric positive-definite Toeplitz system, one right-hand side |
| F04JAF | Minimal least-squares solution of m real equations in n unknowns, rank ≤ n, m ≥ n |
| F04JDF | Minimal least-squares solution of m real equations in n unknowns, rank ≤ n, m ≥ n |
| F04JGF | Least-squares (if rank = n) or minimal least-squares (if rank < n) solution of m real equations in n unknowns, rank ≤ n, m ≥ n |
| F04JLF | Real general Gauss–Markov linear model (including weighted least-squares) |
| F04JMF | Equality-constrained real linear least-squares problem |
| F04KLF | Complex general Gauss–Markov linear model (including weighted least-squares) |
| F04KMF | Equality-constrained complex linear least-squares problem |
| F04LEF | Solution of real tridiagonal simultaneous linear equations (coefficient matrix already factorized by F01LEF) |
| F04LHF | Solution of real almost block diagonal simultaneous linear equations (coefficient matrix already factorized by F01LHF) |
| F04MCF | Solution of real symmetric positive-definite variable-bandwidth simultaneous linear equations (coefficient matrix already factorized by F01MCF) |
| F04MEF | Update solution of the Yule–Walker equations for real symmetric positive-definite Toeplitz matrix |
| F04MFF | Update solution of real symmetric positive-definite Toeplitz system |
| F04QAF | Sparse linear least-squares problem, m real equations in n unknowns |
| F04YAF | Covariance matrix for linear least-squares problems, m real equations in n unknowns |
| F04YCF | Norm estimation (for use in condition estimation), real matrix |
| F04ZCF | Norm estimation (for use in condition estimation), complex matrix |
F05: Orthogonalisation
| Chapter Introduction | |
| F05AAF | Gram–Schmidt orthogonalisation of n vectors of order m |
F06: Linear Algebra Support Routines
F07: Linear Equations (LAPACK)
A list of the LAPACK equivalent names is included in the Chapter F07 Introduction.
| Chapter Introduction | |
| F07ADF | LU factorization of real m by n matrix |
| F07AEF | Solution of real system of linear equations, multiple right-hand sides, matrix already factorized by F07ADF |
| F07AGF | Estimate condition number of real matrix, matrix already factorized by F07ADF |
| F07AHF | Refined solution with error bounds of real system of linear equations, multiple right-hand sides |
| F07AJF | Inverse of real matrix, matrix already factorized by F07ADF |
| F07ARF | LU factorization of complex m by n matrix |
| F07ASF | Solution of complex system of linear equations, multiple right-hand sides, matrix already factorized by F07ARF |
| F07AUF | Estimate condition number of complex matrix, matrix already factorized by F07ARF |
| F07AVF | Refined solution with error bounds of complex system of linear equations, multiple right-hand sides |
| F07AWF | Inverse of complex matrix, matrix already factorized by F07ARF |
| F07BDF | LU factorization of real m by n band matrix |
| F07BEF | Solution of real band system of linear equations, multiple right-hand sides, matrix already factorized by F07BDF |
| F07BGF | Estimate condition number of real band matrix, matrix already factorized by F07BDF |
| F07BHF | Refined solution with error bounds of real band system of linear equations, multiple right-hand sides |
| F07BRF | LU factorization of complex m by n band matrix |
| F07BSF | Solution of complex band system of linear equations, multiple right-hand sides, matrix already factorized by F07BRF |
| F07BUF | Estimate condition number of complex band matrix, matrix already factorized by F07BRF |
| F07BVF | Refined solution with error bounds of complex band system of linear equations, multiple right-hand sides |
| F07FDF | Cholesky factorization of real symmetric positive-definite matrix |
| F07FEF | Solution of real symmetric positive-definite system of linear equations, multiple right-hand sides, matrix already factorized by F07FDF |
| F07FGF | Estimate condition number of real symmetric positive-definite matrix, matrix already factorized by F07FDF |
| F07FHF | Refined solution with error bounds of real symmetric positive-definite system of linear equations, multiple right-hand sides |
| F07FJF | Inverse of real symmetric positive-definite matrix, matrix already factorized by F07FDF |
| F07FRF | Cholesky factorization of complex Hermitian positive-definite matrix |
| F07FSF | Solution of complex Hermitian positive-definite system of linear equations, multiple right-hand sides, matrix already factorized by F07FRF |
| F07FUF | Estimate condition number of complex Hermitian positive-definite matrix, matrix already factorized by F07FRF |
| F07FVF | Refined solution with error bounds of complex Hermitian positive-definite system of linear equations, multiple right-hand sides |
| F07FWF | Inverse of complex Hermitian positive-definite matrix, matrix already factorized by F07FRF |
| F07GDF | Cholesky factorization of real symmetric positive-definite matrix, packed storage |
| F07GEF | Solution of real symmetric positive-definite system of linear equations, multiple right-hand sides, matrix already factorized by F07GDF, packed storage |
| F07GGF | Estimate condition number of real symmetric positive-definite matrix, matrix already factorized by F07GDF, packed storage |
| F07GHF | Refined solution with error bounds of real symmetric positive-definite system of linear equations, multiple right-hand sides, packed storage |
| F07GJF | Inverse of real symmetric positive-definite matrix, matrix already factorized by F07GDF, packed storage |
| F07GRF | Cholesky factorization of complex Hermitian positive-definite matrix, packed storage |
| F07GSF | Solution of complex Hermitian positive-definite system of linear equations, multiple right-hand sides, matrix already factorized by F07GRF, packed storage |
| F07GUF | Estimate condition number of complex Hermitian positive-definite matrix, matrix already factorized by F07GRF, packed storage |
| F07GVF | Refined solution with error bounds of complex Hermitian positive-definite system of linear equations, multiple right-hand sides, packed storage |
| F07GWF | Inverse of complex Hermitian positive-definite matrix, matrix already factorized by F07GRF, packed storage |
| F07HDF | Cholesky factorization of real symmetric positive-definite band matrix |
| F07HEF | Solution of real symmetric positive-definite band system of linear equations, multiple right-hand sides, matrix already factorized by F07HDF |
| F07HGF | Estimate condition number of real symmetric positive-definite band matrix, matrix already factorized by F07HDF |
| F07HHF | Refined solution with error bounds of real symmetric positive-definite band system of linear equations, multiple right-hand sides |
| F07HRF | Cholesky factorization of complex Hermitian positive-definite band matrix |
| F07HSF | Solution of complex Hermitian positive-definite band system of linear equations, multiple right-hand sides, matrix already factorized by F07HRF |
| F07HUF | Estimate condition number of complex Hermitian positive-definite band matrix, matrix already factorized by F07HRF |
| F07HVF | Refined solution with error bounds of complex Hermitian positive-definite band system of linear equations, multiple right-hand sides |
| F07MDF | Bunch–Kaufman factorization of real symmetric indefinite matrix |
| F07MEF | Solution of real symmetric indefinite system of linear equations, multiple right-hand sides, matrix already factorized by F07MDF |
| F07MGF | Estimate condition number of real symmetric indefinite matrix, matrix already factorized by F07MDF |
| F07MHF | Refined solution with error bounds of real symmetric indefinite system of linear equations, multiple right-hand sides |
| F07MJF | Inverse of real symmetric indefinite matrix, matrix already factorized by F07MDF |
| F07MRF | Bunch–Kaufman factorization of complex Hermitian indefinite matrix |
| F07MSF | Solution of complex Hermitian indefinite system of linear equations, multiple right-hand sides, matrix already factorized by F07MRF |
| F07MUF | Estimate condition number of complex Hermitian indefinite matrix, matrix already factorized by F07MRF |
| F07MVF | Refined solution with error bounds of complex Hermitian indefinite system of linear equations, multiple right-hand sides |
| F07MWF | Inverse of complex Hermitian indefinite matrix, matrix already factorized by F07MRF |
| F07NRF | Bunch–Kaufman factorization of complex symmetric matrix |
| F07NSF | Solution of complex symmetric system of linear equations, multiple right-hand sides, matrix already factorized by F07NRF |
| F07NUF | Estimate condition number of complex symmetric matrix, matrix already factorized by F07NRF |
| F07NVF | Refined solution with error bounds of complex symmetric system of linear equations, multiple right-hand sides |
| F07NWF | Inverse of complex symmetric matrix, matrix already factorized by F07NRF |
| F07PDF | Bunch–Kaufman factorization of real symmetric indefinite matrix, packed storage |
| F07PEF | Solution of real symmetric indefinite system of linear equations, multiple right-hand sides, matrix already factorized by F07PDF, packed storage |
| F07PGF | Estimate condition number of real symmetric indefinite matrix, matrix already factorized by F07PDF, packed storage |
| F07PHF | Refined solution with error bounds of real symmetric indefinite system of linear equations, multiple right-hand sides, packed storage |
| F07PJF | Inverse of real symmetric indefinite matrix, matrix already factorized by F07PDF, packed storage |
| F07PRF | Bunch–Kaufman factorization of complex Hermitian indefinite matrix, packed storage |
| F07PSF | Solution of complex Hermitian indefinite system of linear equations, multiple right-hand sides, matrix already factorized by F07PRF, packed storage |
| F07PUF | Estimate condition number of complex Hermitian indefinite matrix, matrix already factorized by F07PRF, packed storage |
| F07PVF | Refined solution with error bounds of complex Hermitian indefinite system of linear equations, multiple right-hand sides, packed storage |
| F07PWF | Inverse of complex Hermitian indefinite matrix, matrix already factorized by F07PRF, packed storage |
| F07QRF | Bunch–Kaufman factorization of complex symmetric matrix, packed storage |
| F07QSF | Solution of complex symmetric system of linear equations, multiple right-hand sides, matrix already factorized by F07QRF, packed storage |
| F07QUF | Estimate condition number of complex symmetric matrix, matrix already factorized by F07QRF, packed storage |
| F07QVF | Refined solution with error bounds of complex symmetric system of linear equations, multiple right-hand sides, packed storage |
| F07QWF | Inverse of complex symmetric matrix, matrix already factorized by F07QRF, packed storage |
| F07TEF | Solution of real triangular system of linear equations, multiple right-hand sides |
| F07TGF | Estimate condition number of real triangular matrix |
| F07THF | Error bounds for solution of real triangular system of linear equations, multiple right-hand sides |
| F07TJF | Inverse of real triangular matrix |
| F07TSF | Solution of complex triangular system of linear equations, multiple right-hand sides |
| F07TUF | Estimate condition number of complex triangular matrix |
| F07TVF | Error bounds for solution of complex triangular system of linear equations, multiple right-hand sides |
| F07TWF | Inverse of complex triangular matrix |
| F07UEF | Solution of real triangular system of linear equations, multiple right-hand sides, packed storage |
| F07UGF | Estimate condition number of real triangular matrix, packed storage |
| F07UHF | Error bounds for solution of real triangular system of linear equations, multiple right-hand sides, packed storage |
| F07UJF | Inverse of real triangular matrix, packed storage |
| F07USF | Solution of complex triangular system of linear equations, multiple right-hand sides, packed storage |
| F07UUF | Estimate condition number of complex triangular matrix, packed storage |
| F07UVF | Error bounds for solution of complex triangular system of linear equations, multiple right-hand sides, packed storage |
| F07UWF | Inverse of complex triangular matrix, packed storage |
| F07VEF | Solution of real band triangular system of linear equations, multiple right-hand sides |
| F07VGF | Estimate condition number of real band triangular matrix |
| F07VHF | Error bounds for solution of real band triangular system of linear equations, multiple right-hand sides |
| F07VSF | Solution of complex band triangular system of linear equations, multiple right-hand sides |
| F07VUF | Estimate condition number of complex band triangular matrix |
| F07VVF | Error bounds for solution of complex band triangular system of linear equations, multiple right-hand sides |
F08: Least-squares and Eigenvalue Problems (LAPACK)
A list of the LAPACK equivalent names is included in the Chapter F08 Introduction.
F11: Sparse Linear Algebra
G01: Simple Calculations on Statistical Data
G02: Correlation and Regression Analysis
G03: Multivariate Methods
G04: Analysis of Variance
| Chapter Introduction | |
| G04AGF | Two-way analysis of variance, hierarchical classification, subgroups of unequal size |
| G04BBF | Analysis of variance, randomized block or completely randomized design, treatment means and standard errors |
| G04BCF | Analysis of variance, general row and column design, treatment means and standard errors |
| G04CAF | Analysis of variance, complete factorial design, treatment means and standard errors |
| G04DAF | Computes sum of squares for contrast between means |
| G04DBF | Computes confidence intervals for differences between means computed by G04BBF or G04BCF |
| G04EAF | Computes orthogonal polynomials or dummy variables for factor/classification variable |
G05: Random Number Generators
| Chapter Introduction | |
| G05CAF * | Pseudo-random real numbers, uniform distribution over (0,1) |
| G05CBF * | Initialise random number generating routines to give repeatable sequence |
| G05CCF * | Initialise random number generating routines to give non-repeatable sequence |
| G05CFF * | Save state of random number generating routines |
| G05CGF * | Restore state of random number generating routines |
| G05DAF * | Pseudo-random real numbers, uniform distribution over (a,b) |
| G05DBF * | Pseudo-random real numbers, (negative) exponential distribution |
| G05DCF * | Pseudo-random real numbers, logistic distribution |
| G05DDF * | Pseudo-random real numbers, Normal distribution |
| G05DEF * | Pseudo-random real numbers, log-normal distribution |
| G05DFF * | Pseudo-random real numbers, Cauchy distribution |
| G05DHF * | Pseudo-random real numbers, χ2 distribution |
| G05DJF * | Pseudo-random real numbers, Student's t-distribution |
| G05DKF * | Pseudo-random real numbers, F-distribution |
| G05DPF * | Pseudo-random real numbers, Weibull distribution |
| G05DRF * | Pseudo-random integer, Poisson distribution |
| G05DYF * | Pseudo-random integer from uniform distribution |
| G05DZF * | Pseudo-random logical (boolean) value |
| G05EAF * | Set up reference vector for multivariate Normal distribution |
| G05EBF * | Set up reference vector for generating pseudo-random integers, uniform distribution |
| G05ECF * | Set up reference vector for generating pseudo-random integers, Poisson distribution |
| G05EDF * | Set up reference vector for generating pseudo-random integers, binomial distribution |
| G05EEF * | Set up reference vector for generating pseudo-random integers, negative binomial distribution |
| G05EFF * | Set up reference vector for generating pseudo-random integers, hypergeometric distribution |
| G05EGF * | Set up reference vector for univariate ARMA time series model |
| G05EHF * | Pseudo-random permutation of an integer vector |
| G05EJF * | Pseudo-random sample from an integer vector |
| G05EWF * | Generate next term from reference vector for ARMA time series model |
| G05EXF * | Set up reference vector from supplied cumulative distribution function or probability distribution function |
| G05EYF * | Pseudo-random integer from reference vector |
| G05EZF * | Pseudo-random multivariate Normal vector from reference vector |
| G05FAF * | Generates a vector of random numbers from a uniform distribution |
| G05FBF * | Generates a vector of random numbers from an (negative) exponential distribution |
| G05FDF * | Generates a vector of random numbers from a Normal distribution |
| G05FEF * | Generates a vector of pseudo-random numbers from a beta distribution |
| G05FFF * | Generates a vector of pseudo-random numbers from a gamma distribution |
| G05FSF * | Generates a vector of pseudo-random variates from von Mises distribution |
| G05GAF * | Computes a random orthogonal matrix |
| G05GBF * | Computes a random correlation matrix |
| G05HDF * | Generates a realisation of a multivariate time series from a VARMA model |
| G05HKF | Univariate time series, generate n terms of either a symmetric GARCH process or a GARCH process with asymmetry of the form (εt-1 + γ)2 |
| G05HLF | Univariate time series, generate n terms of a GARCH process with asymmetry of the form (|εt-1| + γ εt-1)2 |
| G05HMF | Univariate time series, generate n terms of an asymmetric Glosten, Jagannathan and Runkle (GJR) GARCH process |
| G05HNF | Univariate time series, generate n terms of an exponential GARCH (EGARCH) process |
| G05KAF | Pseudo-random real numbers, uniform distribution over (0,1), seeds and generator number passed explicitly |
| G05KBF | Initialise seeds of a given generator for random number generating routines (that pass seeds expicitly) to give a repeatable sequence |
| G05KCF | Initialise seeds of a given generator for random number generating routines (that pass seeds expicitly) to give non-repeatable sequence |
| G05KEF | Pseudo-random logical (boolean) value, seeds and generator number passed explicitly |
| G05LAF | Generates a vector of random numbers from a Normal distribution, seeds and generator number passed explicitly |
| G05LBF | Generates a vector of random numbers from a Student's t-distribution, seeds and generator number passed explicitly |
| G05LCF | Generates a vector of random numbers from a χ2 distribution, seeds and generator number passed explicitly |
| G05LDF | Generates a vector of random numbers from an F-distribution, seeds and generator number passed explicitly |
| G05LEF | Generates a vector of random numbers from a beta distribution, seeds and generator number passed explicitly |
| G05LFF | Generates a vector of random numbers from a γ distribution, seeds and generator number passed explicitly |
| G05LGF | Generates a vector of random numbers from a uniform distribution, seeds and generator number passed explicitly |
| G05LHF | Generates a vector of random numbers from a triangular distribution, seeds and generator number passed explicitly |
| G05LJF | Generates a vector of random numbers from an exponential distribution, seeds and generator number passed explicitly |
| G05LKF | Generates a vector of random numbers from a lognormal distribution, seeds and generator number passed explicitly |
| G05LLF | Generates a vector of random numbers from a Cauchy distribution, seeds and generator number passed explicitly |
| G05LMF | Generates a vector of random numbers from a Weibull distribution, seeds and generator number passed explicitly |
| G05LNF | Generates a vector of random numbers from a logistic distribution, seeds and generator number passed explicitly |
| G05LPF | Generates a vector of random numbers from a Von Mises distribution, seeds and generator number passed explicitly |
| G05LQF | Generates a vector of random numbers from an exponential mixture distribution, seeds and generator number passed explicitly |
| G05LZF | Generates a vector of random numbers from a multivariate Normal distribution, seeds and generator number passed explicitly |
| G05MAF | Generates a vector of random integers from a uniform distribution, seeds and generator number passed explicitly |
| G05MBF | Generates a vector of random integers from a geometric distribution, seeds and generator number passed explicitly |
| G05MCF | Generates a vector of random integers from a negative binomial distribution, seeds and generator number passed explicitly |
| G05MDF | Generates a vector of random integers from a logarithmic distribution, seeds and generator number passed explicitly |
| G05MEF | Generates a vector of random integers from a Poisson distribution with varying mean, seeds and generator number passed explicitly |
| G05MJF | Generates a vector of random integers from a binomial distribution, seeds and generator number passed explicitly |
| G05MKF | Generates a vector of random integers from a Poisson distribution, seeds and generator number passed explicitly |
| G05MLF | Generates a vector of random integers from a hypergeometric distribution, seeds and generator number passed explicitly |
| G05MRF | Generates a vector of random integers from a multinomial distribution, seeds and generator number passed explicitly |
| G05MZF | Generates a vector of random integers from a general discrete distribution, seeds and generator number passed explicitly |
| G05NAF | Pseudo-random permutation of an integer vector |
| G05NBF | Pseudo-random sample from an integer vector |
| G05PAF | Generates a realisation of a time series from an ARMA model |
| G05PCF | Generates a realisation of a multivariate time series from a VARMA model |
| G05QAF | Computes a random orthogonal matrix |
| G05QBF | Computes a random correlation matrix |
| G05QDF | Generates a random table matrix |
| G05YAF | Multi-dimensional quasi-random number generator with a uniform probability distribution |
| G05YBF | Multi-dimensional quasi-random number generator with a Gaussian or log-normal probability distribution |
| G05ZAF | Selects either the basic generator or the Wichmann–Hill generator for those routines using internal communication |
G07: Univariate Estimation
| Chapter Introduction | |
| G07AAF | Computes confidence interval for the parameter of a binomial distribution |
| G07ABF | Computes confidence interval for the parameter of a Poisson distribution |
| G07BBF | Computes maximum likelihood estimates for parameters of the Normal distribution from grouped and/or censored data |
| G07BEF | Computes maximum likelihood estimates for parameters of the Weibull distribution |
| G07CAF | Computes t-test statistic for a difference in means between two Normal populations, confidence interval |
| G07DAF | Robust estimation, median, median absolute deviation, robust standard deviation |
| G07DBF | Robust estimation, M-estimates for location and scale parameters, standard weight functions |
| G07DCF | Robust estimation, M-estimates for location and scale parameters, user-defined weight functions |
| G07DDF | Computes a trimmed and winsorized mean of a single sample with estimates of their variance |
| G07EAF | Robust confidence intervals, one-sample |
| G07EBF | Robust confidence intervals, two-sample |
G08: Nonparametric Statistics
G10: Smoothing in Statistics
| Chapter Introduction | |
| G10ABF | Fit cubic smoothing spline, smoothing parameter given |
| G10ACF | Fit cubic smoothing spline, smoothing parameter estimated |
| G10BAF | Kernel density estimate using Gaussian kernel |
| G10CAF | Compute smoothed data sequence using running median smoothers |
| G10ZAF | Reorder data to give ordered distinct observations |
G11: Contingency Table Analysis
| Chapter Introduction | |
| G11AAF | χ2 statistics for two-way contingency table |
| G11BAF | Computes multiway table from set of classification factors using selected statistic |
| G11BBF | Computes multiway table from set of classification factors using given percentile/quantile |
| G11BCF | Computes marginal tables for multiway table computed by G11BAF or G11BBF |
| G11CAF | Returns parameter estimates for theconditional analysis of stratified data |
| G11SAF | Contingency table, latent variable model for binary data |
| G11SBF | Frequency count for G11SAF |
G12: Survival Analysis
| Chapter Introduction | |
| G12AAF | Computes Kaplan–Meier (product-limit) estimates of survival probabilities |
| G12BAF | Fits Cox's proportional hazard model |
| G12ZAF | Creates the risk sets associated with the Cox proportional hazards model for fixed covariates |
G13: Time Series Analysis
H: Operations Research
| Chapter Introduction | |
| H02BBF | Integer LP problem (dense) |
| H02BFF | Interpret MPSX data file defining IP or LP problem, optimize and print solution |
| H02BUF | Convert MPSX data file defining IP or LP problem to format required by H02BBF or E04MFF |
| H02BVF | Print IP or LP solutions with user specified names for rows and columns |
| H02BZF | Integer programming solution, supplies further information on solution obtained by H02BBF |
| H02CBF | Integer QP problem (dense) |
| H02CCF | Read optional parameter values for H02CBF from external file |
| H02CDF | Supply optional parameter values to H02CBF |
| H02CEF | Integer LP or QP problem (sparse) |
| H02CFF | Read optional parameter values for H02CEF from external file |
| H02CGF | Supply optional parameter values to H02CEF |
| H03ABF | Transportation problem, modified stepping stone method |
| H03ADF | Shortest path problem, Dijkstra's algorithm |
M01: Sorting
| Chapter Introduction | |
| M01CAF | Sort a vector, real numbers |
| M01CBF | Sort a vector, integer numbers |
| M01CCF | Sort a vector, character data |
| M01DAF | Rank a vector, real numbers |
| M01DBF | Rank a vector, integer numbers |
| M01DCF | Rank a vector, character data |
| M01DEF | Rank rows of a matrix, real numbers |
| M01DFF | Rank rows of a matrix, integer numbers |
| M01DJF | Rank columns of a matrix, real numbers |
| M01DKF | Rank columns of a matrix, integer numbers |
| M01DZF | Rank arbitrary data |
| M01EAF | Rearrange a vector according to given ranks, real numbers |
| M01EBF | Rearrange a vector according to given ranks, integer numbers |
| M01ECF | Rearrange a vector according to given ranks, character data |
| M01EDF | Rearrange a vector according to given ranks, complex numbers |
| M01ZAF | Invert a permutation |
| M01ZBF | Check validity of a permutation |
| M01ZCF | Decompose a permutation into cycles |
P01: Error Trapping
| Chapter Introduction | |
| P01ABF | Return value of error indicator/terminate with error message |
S: Approximations of Special Functions
| Chapter Introduction | |
| S01BAF | ln (1+x) |
| S01EAF | Complex exponential, e^z |
| S07AAF | tan x |
| S09AAF | arcsin x |
| S09ABF | arccos x |
| S10AAF | tanh x |
| S10ABF | sinh x |
| S10ACF | cosh x |
| S11AAF | arctanh x |
| S11ABF | arcsinh x |
| S11ACF | arccosh x |
| S13AAF | Exponential integral E1 (x) |
| S13ACF | Cosine integral Ci(x) |
| S13ADF | Sine integral Si(x) |
| S14AAF | Gamma function |
| S14ABF | Log Gamma function |
| S14ACF | ψ (x) - ln x |
| S14ADF | Scaled derivatives of ψ (x) |
| S14AEF | Polygamma function ψ(n)(x) for real x |
| S14AFF | Polygamma function ψ(n)(z) for complex z |
| S14BAF | Incomplete Gamma functions P(a,x) and Q(a,x) |
| S15ABF | Cumulative Normal distribution function P(x) |
| S15ACF | Complement of cumulative Normal distribution function Q(x) |
| S15ADF | Complement of error function erfc(x) |
| S15AEF | Error function erf(x) |
| S15AFF | Dawson's integral |
| S15DDF | Scaled complex complement of error function, exp(-z2) erfc(-iz) |
| S17ACF | Bessel function Y0 (x) |
| S17ADF | Bessel function Y1 (x) |
| S17AEF | Bessel function J0 (x) |
| S17AFF | Bessel function J1 (x) |
| S17AGF | Airy function Ai(x) |
| S17AHF | Airy function Bi(x) |
| S17AJF | Airy function Ai'(x) |
| S17AKF | Airy function Bi'(x) |
| S17ALF | Zeros of Bessel functions Jα(x), J'α(x), Yα(x) or Y'α(x) |
| S17DCF | Bessel functions Yν+a(z), real a ≥ 0, complex z, ν =0,1, 2,... |
| S17DEF | Bessel functions Jν+a(z), real a ≥ 0, complex z, ν =0,1, 2,... |
| S17DGF | Airy functions Ai(z) and Ai'(z), complex z |
| S17DHF | Airy functions Bi(z) and Bi'(z), complex z |
| S17DLF | Hankel functions Hν+a(j)(z), j=1,2, real a ≥ 0, complex z, ν =0,1,2,... |
| S18ACF | Modified Bessel function K0 (x) |
| S18ADF | Modified Bessel function K1 (x) |
| S18AEF | Modified Bessel function I0 (x) |
| S18AFF | Modified Bessel function I1(x) |
| S18CCF | Modified Bessel function exK0(x) |
| S18CDF | Modified Bessel function exK1(x) |
| S18CEF | Modified Bessel function e-|x|I0(x) |
| S18CFF | Modified Bessel function e-|x|I1(x) |
| S18DCF | Modified Bessel functions Kν+a(z), real a ≥ 0, complex z, ν =0,1,2,... |
| S18DEF | Modified Bessel functions Iν+a(z), real a ≥ 0, complex z, ν =0,1,2,... |
| S19AAF | Kelvin function ber x |
| S19ABF | Kelvin function bei x |
| S19ACF | Kelvin function ker x |
| S19ADF | Kelvin function kei x |
| S20ACF | Fresnel integral S(x) |
| S20ADF | Fresnel integral C(x) |
| S21BAF | Degenerate symmetrised elliptic integral of 1st kind RC(x,y) |
| S21BBF | Symmetrised elliptic integral of 1st kind RF(x,y,z) |
| S21BCF | Symmetrised elliptic integral of 2nd kind RD(x,y,z) |
| S21BDF | Symmetrised elliptic integral of 3rd kind RJ(x,y,z,r) |
| S21CAF | Jacobian elliptic functions sn, cn and dn of real argument |
| S21CBF | Jacobian elliptic functions sn, cn and dn of complex argument |
| S21CCF | Jacobian theta functions θk (x,q) of real argument |
| S21DAF | General elliptic integral of 2nd kind F(z,k',a,b) of complex argument |
| S22AAF | Legendre functions of 1st kind Pnm (x) or Pnmx |
X01: Mathematical Constants
| Chapter Introduction | |
| X01AAF | Provides the mathematical constant π |
| X01ABF | Provides the mathematical constant γ (Euler's Constant) |
X02: Machine Constants
| Chapter Introduction | |
| X02AHF | The largest permissible argument for sin and cos |
| X02AJF | The machine precision |
| X02AKF | The smallest positive model number |
| X02ALF | The largest positive model number |
| X02AMF | The safe range parameter |
| X02ANF | The safe range parameter for complex floating-point arithmetic |
| X02BBF | The largest representable integer |
| X02BEF | The maximum number of decimal digits that can be represented |
| X02BHF | The floating-point model parameter, b |
| X02BJF | The floating-point model parameter, p |
| X02BKF | The floating-point model parameter emin |
| X02BLF | The floating-point model parameter emax |
| X02DAF | Switch for taking precautions to avoid underflow |
| X02DJF | The floating-point model parameter ROUNDS |
X03: Inner Products
| Chapter Introduction | |
| X03AAF | Real inner product added to initial value, basic/additional precision |
| X03ABF | Complex inner product added to initial value, basic/additional precision |
X04: Input/Output Utilities
| Chapter Introduction | |
| X04AAF | Return or set unit number for error messages |
| X04ABF | Return or set unit number for advisory messages |
| X04ACF | Open unit number for reading, writing or appending, and associate unit with named file |
| X04ADF | Close file associated with given unit number |
| X04BAF | Write formatted record to external file |
| X04BBF | Read formatted record from external file |
| X04CAF | Print real general matrix (easy-to-use) |
| X04CBF | Print real general matrix (comprehensive) |
| X04CCF | Print real packed triangular matrix (easy-to-use) |
| X04CDF | Print real packed triangular matrix (comprehensive) |
| X04CEF | Print real packed banded matrix (easy-to-use) |
| X04CFF | Print real packed banded matrix (comprehensive) |
| X04DAF | Print complex general matrix (easy-to-use) |
| X04DBF | Print complex general matrix (comprehensive) |
| X04DCF | Print complex packed triangular matrix (easy-to-use) |
| X04DDF | Print complex packed triangular matrix (comprehensive) |
| X04DEF | Print complex packed banded matrix (easy-to-use) |
| X04DFF | Print complex packed banded matrix (comprehensive) |
| X04EAF | Print integer matrix (easy-to-use) |
| X04EBF | Print integer matrix (comprehensive) |
X05: Date and Time Utilities
| Chapter Introduction | |
| X05AAF | Return date and time as an array of integers |
| X05ABF | Convert array of integers representing date and time to character string |
| X05ACF | Compare two character strings representing date and time |
| X05BAF | Return the CPU time |