| A00AAF |
Prints details of the NAG Fortran Library implementation |
| A02AAF | Square root of complex number |
| A02ABF | Modulus of complex number |
| A02ACF | Quotient of two complex numbers |
| C02AFF | All zeros of complex polynomial, modified Laguerre method |
| C02AGF | All zeros of real polynomial, modified Laguerre method |
| C02AHF | All zeros of complex quadratic |
| C02AJF | All zeros of real quadratic |
| 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 |
| 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 and sequences stored as columns |
| 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) |
| 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 |
| 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, set-up for D02LAF |
| D02LYF | Second-order ODEs, IVP, diagnostics for D02LAF |
| D02LZF | Second-order ODEs, IVP, interpolation for D02LAF |
| D02MVF | ODEs, IVP, DASSL method, set-up 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, set-up for D02M--N routines |
| D02NWF | ODEs, IVP, Blend method, set-up 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, set-up 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, set-up 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, set-up 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, set-up 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 |
| D03EAF | Elliptic PDE, Laplace's equation, two-dimensional arbitrary domain |
| D03EBF | Elliptic PDE, solution of finite difference equations by SIP, five-point two-dimensional molecule, iterate to convergence |
| D03ECF | Elliptic PDE, solution of finite difference equations by SIP for seven-point three-dimensional molecule, iterate to convergence |
| D03EDF | Elliptic PDE, solution of finite difference equations by a multigrid technique |
| D03EEF | Discretize a second-order elliptic PDE on a rectangle |
| D03FAF | Elliptic PDE, Helmholtz equation, three-dimensional Cartesian co-ordinates |
| D03MAF | Triangulation of plane region |
| D03PCF | General system of parabolic PDEs, method of lines, finite differences, one space variable |
| D03PDF | General system of parabolic PDEs, method of lines, Chebyshev C0 collocation, one space variable |
| D03PEF | General system of first-order PDEs, method of lines, Keller box discretisation, one space variable |
| D03PFF | General system of convection-diffusion PDEs with source terms in conservative form, method of lines, upwind scheme using numerical flux function based on Riemann solver, one space variable |
| D03PHF | General system of parabolic PDEs, coupled DAEs, method of lines, finite differences, one space variable |
| D03PJF | General system of parabolic PDEs, coupled DAEs, method of lines, Chebyshev C0 collocation, one space variable |
| D03PKF | General system of first-order PDEs, coupled DAEs, method of lines, Keller box discretisation, one space variable |
| D03PLF | General system of convection-diffusion PDEs with source terms in conservative form, coupled DAEs, method of lines, upwind scheme using numerical flux function based on Riemann solver, one space variable |
| D03PPF | General system of parabolic PDEs, coupled DAEs, method of lines, finite differences, remeshing, one space variable |
| D03PRF | General system of first-order PDEs, coupled DAEs, method of lines, Keller box discretisation, remeshing, one space variable |
| D03PSF | General system of convection-diffusion PDEs with source terms in conservative form, coupled DAEs, method of lines, upwind scheme using numerical flux function based on Riemann solver, remeshing, one space variable |
| D03PUF | Roe's approximate Riemann solver for Euler equations in conservative form, for use with D03PFF, D03PLF and D03PSF |
| D03PVF | Osher's approximate Riemann solver for Euler equations in conservative form, for use with D03PFF, D03PLF and D03PSF |
| D03PWF | Modified HLL Riemann solver for Euler equations in conservative form, for use with D03PFF, D03PLF and D03PSF |
| D03PXF | Exact Riemann Solver for Euler equations in conservative form, for use with D03PFF, D03PLF and D03PSF |
| D03PYF | PDEs, spatial interpolation with D03PDF or D03PJF |
| D03PZF | PDEs, spatial interpolation with D03PCF, D03PEF, D03PFF, D03PHF, D03PKF, D03PLF, D03PPF, D03PRF or D03PSF |
| D03RAF | General system of second-order PDEs, method of lines, finite differences, remeshing, two space variables, rectangular region |
| D03RBF | General system of second-order PDEs, method of lines, finite differences, remeshing, two space variables, rectilinear region |
| D03RYF | Check initial grid data in D03RBF |
| D03RZF | Extract grid data from D03RBF |
| D03UAF | Elliptic PDE, solution of finite difference equations by SIP, five-point two-dimensional molecule, one iteration |
| D03UBF | Elliptic PDE, solution of finite difference equations by SIP, seven-point three-dimensional molecule, one iteration |
| D04AAF | Numerical differentiation, derivatives up to order 14, function of one real variable |
| 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 |
| 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 |
| E01SEF | Interpolating functions, modified Shepard's method, two variables |
| E01SFF | Interpolated values, evaluate interpolant computed by E01SEF, 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 |
| E02ACF | Minimax curve fit by polynomials |
| E02ADF | Least-squares curve fit, by polynomials, arbitrary data points |
| E02AEF | Evaluation of fitted polynomial in one variable from Chebyshev series form (simplified parameter list) |
| E02AFF | Least-squares polynomial fit, special data points (including interpolation) |
| E02AGF | Least-squares polynomial fit, values and derivatives may be constrained, arbitrary data points |
| E02AHF | Derivative of fitted polynomial in Chebyshev series form |
| E02AJF | Integral of fitted polynomial in Chebyshev series form |
| E02AKF | Evaluation of fitted polynomial in one variable from Chebyshev series form |
| E02BAF | Least-squares curve cubic spline fit (including interpolation) |
| E02BBF | Evaluation of fitted cubic spline, function only |
| E02BCF | Evaluation of fitted cubic spline, function and derivatives |
| E02BDF | Evaluation of fitted cubic spline, definite integral |
| E02BEF | Least-squares cubic spline curve fit, automatic knot placement |
| E02CAF | Least-squares surface fit by polynomials, data on lines |
| E02CBF | Evaluation of fitted polynomial in two variables |
| E02DAF | Least-squares surface fit, bicubic splines |
| E02DCF | Least-squares surface fit by bicubic splines with automatic knot placement, data on rectangular grid |
| E02DDF | Least-squares surface fit by bicubic splines with automatic knot placement, scattered data |
| E02DEF | Evaluation of fitted bicubic spline at a vector of points |
| E02DFF | Evaluation of fitted bicubic spline at a mesh of points |
| E02GAF |
L1-approximation by general linear function |
| E02GBF |
L1-approximation by general linear function subject to linear inequality constraints |
| E02GCF |
Linfinity-approximation by general linear function |
| E02RAF | Padé-approximants |
| E02RBF | Evaluation of fitted rational function as computed by E02RAF |
| E02ZAF | Sort two-dimensional data into panels for fitting bicubic splines |
| 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 |
| 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 |
| 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 | ULDLTUT 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 |
| F02BJF | All eigenvalues and optionally eigenvectors of generalized eigenproblem by QZ algorithm, real matrices (Black Box) |
| F02EAF | All eigenvalues and Schur factorization of real general matrix (Black Box) |
| F02EBF | All eigenvalues and eigenvectors of real general matrix (Black Box) |
| F02ECF | Selected eigenvalues and eigenvectors of real nonsymmetric matrix (Black Box) |
| F02FAF | All eigenvalues and eigenvectors of real symmetric matrix (Black Box) |
| F02FCF | Selected eigenvalues and eigenvectors of real symmetric matrix (Black Box) |
| F02FDF | All eigenvalues and eigenvectors of real symmetric-definite generalized problem (Black Box) |
| F02FHF | All eigenvalues of generalized banded real symmetric-definite eigenproblem (Black Box) |
| F02FJF | Selected eigenvalues and eigenvectors of sparse symmetric eigenproblem (Black Box) |
| F02GAF | All eigenvalues and Schur factorization of complex general matrix (Black Box) |
| F02GBF | All eigenvalues and eigenvectors of complex general matrix (Black Box) |
| F02GCF | Selected eigenvalues and eigenvectors of complex nonsymmetric matrix (Black Box) |
| F02GJF | All eigenvalues and optionally eigenvectors of generalized complex eigenproblem by QZ algorithm (Black Box) |
| F02HAF | All eigenvalues and eigenvectors of complex Hermitian matrix (Black Box) |
| F02HCF | Selected eigenvalues and eigenvectors of complex Hermitian matrix (Black Box) |
| F02HDF | All eigenvalues and eigenvectors of complex Hermitian-definite generalized problem (Black Box) |
| F02SDF | Eigenvector of generalized real banded eigenproblem by inverse iteration |
| F02WDF |
QR factorization, possibly followed by SVD |
| F02WEF | SVD of real matrix (Black Box) |
| F02WUF | SVD of real upper triangular matrix (Black Box) |
| F02XEF | SVD of complex matrix (Black Box) |
| F02XUF | SVD of complex upper triangular matrix (Black Box) |
| 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 |
| 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 |
| F05AAF | Gram--Schmidt orthogonalisation of n vectors of order m |
| F06AAF | (SROTG/DROTG) Generate real plane rotation |
| F06BAF | Generate real plane rotation, storing tangent |
| F06BCF | Recover cosine and sine from given real tangent |
| F06BEF | Generate real Jacobi plane rotation |
| F06BHF | Apply real similarity rotation to 2 by 2 symmetric matrix |
| F06BLF | Compute quotient of two real scalars, with overflow flag |
| F06BMF | Compute Euclidean norm from scaled form |
| F06BNF | Compute square root of ( a2 + b2), real a and b |
| F06BPF | Compute eigenvalue of 2 by 2 real symmetric matrix |
| F06CAF | Generate complex plane rotation, storing tangent, real cosine |
| F06CBF | Generate complex plane rotation, storing tangent, real sine |
| F06CCF | Recover cosine and sine from given complex tangent, real cosine |
| F06CDF | Recover cosine and sine from given complex tangent, real sine |
| F06CHF | Apply complex similarity rotation to 2 by 2 Hermitian matrix |
| F06CLF | Compute quotient of two complex scalars, with overflow flag |
| F06DBF | Broadcast scalar into integer vector |
| F06DFF | Copy integer vector |
| F06EAF | (SDOT/DDOT) Dot product of two real vectors |
| F06ECF | (SAXPY/DAXPY) Add scalar times real vector to real vector |
| F06EDF | (SSCAL/DSCAL) Multiply real vector by scalar |
| F06EFF | (SCOPY/DCOPY) Copy real vector |
| F06EGF | (SSWAP/DSWAP) Swap two real vectors |
| F06EJF | (SNRM2/DNRM2) Compute Euclidean norm of real vector |
| F06EKF | (SASUM/DASUM) Sum absolute values of real vector elements |
| F06EPF | (SROT/DROT) Apply real plane rotation |
| F06ERF | (SDOTI/DDOTI) Dot product of two real sparse vectors |
| F06ETF | (SAXPYI/DAXPYI) Add scalar times real sparse vector to real sparse vector |
| F06EUF | (SGTHR/DGTHR) Gather real sparse vector |
| F06EVF | (SGTHRZ/DGTHRZ) Gather and set to zero real sparse vector |
| F06EWF | (SSCTR/DSCTR) Scatter real sparse vector |
| F06EXF | (SROTI/DROTI) Apply plane rotation to two real sparse vectors |
| F06FAF | Compute cosine of angle between two real vectors |
| F06FBF | Broadcast scalar into real vector |
| F06FCF | Multiply real vector by diagonal matrix |
| F06FDF | Multiply real vector by scalar, preserving input vector |
| F06FGF | Negate real vector |
| F06FJF | Update Euclidean norm of real vector in scaled form |
| F06FKF | Compute weighted Euclidean norm of real vector |
| F06FLF | Elements of real vector with largest and smallest absolute value |
| F06FPF | Apply real symmetric plane rotation to two vectors |
| F06FQF | Generate sequence of real plane rotations |
| F06FRF | Generate real elementary reflection, NAG style |
| F06FSF | Generate real elementary reflection, LINPACK style |
| F06FTF | Apply real elementary reflection, NAG style |
| F06FUF | Apply real elementary reflection, LINPACK style |
| F06GAF | (CDOTU/ZDOTU) Dot product of two complex vectors, unconjugated |
| F06GBF | (CDOTC/ZDOTC) Dot product of two complex vectors, conjugated |
| F06GCF | (CAXPY/ZAXPY) Add scalar times complex vector to complex vector |
| F06GDF | (CSCAL/ZSCAL) Multiply complex vector by complex scalar |
| F06GFF | (CCOPY/ZCOPY) Copy complex vector |
| F06GGF | (CSWAP/ZSWAP) Swap two complex vectors |
| F06GRF | (CDOTUI/ZDOTUI) Dot product of two complex sparse vector, unconjugated |
| F06GSF | (CDOTCI/ZDOTCI) Dot product of two complex sparse vector, conjugated |
| F06GTF | (CAXPYI/ZAXPYI) Add scalar times complex sparse vector to complex sparse vector |
| F06GUF | (CGTHR/ZGTHR) Gather complex sparse vector |
| F06GVF | (CGTHRZ/ZGTHRZ) Gather and set to zero complex sparse vector |
| F06GWF | (CSCTR/ZSCTR) Scatter complex sparse vector |
| F06HBF | Broadcast scalar into complex vector |
| F06HCF | Multiply complex vector by complex diagonal matrix |
| F06HDF | Multiply complex vector by complex scalar, preserving input vector |
| F06HGF | Negate complex vector |
| F06HPF | Apply complex plane rotation |
| F06HQF | Generate sequence of complex plane rotations |
| F06HRF | Generate complex elementary reflection |
| F06HTF | Apply complex elementary reflection |
| F06JDF | (CSSCAL/ZDSCAL) Multiply complex vector by real scalar |
| F06JJF | (SCNRM2/DZNRM2) Compute Euclidean norm of complex vector |
| F06JKF | (SCASUM/DZASUM) Sum absolute values of complex vector elements |
| F06JLF | (ISAMAX/IDAMAX) Index, real vector element with largest absolute value |
| F06JMF | (ICAMAX/IZAMAX) Index, complex vector element with largest absolute value |
| F06KCF | Multiply complex vector by real diagonal matrix |
| F06KDF | Multiply complex vector by real scalar, preserving input vector |
| F06KFF | Copy real vector to complex vector |
| F06KJF | Update Euclidean norm of complex vector in scaled form |
| F06KLF | Last non-negligible element of real vector |
| F06KPF | Apply real plane rotation to two complex vectors |
| F06PAF | (SGEMV/DGEMV) Matrix-vector product, real rectangular matrix |
| F06PBF | (SGBMV/DGBMV) Matrix-vector product, real rectangular band matrix |
| F06PCF | (SSYMV/DSYMV) Matrix-vector product, real symmetric matrix |
| F06PDF | (SSBMV/DSBMV) Matrix-vector product, real symmetric band matrix |
| F06PEF | (SSPMV/DSPMV) Matrix-vector product, real symmetric packed matrix |
| F06PFF | (STRMV/DTRMV) Matrix-vector product, real triangular matrix |
| F06PGF | (STBMV/DTBMV) Matrix-vector product, real triangular band matrix |
| F06PHF | (STPMV/DTPMV) Matrix-vector product, real triangular packed matrix |
| F06PJF | (STRSV/DTRSV) System of equations, real triangular matrix |
| F06PKF | (STBSV/DTBSV) System of equations, real triangular band matrix |
| F06PLF | (STPSV/DTPSV) System of equations, real triangular packed matrix |
| F06PMF | (SGER/DGER) Rank-1 update, real rectangular matrix |
| F06PPF | (SSYR/DSYR) Rank-1 update, real symmetric matrix |
| F06PQF | (SSPR/DSPR) Rank-1 update, real symmetric packed matrix |
| F06PRF | (SSYR2/DSYR2) Rank-2 update, real symmetric matrix |
| F06PSF | (SSPR2/DSPR2) Rank-2 update, real symmetric packed matrix |
| F06QFF | Matrix copy, real rectangular or trapezoidal matrix |
| F06QHF | Matrix initialisation, real rectangular matrix |
| F06QJF | Permute rows or columns, real rectangular matrix, permutations represented by an integer array |
| F06QKF | Permute rows or columns, real rectangular matrix, permutations represented by a real array |
| F06QMF | Orthogonal similarity transformation of real symmetric matrix as a sequence of plane rotations |
| F06QPF |
QR factorization by sequence of plane rotations, rank-1 update of real upper triangular matrix |
| F06QQF |
QR factorization by sequence of plane rotations, real upper triangular matrix augmented by a full row |
| F06QRF |
QR or RQ factorization by sequence of plane rotations, real upper Hessenberg matrix |
| F06QSF |
QR or RQ factorization by sequence of plane rotations, real upper spiked matrix |
| F06QTF |
QR factorization of UZ or RQ factorization of ZU, U real upper triangular, Z a sequence of plane rotations |
| F06QVF | Compute upper Hessenberg matrix by sequence of plane rotations, real upper triangular matrix |
| F06QWF | Compute upper spiked matrix by sequence of plane rotations, real upper triangular matrix |
| F06QXF | Apply sequence of plane rotations, real rectangular matrix |
| F06RAF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, real general matrix |
| F06RBF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, real band matrix |
| F06RCF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, real symmetric matrix |
| F06RDF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, real symmetric matrix, packed storage |
| F06REF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, real symmetric band matrix |
| F06RJF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, real trapezoidal/triangular matrix |
| F06RKF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, real triangular matrix, packed storage |
| F06RLF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, real triangular band matrix |
| F06RMF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, real Hessenberg matrix |
| F06SAF | (CGEMV/ZGEMV) Matrix-vector product, complex rectangular matrix |
| F06SBF | (CGBMV/ZGBMV) Matrix-vector product, complex rectangular band matrix |
| F06SCF | (CHEMV/ZHEMV) Matrix-vector product, complex Hermitian matrix |
| F06SDF | (CHBMV/ZHBMV) Matrix-vector product, complex Hermitian band matrix |
| F06SEF | (CHPMV/ZHPMV) Matrix-vector product, complex Hermitian packed matrix |
| F06SFF | (CTRMV/ZTRMV) Matrix-vector product, complex triangular matrix |
| F06SGF | (CTBMV/ZTBMV) Matrix-vector product, complex triangular band matrix |
| F06SHF | (CTPMV/ZTPMV) Matrix-vector product, complex triangular packed matrix |
| F06SJF | (CTRSV/ZTRSV) System of equations, complex triangular matrix |
| F06SKF | (CTBSV/ZTBSV) System of equations, complex triangular band matrix |
| F06SLF | (CTPSV/ZTPSV) System of equations, complex triangular packed matrix |
| F06SMF | (CGERU/ZGERU) Rank-1 update, complex rectangular matrix, unconjugated vector |
| F06SNF | (CGERC/ZGERC) Rank-1 update, complex rectangular matrix, conjugated vector |
| F06SPF | (CHER/ZHER) Rank-1 update, complex Hermitian matrix |
| F06SQF | (CHPR/ZHPR) Rank-1 update, complex Hermitian packed matrix |
| F06SRF | (CHER2/ZHER2) Rank-2 update, complex Hermitian matrix |
| F06SSF | (CHPR2/ZHPR2) Rank-2 update, complex Hermitian packed matrix |
| F06TFF | Matrix copy, complex rectangular or trapezoidal matrix |
| F06THF | Matrix initialisation, complex rectangular matrix |
| F06TMF | Unitary similarity transformation of Hermitian matrix as a sequence of plane rotations |
| F06TPF |
QR factorization by sequence of plane rotations, rank-1 update of complex upper triangular matrix |
| F06TQF |
QRxk factorization by sequence of plane rotations, complex upper triangular matrix augmented by a full row |
| F06TRF |
QR or RQ factorization by sequence of plane rotations, complex upper Hessenberg matrix |
| F06TSF |
QR or RQ factorization by sequence of plane rotations, complex upper spiked matrix |
| F06TTF |
QR factorization of UZ or RQ factorization of ZU, U complex upper triangular, Z a sequence of plane rotations |
| F06TVF | Compute upper Hessenberg matrix by sequence of plane rotations, complex upper triangular matrix |
| F06TWF | Compute upper spiked matrix by sequence of plane rotations, complex upper triangular matrix |
| F06TXF | Apply sequence of plane rotations, complex rectangular matrix, real cosine and complex sine |
| F06TYF | Apply sequence of plane rotations, complex rectangular matrix, complex cosine and real sine |
| F06UAF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, complex general matrix |
| F06UBF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, complex band matrix |
| F06UCF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, complex Hermitian matrix |
| F06UDF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, complex Hermitian matrix, packed storage |
| F06UEF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, complex Hermitian band matrix |
| F06UFF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, complex symmetric matrix |
| F06UGF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, complex symmetric matrix, packed storage |
| F06UHF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, complex symmetric band matrix |
| F06UJF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, complex trapezoidal/triangular matrix |
| F06UKF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, complex triangular matrix, packed storage |
| F06ULF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, complex triangular band matrix |
| F06UMF | 1-norm, infinity-norm, Frobenius norm, largest absolute element, complex Hessenberg matrix |
| F06VJF | Permute rows or columns, complex rectangular matrix, permutations represented by an integer array |
| F06VKF | Permute rows or columns, complex rectangular matrix, permutations represented by a real array |
| F06VXF | Apply sequence of plane rotations, complex rectangular matrix, real cosine and sine |
| F06YAF | (SGEMM/DGEMM) Matrix-matrix product, two real rectangular matrices |
| F06YCF | (SSYMM/DSYMM) Matrix-matrix product, one real symmetric matrix, one real rectangular matrix |
| F06YFF | (STRMM/DTRMM) Matrix-matrix product, one real triangular matrix, one real rectangular matrix |
| F06YJF | (STRSM/DTRSM) Solves system of equations with multiple right-hand sides, real triangular coefficient matrix |
| F06YPF | (SSYRK/DSYRK) Rank-k update of real symmetric matrix |
| F06YRF | (SSYR2K/DSYR2K) Rank-2k update of real symmetric matrix |
| F06ZAF | (CGEMM/ZGEMM) Matrix-matrix product, two complex rectangular matrices |
| F06ZCF | (CHEMM/ZHEMM) Matrix-matrix product, one complex Hermitian matrix, one complex rectangular matrix |
| F06ZFF | (CTRMM/ZTRMM) Matrix-matrix product, one complex triangular matrix, one complex rectangular matrix |
| F06ZJF | (CTRSM/ZTRSM) Solves system of equations with multiple right-hand sides, complex triangular coefficient matrix |
| F06ZPF | (CHERK/ZHERK) Rank-k update of complex Hermitian matrix |
| F06ZRF | (CHER2K/ZHER2K) Rank-2k update of complex Hermitian matrix |
| F06ZTF | (CSYMM/ZSYMM) Matrix-matrix product, one complex symmetric matrix, one complex rectangular matrix |
| F06ZUF | (CSYRK/ZSYRK) Rank-k update of complex symmetric matrix |
| F06ZWF | (CSYR2K/ZHER2K) Rank-2k update of complex symmetric matrix |
| F07ADF | (SGETRF/DGETRF) LU factorization of real m by n matrix |
| F07AEF | (SGETRS/DGETRS) Solution of real system of linear equations, multiple right-hand sides, matrix already factorized by F07ADF |
| F07AGF | (SGECON/DGECON) Estimate condition number of real matrix, matrix already factorized by F07ADF |
| F07AHF | (SGERFS/DGERFS) Refined solution with error bounds of real system of linear equations, multiple right-hand sides |
| F07AJF | (SGETRI/DGETRI) Inverse of real matrix, matrix already factorized by F07ADF |
| F07ARF | (CGETRF/ZGETRF) LU factorization of complex m by n matrix |
| F07ASF | (CGETRS/ZGETRS) Solution of complex system of linear equations, multiple right-hand sides, matrix already factorized by F07ARF |
| F07AUF | (CGECON/ZGECON) Estimate condition number of complex matrix, matrix already factorized by F07ARF |
| F07AVF | (CGERFS/ZGERFS) Refined solution with error bounds of complex system of linear equations, multiple right-hand sides |
| F07AWF | (CGETRI/ZGETRI) Inverse of complex matrix, matrix already factorized by F07ARF |
| F07BDF | (SGBTRF/DGBTRF) LU factorization of real m by n band matrix |
| F07BEF | (SGBTRS/DGBTRS) Solution of real band system of linear equations, multiple right-hand sides, matrix already factorized by F07BDF |
| F07BGF | (SGBCON/DGBCON) Estimate condition number of real band matrix, matrix already factorized by F07BDF |
| F07BHF | (SGBRFS/DGBRFS) Refined solution with error bounds of real band system of linear equations, multiple right-hand sides |
| F07BRF | (CGBTRF/ZGBTRF) LU factorization of complex m by n band matrix |
| F07BSF | (CGBTRS/ZGBTRS) Solution of complex band system of linear equations, multiple right-hand sides, matrix already factorized by F07BRF |
| F07BUF | (CGBCON/ZGBCON) Estimate condition number of complex band matrix, matrix already factorized by F07BRF |
| F07BVF | (CGBRFS/ZGBRFS) Refined solution with error bounds of complex band system of linear equations, multiple right-hand sides |
| F07FDF | (SPOTRF/DPOTRF) Cholesky factorization of real symmetric positive-definite matrix |
| F07FEF | (SPOTRS/DPOTRS) Solution of real symmetric positive-definite system of linear equations, multiple right-hand sides, matrix already factorized by F07FDF |
| F07FGF | (SPOCON/DPOCON) Estimate condition number of real symmetric positive-definite matrix, matrix already factorized by F07FDF |
| F07FHF | (SPORFS/DPORFS) Refined solution with error bounds of real symmetric positive-definite system of linear equations, multiple right-hand sides |
| F07FJF | (SPOTRI/DPOTRI) Inverse of real symmetric positive-definite matrix, matrix already factorized by F07FDF |
| F07FRF | (CPOTRF/ZPOTRF) Cholesky factorization of complex Hermitian positive-definite matrix |
| F07FSF | (CPOTRS/ZPOTRS) Solution of complex Hermitian positive-definite system of linear equations, multiple right-hand sides, matrix already factorized by F07FRF |
| F07FUF | (CPOCON/ZPOCON) Estimate condition number of complex Hermitian positive-definite matrix, matrix already factorized by F07FRF |
| F07FVF | (CPORFS/ZPORFS) Refined solution with error bounds of complex Hermitian positive-definite system of linear equations, multiple right-hand sides |
| F07FWF | (CPOTRI/ZPOTRI) Inverse of complex Hermitian positive-definite matrix, matrix already factorized by F07FRF |
| F07GDF | (SPPTRF/DPPTRF) Cholesky factorization of real symmetric positive-definite matrix, packed storage |
| F07GEF | (SPPTRS/DPPTRS) Solution of real symmetric positive-definite system of linear equations, multiple right-hand sides, matrix already factorized by F07GDF, packed storage |
| F07GGF | (SPPCON/DPPCON) Estimate condition number of real symmetric positive-definite matrix, matrix already factorized by F07GDF, packed storage |
| F07GHF | (SPPRFS/DPPRFS) Refined solution with error bounds of real symmetric positive-definite system of linear equations, multiple right-hand sides, packed storage |
| F07GJF | (SPPTRI/DPPTRI) Inverse of real symmetric positive-definite matrix, matrix already factorized by F07GDF, packed storage |
| F07GRF | (CPPTRF/ZPPTRF) Cholesky factorization of complex Hermitian positive-definite matrix, packed storage |
| F07GSF | (CPPTRS/ZPPTRS) Solution of complex Hermitian positive-definite system of linear equations, multiple right-hand sides, matrix already factorized by F07GRF, packed storage |
| F07GUF | (CPPCON/ZPPCON) Estimate condition number of complex Hermitian positive-definite matrix, matrix already factorized by F07GRF, packed storage |
| F07GVF | (CPPRFS/ZPPRFS) Refined solution with error bounds of complex Hermitian positive-definite system of linear equations, multiple right-hand sides, packed storage |
| F07GWF |