NAG Library Contents Overview

Chapter Summaries

A00 – Library Identification

Full details of this chapter for your environment: Fortran C Toolbox .NET

The routines in this chapter provide information about the NAG Library.

Information about the precise implementation of the NAG Library in use will be needed when communicating with the NAG Technical Support Service (see NAG Library Manual Introductory document 'Support from NAG').

A02 – Complex Arithmetic

Full details of this chapter for your environment: Fortran C Toolbox

This chapter provides facilities for arithmetic operations involving complex numbers.

C02 – Zeros of Polynomials

Full details of this chapter for your environment: Fortran C Toolbox

This chapter is concerned with computing the zeros of a polynomial with real or complex coefficients.

C05 – Roots of One or More Transcendental Equations

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter is concerned with the calculation of zeros of continuous functions of one or more variables. The majority of problems considered are for real-valued functions of real variables, in which case complex equations must be expressed in terms of the equivalent larger system of real equations.

C06 – Summation of Series

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter is concerned with the following tasks.

C09 – Wavelet Transforms

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter is concerned with the analysis of datasets (or functions or operators) in terms of frequency and scale components using wavelet transforms. Wavelet transforms have been applied in many fields from time series analysis to image processing and the localization in either frequency or scale that they provide is useful for data compression or denoising. In general the standard wavelet transform uses dilation and scaling of a chosen function, ψ(t), (called the mother wavelet) such that ψa,b(t)=1/(sqrt(a))ψ((t-b)/a) where a gives the scaling and b determines the translation. Wavelet methods can be divided into continuous transforms and discrete transforms. In the continuous case, the pair a and b are real numbers with a>0. For the discrete transform, a and b can be chosen as a=2-j, b=k2-j for integers j, k ψj,k(t)=2j/2ψ(2jt-k).

The continuous real valued, one-dimensional wavelet transform (CWT) is included in this chapter. The discrete wavelet transform (DWT) at a single level together with its inverse and the multi-level DWT with inverse are also provided for one, two and three dimensions. The Maximal Overlap DWT (MODWT) together with its inverse and the multi-level MODWT with inverse are provided for one dimension. The choice of wavelet for CWT includes the Morlet wavelet and derivatives of a Gaussian while the DWT and MODWT offer the orthogonal wavelets of Daubechies and a selection of biorthogonal wavelets.

D01 – Quadrature

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter provides routines for the numerical evaluation of definite integrals in one or more dimensions and for evaluating weights and abscissae of integration rules.

D02 – Ordinary Differential Equations

Full details of this chapter for your environment: Fortran C Toolbox

This chapter is concerned with the numerical solution of ordinary differential equations. There are two main types of problem: those in which all boundary conditions are specified at one point (initial value problems), and those in which the boundary conditions are distributed between two or more points (boundary value problems and eigenvalue problems). Routines are available for initial value problems, two-point boundary value problems and Sturm–Liouville eigenvalue problems.

D03 – Partial Differential Equations

Full details of this chapter for your environment: Fortran C Toolbox

This chapter is concerned with the numerical solution of partial differential equations.

D04 – Numerical Differentiation

Full details of this chapter for your environment: Fortran C Toolbox

This chapter is concerned with calculating approximations to derivatives of a function f.

D05 – Integral Equations

Full details of this chapter for your environment: Fortran C Toolbox

This chapter is concerned with the numerical solution of integral equations. Provision will be made for most of the standard types of equation (see the Chapter Introduction). The following are, however, specifically excluded:

D06 – Mesh Generation

Full details of this chapter for your environment: Fortran C Toolbox

This chapter is concerned with automatic mesh generation

E01 – Interpolation

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter is concerned with the interpolation of a function of one or more variables. When provided with the value of the function (and possibly one or more of its lowest-order derivatives) at each of a number of values of the variable(s), the NAG Library routines provide either an interpolating function or an interpolated value. For some of the interpolating functions, there are supporting NAG Library routines to evaluate, differentiate or integrate them.

E02 – Curve and Surface Fitting

Full details of this chapter for your environment: Fortran C Toolbox .NET

The main aim of this chapter is to assist you in finding a function which approximates a set of data points. Typically the data contain random errors, as of experimental measurement, which need to be smoothed out. To seek an approximation to the data, it is first necessary to specify for the approximating function a mathematical form (a polynomial, for example) which contains a number of unspecified coefficients: the appropriate fitting routine then derives for the coefficients the values which provide the best fit of that particular form. The chapter deals mainly with curve and surface fitting (i.e., fitting with functions of one and of two variables) when a polynomial or a cubic spline is used as the fitting function, since these cover the most common needs. However, fitting with other functions and/or more variables can be undertaken by means of general linear or nonlinear routines (some of which are contained in other chapters) depending on whether the coefficients in the function occur linearly or nonlinearly. Cases where a graph rather than a set of data points is given can be treated simply by first reading a suitable set of points from the graph.

The chapter also contains routines for evaluating, differentiating and integrating polynomial and spline curves and surfaces, once the numerical values of their coefficients have been determined.

There is also a routine for computing a Padé approximant of a mathematical function (see the Chapter Introduction).

E04 – Minimizing or Maximizing a Function

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter provides routines for solving various mathematical optimization problems by solvers based on local stopping criteria. The main classes of problems covered in this chapter are:

For a full overview of the functionality offered in this chapter, see the Chapter Introduction or the Chapter Contents (Chapter E04).

See also other chapters in the relevant to optimization:

This introduction is only a brief guide to the subject of optimization. It discusses a classification of the optimization problems and presents an overview of the algorithms and their stopping criteria to help with the choice of a correct solver for a particular problem. Anyone with a difficult or protracted problem to solve will find it beneficial to consult a more detailed text, see the References section in the Chapter Introduction. If you are unfamiliar with the mathematics of the subject you may find the Chapter Introduction a useful starting point.

E05 – Global Optimization of a Function

Full details of this chapter for your environment: Fortran C Toolbox .NET

Global optimization involves finding the absolute maximum or minimum value of a function (the objective function) of several variables, possibly subject to restrictions (defined by a set of bounds or constraint functions) on the values of the variables. Such problems can be much harder to solve than local optimization problems (which are discussed in Chapter E04) because it is difficult to determine whether a potential optimum found is global, and because of the nonlocal methods required to avoid becoming trapped near local optima. Most optimization routines in the NAG Library are concerned with function minimization only, since the problem of maximizing a given objective function F is equivalent to minimizing -F. In e05jb, e05sa and e05sb, you may specify whether you are solving a minimization or maximization problem; in the latter case, the required transformation of the objective function will be carried out automatically. In what follows we refer exclusively to minimization problems.

This introduction is a brief guide to the subject of global optimization, designed for the casual user. For further details you may find it beneficial to consult a more detailed text, see the References section in the Chapter Introduction. Furthermore, much of the material in the E04 Chapter Introduction is also relevant in this context and it is strongly recommended that you read the E04 Chapter Introduction.

F01 – Matrix Operations, Including Inversion

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter provides facilities for four types of problem:

See the Chapter Introduction where these problems are discussed.

F02 – Eigenvalues and Eigenvectors

Full details of this chapter for your environment: Fortran C Toolbox

This chapter provides routines for various types of matrix eigenvalue problem:

Routines are provided for both real and complex data.

The majority of routines for these problems can be found in Chapter F08 which contains software derived from LAPACK (see Anderson et al. (1999) LAPACK Users' Guide). However, you should read the F02 Chapter Introduction before turning to Chapter F08, especially if you are a new user. Chapter F12 contains routines for large sparse eigenvalue problems, although one such routine is also available in this chapter.

Chapters F02 and F08 contain Black Box (or Driver) routines that enable many problems to be solved by a call to a single routine, and the decision trees in the Chapter Introduction direct you to the most appropriate routines in Chapters F02 and F08. The Chapter F02 routines call routines in Chapters F07 and F08 wherever possible to perform the computations, and there are pointers in the Chapter Introduction to the relevant decision trees in Chapter F08.

F03 – Determinants

Full details of this chapter for your environment: Fortran C Toolbox

This chapter is concerned with the calculation of determinants of square matrices.

F04 – Simultaneous Linear Equations

Full details of this chapter for your environment: Fortran C Toolbox

This chapter is concerned with the solution of the matrix equation AX=B, where B may be a single vector or a matrix of multiple right-hand sides. The matrix A may be real, complex, symmetric, Hermitian, positive definite, positive definite Toeplitz or banded. It may also be rectangular, in which case a least squares solution is obtained.

Much of the functionality of this chapter has been superseded by routines from Chapters F07 and F08 (LAPACK routines) as those chapters have grown and have included driver and expert driver routines.

For a general introduction to sparse systems of equations, see the F11 Chapter Introduction, which provides routines for large sparse systems. Some routines for sparse problems are also included in this chapter; they are described in the Chapter Introduction.

F05 – Orthogonalization

Full details of this chapter for your environment: Fortran Toolbox

This chapter is concerned with the orthogonalization of vectors in a finite dimensional space.

F06 – Linear Algebra Support Routines

Full details of this chapter for your environment: Fortran C .NET

This chapter is concerned with basic linear algebra routines which perform elementary algebraic operations involving scalars, vectors and matrices. It includes routines which conform to the specifications of the BLAS (Basic Linear Algebra Subprograms).

F07 – Linear Equations (LAPACK)

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter provides routines for the solution of systems of simultaneous linear equations, and associated computations. It provides routines for

Routines are provided for both real and complex data.

For a general introduction to the solution of systems of linear equations, you should turn first to the F04 Chapter Introduction. The decision trees, in the F04 Chapter Introduction, direct you to the most appropriate routines in Chapters F04 and F07 for solving your particular problem. In particular, Chapters F04 and F07 contain Black Box (or driver) routines which enable some standard types of problem to be solved by a call to a single routine. Where possible, routines in Chapter F04 call Chapter F07 routines to perform the necessary computational tasks.

There are two types of driver routines in this chapter: simple drivers which just return the solution to the linear equations; and expert drivers which also return condition and error estimates and, in many cases, also allow equilibration. The simple drivers for real matrices have names of the form F07_AF (D__SV) and for complex matrices have names of the form F07_NF (Z__SV). The expert drivers for real matrices have names of the form F07_BF (D__SVX) and for complex matrices have names of the form F07_PF (Z__SVX).

The routines in this chapter (Chapter F07) handle only dense and band matrices (not matrices with more specialised structures, or general sparse matrices).

The routines in this chapter have all been derived from the LAPACK project (see Anderson et al. (1999) LAPACK Users' Guide). They have been designed to be efficient on a wide range of high-performance computers, without compromising efficiency on conventional serial machines.

F08 – Least Squares and Eigenvalue Problems (LAPACK)

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter provides routines for the solution of linear least squares problems, eigenvalue problems and singular value problems, as well as associated computations. It provides routines for:

Routines are provided for both real and complex data.

For a general introduction to the solution of linear least squares problems, you should turn first to Chapter F04. The decision trees, at the end of Chapter F04, direct you to the most appropriate routines in Chapters F04 and F08. Chapters F04 and F08 contain Black Box (or driver) routines which enable standard linear least squares problems to be solved by a call to a single routine.

For a general introduction to eigenvalue and singular value problems, you should turn first to Chapter F02. The decision trees, at the end of Chapter F02, direct you to the most appropriate routines in Chapters F02 and F08. Chapters F02 and F08 contain Black Box (or driver) routines which enable standard types of problem to be solved by a call to a single routine. Often routines in Chapter F02 call Chapter F08 routines to perform the necessary computational tasks.

The routines in this chapter (Chapter F08) handle only dense, band, tridiagonal and Hessenberg matrices (not matrices with more specialised structures, or general sparse matrices). The tables in the Chapter Introduction and the decision trees in the Chapter Introduction direct you to the most appropriate routines in Chapter F08.

The routines in this chapter have all been derived from the LAPACK project (see Anderson et al. (1999) LAPACK Users' Guide). They have been designed to be efficient on a wide range of high-performance computers, without compromising efficiency on conventional serial machines.

F11 – Large Scale Linear Systems

Full details of this chapter for your environment: Fortran C Toolbox

This chapter provides routines for the solution of large sparse systems of simultaneous linear equations. These include iterative methods for real nonsymmetric and symmetric, complex non-Hermitian and Hermitian linear systems and direct methods for general real linear systems. Further direct methods are currently available in Chapters F01 and F04.

F12 – Large Scale Eigenproblems

Full details of this chapter for your environment: Fortran C Toolbox

This chapter provides routines for computing some eigenvalues and eigenvectors of large-scale (sparse) standard and generalized eigenvalue problems. It provides routines for:

Routines are provided for both real and complex data.

The routines in this chapter have all been derived from the ARPACK software suite (see Lehoucq et al. (1998) ARPACK Users' Guide: Solution of Large-scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods), a collection of Fortran 77 routines designed to solve large scale eigenvalue problems. The interfaces provided in this chapter have been chosen to combine ease of use with the flexibility of the original ARPACK software. The underlying iterative methods and algorithms remain essentially the same as those in ARPACK and are described fully in Lehoucq et al. (1998) ARPACK Users' Guide: Solution of Large-scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods.

The algorithms used are based upon an algorithmic variant of the Arnoldi process called the Implicitly Restarted Arnoldi Method. For symmetric matrices, this reduces to a variant of the Lanczos process called the Implicitly Restarted Lanczos Method. These variants may be viewed as a synthesis of the Arnoldi/Lanczos process with the Implicitly Shifted QR technique that is suitable for large scale problems. For many standard problems, a matrix factorization is not required. Only the action of the matrix on a vector is needed.

F16 – Further Linear Algebra Support Routines

Full details of this chapter for your environment: Fortran C Toolbox

This chapter is concerned with basic linear algebra routines which perform elementary algebraic operations involving scalars, vectors and matrices. Most routines for such operations conform either to the specifications of the BLAS (Basic Linear Algebra Subprograms) or to the specifications of the BLAST (Basic Linear Algebra Subprograms Technical) Forum. This chapter includes routines from the BLAST specifications. Most (BLAS) routines for such operations are available in Chapter F06.

G01 – Simple Calculations on Statistical Data

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter covers three topics:

G02 – Correlation and Regression Analysis

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter is concerned with two techniques

both of which are concerned with determining the inter-relationships among two or more variables.

Other chapters of the NAG Library which cover similar problems are Chapters E02 and E04. Chapter E02 routines may be used to fit linear models by criteria other than least squares, and also for polynomial regression; Chapter E04 routines may be used to fit nonlinear models and linearly constrained linear models.

G03 – Multivariate Methods

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter is concerned with methods for studying multivariate data. A multivariate dataset consists of several variables recorded on a number of objects or individuals. Multivariate methods can be classified as those that seek to examine the relationships between the variables (e.g., principal components), known as variable-directed methods, and those that seek to examine the relationships between the objects (e.g., cluster analysis), known as individual-directed methods.

Multiple regression is not included in this chapter as it involves the relationship of a single variable, known as the response variable, to the other variables in the dataset, the explanatory variables. Routines for multiple regression are provided in Chapter G02.

G04 – Analysis of Variance

Full details of this chapter for your environment: Fortran C Toolbox

This chapter is concerned with methods for analysing the results of designed experiments. The range of experiments covered include:

Further designs may be analysed by combining the analyses provided by multiple calls to routines or by using general linear model routines provided in Chapter G02.

G05 – Random Number Generators

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter is concerned with the generation of sequences of independent pseudorandom and quasi-random numbers from various distributions, and models.

G07 – Univariate Estimation

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter deals with the estimation of unknown parameters of a univariate distribution. It includes both point and interval estimation using maximum likelihood and robust methods.

G08 – Nonparametric Statistics

Full details of this chapter for your environment: Fortran C Toolbox

The routines in this chapter perform nonparametric statistical tests which are based on distribution-free methods of analysis. For convenience, the chapter contents are divided into five types of test: tests of location, tests of dispersion, tests of distribution, tests of association and correlation, and tests of randomness. There are also routines to fit linear regression models using the ranks of the observations.

The emphasis in this chapter is on testing; if you wish to compute nonparametric correlations you are referred to Chapter G02, which contains several routines for that purpose.

There are a large number of nonparametric tests available. A selection of some of the more commonly used tests are included in this chapter.

G10 – Smoothing in Statistics

Full details of this chapter for your environment: Fortran C Toolbox

This chapter is concerned with methods for smoothing data. Included are methods for density estimation, smoothing time series data, and statistical applications of splines. These methods may also be viewed as nonparametric modelling.

G11 – Contingency Table Analysis

Full details of this chapter for your environment: Fortran C Toolbox

The routines in this chapter are for the analysis of discrete multivariate data. One suite of routines computes tables while other routines are for the analysis of two-way contingency tables, conditional logistic models and one-factor analysis of binary data.

Routines in Chapter G02 may be used to fit generalized linear models to discrete data including binary data and contingency tables.

G12 – Survival Analysis

Full details of this chapter for your environment: Fortran C Toolbox

This chapter is concerned with statistical techniques used in the analysis of survival/reliability/failure time data.

Other chapters contain routines which are also used to analyse this type of data. Chapter G02 contains generalized linear models, Chapter G07 contains routines to fit distribution models, and Chapter G08 contains rank based methods.

G13 – Time Series Analysis

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter provides facilities for investigating and modelling the statistical structure of series of observations collected at points in time. The models may then be used to forecast the series.

The chapter covers the following models and approaches.

G22 – Linear Model Specification

Full details of this chapter for your environment: Fortran C

The routines in this chapter provide a mechanism for specifying a linear model using a text based modelling language and are intended to be used in conjunction with the model fitting routines from other chapters, for example Chapter G02.

H – Operations Research

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter provides routines to solve certain integer programming, transportation and shortest path problems. Additionally 'best subset' routines are included.

M01 – Sorting and Searching

Full details of this chapter for your environment: Fortran C Toolbox

This chapter is concerned with sorting and searching numeric or character data. It handles only the simplest types of data structure and it is concerned only with internal sorting and searching – that is, sorting and searching a set of data which can all be stored within the program.

If you have large files of data or complicated data structures to be sorted or searched you should use a comprehensive sorting or searching program or package.

S – Approximations of Special Functions

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter is concerned with the provision of some commonly occurring physical and mathematical functions.

X01 – Mathematical Constants

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter is concerned with the provision of mathematical constants required by other routines within the .

X02 – Machine Constants

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter is concerned with parameters which characterise certain aspects of the computing environment in which the NAG Library is implemented. They relate primarily to floating-point arithmetic, but also to integer arithmetic, the elementary functions and exception handling. The values of the parameters vary from one implementation of the to another, but within the context of a single implementation they are constants.

The parameters are intended for use primarily by other routines in the , but users of the may sometimes need to refer to them directly.

X03 – Inner Products

Full details of this chapter for your environment: Fortran Toolbox

This chapter is concerned with the calculation of innerproducts required by other routines within the .

X04 – Input/Output Utilities

Full details of this chapter for your environment: Fortran C Toolbox .NET

This chapter contains utility routines concerned with input and output to or from an external file.

X05 – Date and Time Utilities

Full details of this chapter for your environment: Fortran Toolbox

This chapter provides routines to obtain the current real time, and the amount of processor time used.

X06 – OpenMP Utilities

Full details of this chapter for your environment: Fortran C Toolbox

This chapter contains utilities for controlling the OpenMP environment for your program. They are based on OpenMP runtime library routines, although their functionality varies slightly.

X07 – IEEE Arithmetic

Full details of this chapter for your environment: Fortran C

This chapter provides routines to handle various aspects of IEEE floating-point arithmetic behaviour.

X10 – Automatic Differentiation Utilities

Full details of this chapter for your environment: Fortran

This chapter is concerned with utility operations used in conjunction with the . Details specific to the can be found in the NAG AD Library Introductuction'.

All routines in the have, as first argument in their interfaces, a handle to a configuration data object which is consistently named throughout the as ad_handle. This argument stores configuration details used in the calculation of algorithmic derivatives. Further details and examples on the use of ad_handle can be found in the NAG AD Library Introductuction'. Chapter X10 provides facilities for:


Routine Summaries

A00 – Library Identification

Examples of routines and methods in this chapter:

a00aa nagf_info_impl_details
Library identification, details of implementation and mark
a00ac nagf_info_licence
Check availability of a valid licence key
a00ad nagf_info_impl_details_separate
Library identification, details of implementation, major and minor marks
Back to A00 Chapter Summary

A02 – Complex Arithmetic

Examples of routines and methods in this chapter:

a02aa nagf_complex_sqrt
Square root of complex number
a02ab nagf_complex_abs
Modulus of complex number
a02ac nagf_complex_divide
Quotient of two complex numbers
Back to A02 Chapter Summary

C02 – Zeros of Polynomials

Examples of routines and methods in this chapter:

c02af nagf_zeros_poly_complex
All zeros of complex polynomial, modified Laguerre's method
c02ag nagf_zeros_poly_real
All zeros of real polynomial, modified Laguerre's method
c02ah nagf_zeros_quadratic_complex
All zeros of complex quadratic equation
c02aj nagf_zeros_quadratic_real
All zeros of real quadratic equation
c02ak nagf_zeros_cubic_real
All zeros of real cubic equation
c02al nagf_zeros_quartic_real
All zeros of real quartic equation
c02am nagf_zeros_cubic_complex
All zeros of complex cubic equation
c02an nagf_zeros_quartic_complex
All zeros of complex quartic equation
Back to C02 Chapter Summary

C05 – Roots of One or More Transcendental Equations

Examples of routines and methods in this chapter:

c05au nagf_roots_contfn_brent_interval
Zero of continuous function, Brent algorithm, from a given starting value, binary search for interval
c05av nagf_roots_contfn_interval_rcomm
Binary search for interval containing zero of continuous function (reverse communication)
c05aw nagf_roots_contfn_cntin
Zero of continuous function, continuation method, from a given starting value
c05ax nagf_roots_contfn_cntin_rcomm
Zero of continuous function, continuation method, from a given starting value (reverse communication)
c05ay nagf_roots_contfn_brent
Zero of continuous function in a given interval, Brent algorithm
c05az nagf_roots_contfn_brent_rcomm
Zero of continuous function in a given interval, Brent algorithm (reverse communication)
c05ba nagf_roots_lambertw_real
Real values of Lambert's W function, W(x)
c05bb nagf_roots_lambertw_complex
Values of Lambert's W function, W(z)
c05md nagf_roots_sys_func_aa_rcomm
Solution of a system of nonlinear equations using Anderson acceleration (reverse communication)
c05qb nagf_roots_sys_func_easy
Solution of a system of nonlinear equations using function values only (easy-to-use)
c05qc nagf_roots_sys_func_expert
Solution of a system of nonlinear equations using function values only (comprehensive)
c05qd nagf_roots_sys_func_rcomm
Solution of a system of nonlinear equations using function values only (reverse communication)
c05qs nagf_roots_sparsys_func_easy
Solution of a sparse system of nonlinear equations using function values only (easy-to-use)
c05rb nagf_roots_sys_deriv_easy
Solution of a system of nonlinear equations using first derivatives (easy-to-use)
c05rc nagf_roots_sys_deriv_expert
Solution of a system of nonlinear equations using first derivatives (comprehensive)
c05rd nagf_roots_sys_deriv_rcomm
Solution of a system of nonlinear equations using first derivatives (reverse communication)
c05zd nagf_roots_sys_deriv_check
Check user's routine for calculating first derivatives of a set of nonlinear functions of several variables
Back to C05 Chapter Summary

C06 – Summation of Series

Examples of routines and methods in this chapter:

c06ba nagf_sum_accelerate
Acceleration of convergence of sequence, Shanks' transformation and epsilon algorithm
c06dc nagf_sum_chebyshev
Sum of a Chebyshev series at a set of points
c06fa nagf_sum_fft_real_1d_rfmt
Single one-dimensional real discrete Fourier transform, extra workspace for greater speed
c06fb nagf_sum_fft_hermitian_1d_rfmt
Single one-dimensional Hermitian discrete Fourier transform, extra workspace for greater speed
c06fc nagf_sum_fft_complex_1d_sep
Single one-dimensional complex discrete Fourier transform, extra workspace for greater speed
c06ff nagf_sum_fft_complex_multid_1d_sep
One-dimensional complex discrete Fourier transform of multidimensional data
c06fj nagf_sum_fft_complex_multid_sep
Multidimensional complex discrete Fourier transform of multidimensional data
c06fk nagf_sum_convcorr_real
Circular convolution or correlation of two real vectors, no restrictions on n
c06fx nagf_sum_fft_complex_3d_sep
Three-dimensional complex discrete Fourier transform
c06la nagf_sum_invlaplace_crump
Inverse Laplace transform, Crump's method
c06lb nagf_sum_invlaplace_weeks
Inverse Laplace transform, modified Weeks' method
c06lc nagf_sum_invlaplace_weeks_eval
Evaluate inverse Laplace transform as computed by c06lb
c06pa nagf_sum_fft_realherm_1d
Single one-dimensional real and Hermitian complex discrete Fourier transform, using complex storage format for Hermitian sequences
c06pc nagf_sum_fft_complex_1d
Single one-dimensional complex discrete Fourier transform, complex data type
c06pf nagf_sum_fft_complex_multid_1d
One-dimensional complex discrete Fourier transform of multidimensional data (using complex data type)
c06pj nagf_sum_fft_complex_multid
Multidimensional complex discrete Fourier transform of multidimensional data (using complex data type)
c06pk nagf_sum_convcorr_complex
Circular convolution or correlation of two complex vectors
c06pp nagf_sum_fft_realherm_1d_multi_row
Multiple one-dimensional real and Hermitian complex discrete Fourier transforms, using row ordered complex storage format for Hermitian sequences
c06pq nagf_sum_fft_realherm_1d_multi_col
Multiple one-dimensional real and Hermitian complex discrete Fourier transforms, using column ordered complex storage format for Hermitian sequences
c06pr nagf_sum_fft_complex_1d_multi_row
Multiple one-dimensional complex discrete Fourier transforms using complex data type
c06ps nagf_sum_fft_complex_1d_multi_col
Multiple one-dimensional complex discrete Fourier transforms, complex data type
c06pu nagf_sum_fft_complex_2d
Two-dimensional complex discrete Fourier transform, complex data type
c06pv nagf_sum_fft_real_2d
Two-dimensional real-to-complex discrete Fourier transform
c06pw nagf_sum_fft_hermitian_2d
Two-dimensional complex-to-real discrete Fourier transform
c06px nagf_sum_fft_complex_3d
Three-dimensional complex discrete Fourier transform, complex data type
c06py nagf_sum_fft_real_3d
Three-dimensional real-to-complex discrete Fourier transform
c06pz nagf_sum_fft_hermitian_3d
Three-dimensional complex-to-real discrete Fourier transform
c06ra nagf_sum_fft_real_sine_simple
Discrete sine transform (easy-to-use)
c06rb nagf_sum_fft_real_cosine_simple
Discrete cosine transform (easy-to-use)
c06rc nagf_sum_fft_real_qtrsine_simple
Discrete quarter-wave sine transform (easy-to-use)
c06rd nagf_sum_fft_real_qtrcosine_simple
Discrete quarter-wave cosine transform (easy-to-use)
c06re nagf_sum_fft_sine
Multiple discrete sine transforms, simple
c06rf nagf_sum_fft_cosine
Multiple discrete cosine transforms, simple
c06rg nagf_sum_fft_qtrsine
Multiple discrete quarter-wave sine transforms, simple
c06rh nagf_sum_fft_qtrcosine
Multiple discrete quarter-wave cosine transforms, simple
c06sa nagf_sum_fast_gauss
Multidimensional fast Gauss transform
Back to C06 Chapter Summary

C09 – Wavelet Transforms

Examples of routines and methods in this chapter:

c09aa nagf_wav_1d_init
One-dimensional wavelet filter initialization
c09ab nagf_wav_2d_init
Two-dimensional wavelet filter initialization
c09ac nagf_wav_3d_init
Three-dimensional wavelet filter initialization
c09ba nagf_wav_1d_cont
One-dimensional real continuous wavelet transform
c09ca nagf_wav_1d_sngl_fwd
One-dimensional discrete wavelet transform
c09cb nagf_wav_1d_sngl_inv
One-dimensional inverse discrete wavelet transform
c09cc nagf_wav_1d_multi_fwd
One-dimensional multi-level discrete wavelet transform
c09cd nagf_wav_1d_multi_inv
One-dimensional inverse multi-level discrete wavelet transform
c09da nagf_wav_1d_mxolap_fwd
One-dimensional maximal overlap discrete wavelet transform (MODWT)
c09db nagf_wav_1d_mxolap_inv
One-dimensional inverse maximal overlap discrete wavelet transform (IMODWT)
c09dc nagf_wav_1d_mxolap_multi_fwd
One-dimensional multi-level maximal overlap discrete wavelet transform (MODWT)
c09dd nagf_wav_1d_mxolap_multi_inv
One-dimensional inverse multi-level maximal overlap discrete wavelet transform (IMODWT)
c09ea nagf_wav_2d_sngl_fwd
Two-dimensional discrete wavelet transform
c09eb nagf_wav_2d_sngl_inv
Two-dimensional inverse discrete wavelet transform
c09ec nagf_wav_2d_multi_fwd
Two-dimensional multi-level discrete wavelet transform
c09ed nagf_wav_2d_multi_inv
Two-dimensional inverse multi-level discrete wavelet transform
c09ey nagf_wav_2d_coeff_ext
Two-dimensional discrete wavelet transform coefficient extraction
c09ez nagf_wav_2d_coeff_ins
Two-dimensional discrete wavelet transform coefficient insertion
c09fa nagf_wav_3d_sngl_fwd
Three-dimensional discrete wavelet transform
c09fb nagf_wav_3d_sngl_inv
Three-dimensional inverse discrete wavelet transform
c09fc nagf_wav_3d_multi_fwd
Three-dimensional multi-level discrete wavelet transform
c09fd nagf_wav_3d_mxolap_multi_inv
Three-dimensional inverse multi-level discrete wavelet transform
c09fy nagf_wav_3d_coeff_ext
Three-dimensional discrete wavelet transform coefficient extraction
c09fz nagf_wav_3d_coeff_ins
Three-dimensional discrete wavelet transform coefficient insertion
Back to C09 Chapter Summary

D01 – Quadrature

Examples of routines and methods in this chapter:

d01ah nagf_quad_1d_fin_well
One-dimensional quadrature, adaptive, finite interval, strategy due to Patterson, suitable for well-behaved integrands
d01aj nagf_quad_1d_fin_bad
One-dimensional quadrature, adaptive, finite interval, strategy due to Piessens and de Doncker, allowing for badly behaved integrands
d01ak nagf_quad_1d_fin_osc
One-dimensional quadrature, adaptive, finite interval, method suitable for oscillating functions
d01al nagf_quad_1d_fin_sing
One-dimensional quadrature, adaptive, finite interval, allowing for singularities at user-specified break-points
d01am nagf_quad_1d_inf
One-dimensional quadrature, adaptive, infinite or semi-infinite interval
d01an nagf_quad_1d_fin_wtrig
One-dimensional quadrature, adaptive, finite interval, weight function cos (ωx) or sin (ωx)
d01ap nagf_quad_1d_fin_wsing
One-dimensional quadrature, adaptive, finite interval, weight function with end-point singularities of algebraico-logarithmic type
d01aq nagf_quad_1d_fin_wcauchy
One-dimensional quadrature, adaptive, finite interval, weight function 1/(x-c), Cauchy principal value (Hilbert transform)
d01ar nagf_quad_1d_indef
One-dimensional quadrature, non-adaptive, finite interval with provision for indefinite integrals
d01as nagf_quad_1d_inf_wtrig
One-dimensional quadrature, adaptive, semi-infinite interval, weight function cos (ωx) or sin (ωx)
d01at nagf_quad_1d_fin_bad_vec
One-dimensional quadrature, adaptive, finite interval, variant of d01aj efficient on vector machines
d01au nagf_quad_1d_fin_osc_vec
One-dimensional quadrature, adaptive, finite interval, variant of d01ak efficient on vector machines
d01bc nagf_quad_1d_gauss_wgen
Calculation of weights and abscissae for Gaussian quadrature rules, general choice of rule
d01bd nagf_quad_1d_fin_smooth
One-dimensional quadrature, non-adaptive, finite interval
d01da nagf_quad_2d_fin
Two-dimensional quadrature, finite region
d01ea nagf_quad_md_adapt_multi
Multidimensional adaptive quadrature over hyper-rectangle, multiple integrands
d01es nagf_quad_md_sgq_multi_vec
Multi-dimensional quadrature using sparse grids
d01fb nagf_quad_md_gauss
Multidimensional Gaussian quadrature over hyper-rectangle
d01fc nagf_quad_md_adapt
Multidimensional adaptive quadrature over hyper-rectangle
d01fd nagf_quad_md_sphere
Multidimensional quadrature, Sag–Szekeres method, general product region or n-sphere
d01fd nagf_quad_md_sphere_dummy_region
dummy
d01ga nagf_quad_1d_data
One-dimensional quadrature, integration of function defined by data values, Gill–Miller method
d01gb nagf_quad_md_mcarlo
Multidimensional quadrature over hyper-rectangle, Monte–Carlo method
d01gc nagf_quad_md_numth
Multidimensional quadrature, general product region, number-theoretic method
d01gd nagf_quad_md_numth_vec
Multidimensional quadrature, general product region, number-theoretic method, variant of d01gc efficient on vector machines
d01gy nagf_quad_md_numth_coeff_prime
Korobov optimal coefficients for use in d01gc or d01gd, when number of points is prime
d01gz nagf_quad_md_numth_coeff_2prime
Korobov optimal coefficients for use in d01gc or d01gd, when number of points is product of two primes
d01ja nagf_quad_md_sphere_bad
Multidimensional quadrature over an n-sphere, allowing for badly behaved integrands
d01pa nagf_quad_md_simplex
Multidimensional quadrature over an n-simplex
d01ra nagf_quad_1d_gen_vec_multi_rcomm
One-dimensional quadrature, adaptive, finite interval, multiple integrands, vectorized abscissae, reverse communication
d01rb nagf_quad_d01rb_dummy
d01rc nagf_quad_1d_gen_vec_multi_dimreq
Determine required array dimensions for d01ra
d01rg nagf_quad_1d_fin_gonnet_vec
One-dimensional quadrature, adaptive, finite interval, strategy due to Gonnet, allowing for badly behaved integrands
d01tb nagf_quad_1d_gauss_wres
Pre-computed weights and abscissae for Gaussian quadrature rules, restricted choice of rule
d01td nagf_quad_1d_gauss_wrec
Calculation of weights and abscissae for Gaussian quadrature rules, method of Golub and Welsch
d01te nagf_quad_1d_gauss_recm
Generates recursion coefficients needed by d01td to calculate a Gaussian quadrature rule
d01ua nagf_quad_1d_gauss_vec
One-dimensional Gaussian quadrature, choice of weight functions (vectorized)
d01ub nagf_quad_1d_inf_exp_wt
Non-automatic routine to evaluate 0exp (-x2)f(x) dx
d01zk nagf_quad_opt_set
Option setting routine
d01zl nagf_quad_opt_get
Option getting routine
Back to D01 Chapter Summary

D02 – Ordinary Differential Equations Integrators for Stiff Ordinary Differential Systems

Examples of routines and methods in this chapter:

d02ag nagf_ode_bvp_shoot_genpar_intern
Ordinary differential equations, boundary value problem, shooting and matching technique, allowing interior matching point, general parameters to be determined
d02bg nagf_ode_ivp_rkm_val_simple
Ordinary differential equations, initial value problem, Runge–Kutta–Merson method, until a component attains given value (simple driver)
d02bh nagf_ode_ivp_rkm_zero_simple
Ordinary differential equations, initial value problem, Runge–Kutta–Merson method, until function of solution is zero (simple driver)
d02bj nagf_ode_ivp_rk_zero_simple
Ordinary differential equations, initial value problem, Runge–Kutta method, until function of solution is zero, integration over range with intermediate output (simple driver)
d02cj nagf_ode_ivp_adams_zero_simple
Ordinary differential equations, initial value problem, Adams' method, until function of solution is zero, intermediate output (simple driver)
d02ej nagf_ode_ivp_bdf_zero_simple
Ordinary differential equations, stiff initial value problem, backward differentiation formulae method, until function of solution is zero, intermediate output (simple driver)
d02ga nagf_ode_bvp_fd_nonlin_fixedbc
Ordinary differential equations, boundary value problem, finite difference technique with deferred correction, simple nonlinear problem
d02ga nagf_ode_bvp_fd_nonlin_gen_dummy_jacobf
dummy
d02ga nagf_ode_bvp_fd_nonlin_gen_dummy_jacobg
dummy
d02ga nagf_ode_bvp_fd_nonlin_gen_dummy_jaceps
dummy
d02ga nagf_ode_bvp_fd_nonlin_gen_dummy_jacgep
dummy
d02gb nagf_ode_bvp_fd_lin_gen
Ordinary differential equations, boundary value problem, finite difference technique with deferred correction, general linear problem
d02ha nagf_ode_bvp_shoot_bval
Ordinary differential equations, boundary value problem, shooting and matching, boundary values to be determined
d02hb nagf_ode_bvp_shoot_genpar
Ordinary differential equations, boundary value problem, shooting and matching, general parameters to be determined
d02hb nagf_ode_bvp_shoot_genpar_algeq_dummy_prsol
dummy
d02hb nagf_ode_bvp_shoot_genpar_algeq_dummy_eqn
dummy
d02ja nagf_ode_bvp_coll_nth
Ordinary differential equations, boundary value problem, collocation and least squares, single nth-order linear equation
d02jb nagf_ode_bvp_coll_sys
Ordinary differential equations, boundary value problem, collocation and least squares, system of first-order linear equations
d02ka nagf_ode_sl2_reg_finite
Second-order Sturm–Liouville problem, regular system, finite range, eigenvalue only
d02ka nagf_ode_sl2_reg_finite_dummy_monit
dummy
d02kd nagf_ode_sl2_breaks_vals
Second-order Sturm–Liouville problem, regular/singular system, finite/infinite range, eigenvalue only, user-specified break-points
d02ke nagf_ode_sl2_breaks_funs
Second-order Sturm–Liouville problem, regular/singular system, finite/infinite range, eigenvalue and eigenfunction, user-specified break-points
d02la nagf_ode_ivp_2nd_rkn
Second-order ordinary differential equations, initial value problem, Runge–Kutta–Nystrom method
d02lx nagf_ode_ivp_2nd_rkn_setup
Second-order ordinary differential equations, initial value problem, setup for d02la
d02ly nagf_ode_ivp_2nd_rkn_diag
Second-order ordinary differential equations, initial value problem, diagnostics for d02la
d02lz nagf_ode_ivp_2nd_rkn_interp
Second-order ordinary differential equations, initial value problem, interpolation for d02la
d02mc nagf_ode_dae_dassl_cont
Implicit ordinary differential equations/DAEs, initial value problem, DASSL method continuation for d02ne
d02mv nagf_ode_ivp_stiff_dassl
Ordinary differential equations, initial value problem, DASSL method, setup for d02m–n routines
d02mw nagf_ode_dae_dassl_setup
Implicit ordinary differential equations/DAEs, initial value problem, setup for d02ne
d02mz nagf_ode_ivp_stiff_interp
Ordinary differential equations, initial value problem, interpolation for d02m–n routines (all integration methods), natural interpolant
d02nb nagf_ode_ivp_stiff_exp_fulljac
Explicit ordinary differential equations, stiff initial value problem, full Jacobian (comprehensive)
d02nb nagf_ode_ivp_stiff_exp_fulljac_dummy_monit
dummy
d02nb nagf_ode_ivp_stiff_exp_fulljac_dummy_jac
dummy
d02nc nagf_ode_ivp_stiff_exp_bandjac
Explicit ordinary differential equations, stiff initial value problem, banded Jacobian (comprehensive)
d02nc nagf_ode_ivp_stiff_exp_bandjac_dummy_jac
dummy
d02nd nagf_ode_ivp_stiff_exp_sparjac
Explicit ordinary differential equations, stiff initial value problem, sparse Jacobian (comprehensive)
d02nd nagf_ode_ivp_stiff_exp_sparjac_dummy_jac
dummy
d02ne nagf_ode_dae_dassl_gen
Implicit ordinary differential equations/DAEs, initial value problem, DASSL method integrator
d02ne nagf_ode_dae_dassl_gen_dummy_jac
dummy
d02ng nagf_ode_ivp_stiff_imp_fulljac
Implicit/algebraic ordinary differential equations, stiff initial value problem, full Jacobian (comprehensive)
d02ng nagf_ode_ivp_stiff_imp_fulljac_dummy_jac
dummy
d02nh nagf_ode_ivp_stiff_imp_bandjac
Implicit/algebraic ordinary differential equations, stiff initial value problem, banded Jacobian (comprehensive)
d02nh nagf_ode_ivp_stiff_imp_bandjac_dummy_jac
dummy
d02nj nagf_ode_ivp_stiff_imp_sparjac
Implicit/algebraic ordinary differential equations, stiff initial value problem, sparse Jacobian (comprehensive)
d02nj nagf_ode_ivp_stiff_imp_sparjac_dummy_jac
dummy
d02nm nagf_ode_ivp_stiff_exp_revcom
Explicit ordinary differential equations, stiff initial value problem (reverse communication, comprehensive)
d02nn nagf_ode_ivp_stiff_imp_revcom
Implicit/algebraic ordinary differential equations, stiff initial value problem (reverse communication, comprehensive)
d02np nagf_ode_dae_dassl_linalg
Implicit ordinary differential equations/DAEs, initial value problem linear algebra setup routine for d02ne
d02nr nagf_ode_ivp_stiff_sparjac_enq
Ordinary differential equations, initial value problem, for use with d02m–n routines, sparse Jacobian, enquiry routine
d02ns nagf_ode_ivp_stiff_fulljac_setup
Ordinary differential equations, initial value problem, for use with d02m–n routines, full Jacobian, linear algebra set up
d02nt nagf_ode_ivp_stiff_bandjac_setup
Ordinary differential equations, initial value problem, for use with d02m–n routines, banded Jacobian, linear algebra set up
d02nu nagf_ode_ivp_stiff_sparjac_setup
Ordinary differential equations, initial value problem, for use with d02m–n routines, sparse Jacobian, linear algebra set up
d02nv nagf_ode_ivp_stiff_bdf
Ordinary differential equations, initial value problem, backward differentiation formulae method, setup for d02m–n routines
d02nw nagf_ode_ivp_stiff_blend
Ordinary differential equations, initial value problem, Blend method, setup for d02m–n routines
d02nx nagf_ode_ivp_stiff_sparjac_diag
Ordinary differential equations, initial value problem, sparse Jacobian, linear algebra diagnostics, for use with d02m–n routines
d02ny nagf_ode_ivp_stiff_integ_diag
Ordinary differential equations, initial value problem, integrator diagnostics, for use with d02m–n routines
d02nz nagf_ode_ivp_stiff_contin
Ordinary differential equations, initial value problem, setup for continuation calls to integrator, for use with d02m–n routines
d02pe nagf_ode_ivp_rkts_range
Ordinary differential equations, initial value problem, Runge–Kutta method, integration over range with output
d02pf nagf_ode_ivp_rkts_onestep
Ordinary differential equations, initial value problem, Runge–Kutta method, integration over one step
d02pg nagf_ode_ivp_rk_step_revcomm
Ordinary differential equations, initial value problem, Runge–Kutta method, integration by reverse communication
d02ph nagf_ode_ivp_rk_interp_setup
Set up interpolant by reverse communication for solution and derivative evaluations at points within the range of the last integration step taken by d02pg
d02pj nagf_ode_ivp_rk_interp_eval
Evaluate interpolant, set up using d02pq, to approximate solution and/or solution derivatives at a point within the range of the last integration step taken by d02pg
d02pq nagf_ode_ivp_rkts_setup
Ordinary differential equations, initial value problem, setup for d02pe and d02pf
d02pr nagf_ode_ivp_rkts_reset_tend
Ordinary differential equations, initial value problem, resets end of range for d02pf
d02ps nagf_ode_ivp_rkts_interp
Ordinary differential equations, initial value problem, interpolation for d02pf
d02pt nagf_ode_ivp_rkts_diag
Ordinary differential equations, initial value problem, integration diagnostics for d02pe and d02pf
d02pu nagf_ode_ivp_rkts_errass
Ordinary differential equations, initial value problem, error assessment diagnostics for d02pe and d02pf
d02qf nagf_ode_ivp_adams_roots
Ordinary differential equations, initial value problem, Adams' method with root-finding (direct communication, comprehensive)
d02qg nagf_ode_ivp_adams_roots_revcom
Ordinary differential equations, initial value problem, Adams' method with root-finding (reverse communication, comprehensive)
d02qw nagf_ode_ivp_adams_setup
Ordinary differential equations, initial value problem, setup for d02qf and d02qg
d02qx nagf_ode_ivp_adams_diag
Ordinary differential equations, initial value problem, diagnostics for d02qf and d02qg
d02qy nagf_ode_ivp_adams_rootdiag
Ordinary differential equations, initial value problem, root-finding diagnostics for d02qf and d02qg
d02qz nagf_ode_ivp_adams_interp
Ordinary differential equations, initial value problem, interpolation for d02qf or d02qg
d02ra nagf_ode_bvp_fd_nonlin_gen
Ordinary differential equations, general nonlinear boundary value problem, finite difference technique with deferred correction, continuation facility
d02sa nagf_ode_bvp_shoot_genpar_algeq
Ordinary differential equations, boundary value problem, shooting and matching technique, subject to extra algebraic equations, general parameters to be determined
d02sa nagf_ode_bvp_shoot_genpar_algeq_dummy_monit
dummy
d02tg nagf_ode_bvp_coll_nth_comp
nth-order linear ordinary differential equations, boundary value problem, collocation and least squares
d02tl nagf_ode_bvp_coll_nlin_solve
Ordinary differential equations, general nonlinear boundary value problem, collocation technique (thread safe)
d02tv nagf_ode_bvp_coll_nlin_setup
Ordinary differential equations, general nonlinear boundary value problem, setup for d02tl
d02tx nagf_ode_bvp_coll_nlin_contin
Ordinary differential equations, general nonlinear boundary value problem, continuation facility for d02tl
d02ty nagf_ode_bvp_coll_nlin_interp
Ordinary differential equations, general nonlinear boundary value problem, interpolation for d02tl
d02tz nagf_ode_bvp_coll_nlin_diag
Ordinary differential equations, general nonlinear boundary value problem, diagnostics for d02tl
d02ua nagf_ode_bvp_ps_lin_coeffs
Coefficients of Chebyshev interpolating polynomial from function values on Chebyshev grid
d02ub nagf_ode_bvp_ps_lin_cgl_vals
Function or low-order-derivative values on Chebyshev grid from coefficients of Chebyshev interpolating polynomial
d02uc nagf_ode_bvp_ps_lin_cgl_grid
Chebyshev Gauss–Lobatto grid generation
d02ud nagf_ode_bvp_ps_lin_cgl_deriv
Differentiate a function by the FFT using function values on Chebyshev grid
d02ue nagf_ode_bvp_ps_lin_solve
Solve linear constant coefficient boundary value problem on Chebyshev grid, Integral formulation
d02uw nagf_ode_bvp_ps_lin_grid_vals
Interpolate a function from Chebyshev grid to uniform grid using barycentric Lagrange interpolation
d02uy nagf_ode_bvp_ps_lin_quad_weights
Clenshaw–Curtis quadrature weights for integration using computed Chebyshev coefficients
d02uz nagf_ode_bvp_ps_lin_cheb_eval
Chebyshev polynomial evaluation, Tk(x)
d02xj nagf_ode_ivp_stiff_nat_interp
Ordinary differential equations, initial value problem, interpolation for d02m–n routines (BLEND and BDF methods only), natural interpolant
d02xk nagf_ode_ivp_stiff_c1_interp
Ordinary differential equations, initial value problem, interpolation for d02m–n routines, C1 interpolant
d02za nagf_ode_ivp_stiff_errest
Ordinary differential equations, initial value problem, weighted norm of local error estimate for d02m–n routines
Back to D02 Chapter Summary

D03 – Partial Differential Equations

Examples of routines and methods in this chapter:

d03ea nagf_pde_2d_laplace
Elliptic PDE, Laplace's equation, two-dimensional arbitrary domain
d03eb nagf_pde_2d_ellip_fd
Elliptic PDE, solution of finite difference equations by SIP, five-point two-dimensional molecule, iterate to convergence
d03ec nagf_pde_3d_ellip_fd
Elliptic PDE, solution of finite difference equations by SIP for seven-point three-dimensional molecule, iterate to convergence
d03ed nagf_pde_2d_ellip_mgrid
Elliptic PDE, solution of finite difference equations by a multigrid technique
d03ee nagf_pde_2d_ellip_discret
Discretize a second-order elliptic PDE on a rectangle
d03fa nagf_pde_3d_ellip_helmholtz
Elliptic PDE, Helmholtz equation, three-dimensional Cartesian coordinates
d03ma nagf_pde_2d_triangulate
Triangulation of plane region
d03nc nagf_pde_1d_blackscholes_fd
Finite difference solution of the Black–Scholes equations
d03nd nagf_pde_1d_blackscholes_closed
Analytic solution of the Black–Scholes equations
d03ne nagf_pde_1d_blackscholes_means
Compute average values for d03nd
d03pc nagf_pde_1d_parab_fd_old
General system of parabolic PDEs, method of lines, finite differences, one space variable
d03pc nagf_pde_1d_parab_remesh_fd_dummy_odedef_old
dummy
d03pc nagf_pde_1d_parab_remesh_fd_dummy_monitf_old
dummy
d03pd nagf_pde_1d_parab_coll_old
General system of parabolic PDEs, method of lines, Chebyshev C0 collocation, one space variable
d03pe nagf_pde_1d_parab_keller
General system of first-order PDEs, method of lines, Keller box discretization, one space variable
d03pe nagf_pde_1d_parab_dae_keller_remesh_fd_dummy_odedef
dummy
d03pe nagf_pde_1d_parab_dae_keller_remesh_fd_dummy_monitf
dummy
d03pf nagf_pde_1d_parab_convdiff
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
d03ph nagf_pde_1d_parab_dae_fd_old
General system of parabolic PDEs, coupled DAEs, method of lines, finite differences, one space variable
d03pj nagf_pde_1d_parab_dae_coll_old
General system of parabolic PDEs, coupled DAEs, method of lines, Chebyshev C0 collocation, one space variable
d03pk nagf_pde_1d_parab_dae_keller
General system of first-order PDEs, coupled DAEs, method of lines, Keller box discretization, one space variable
d03pl nagf_pde_1d_parab_convdiff_dae
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
d03pp nagf_pde_1d_parab_remesh_fd_old
General system of parabolic PDEs, coupled DAEs, method of lines, finite differences, remeshing, one space variable
d03pr nagf_pde_1d_parab_remesh_keller
General system of first-order PDEs, coupled DAEs, method of lines, Keller box discretization, remeshing, one space variable
d03ps nagf_pde_1d_parab_convdiff_remesh
General system of convection-diffusion PDEs, coupled DAEs, method of lines, upwind scheme, remeshing, one space variable
d03pu nagf_pde_1d_parab_euler_roe
Roe's approximate Riemann solver for Euler equations in conservative form, for use with d03pf, d03pl and d03ps
d03pv nagf_pde_1d_parab_euler_osher
Osher's approximate Riemann solver for Euler equations in conservative form, for use with d03pf, d03pl and d03ps
d03pw nagf_pde_1d_parab_euler_hll
Modified HLL Riemann solver for Euler equations in conservative form, for use with d03pf, d03pl and d03ps
d03px nagf_pde_1d_parab_euler_exact
Exact Riemann solver for Euler equations in conservative form, for use with d03pf, d03pl and d03ps
d03py nagf_pde_1d_parab_coll_interp
PDEs, spatial interpolation with d03pd or d03pj
d03pz nagf_pde_1d_parab_fd_interp
PDEs, spatial interpolation with d03pc, d03pe, d03pf, d03ph, d03pk, d03pl, d03pp, d03pr or d03ps
d03ra nagf_pde_2d_gen_order2_rectangle
General system of second-order PDEs, method of lines, finite differences, remeshing, two space variables, rectangular region
d03rb nagf_pde_2d_gen_order2_rectilinear
General system of second-order PDEs, method of lines, finite differences, remeshing, two space variables, rectilinear region
d03rz nagf_pde_2d_gen_order2_rectilinear_extractgrid
Extract grid data from d03rb
d03ua nagf_pde_2d_ellip_fd_iter
Elliptic PDE, solution of finite difference equations by SIP, five-point two-dimensional molecule, one iteration
d03ub nagf_pde_3d_ellip_fd_iter
Elliptic PDE, solution of finite difference equations by SIP, seven-point three-dimensional molecule, one iteration
Back to D03 Chapter Summary

D04 – Numerical Differentiation

Examples of routines and methods in this chapter:

d04aa nagf_numdiff_fwd
Numerical differentiation, derivatives up to order 14, function of one real variable
d04ba nagf_numdiff_rcomm
Numerical differentiation, user-supplied function values, derivatives up to order 14, derivatives with respect to one real variable
d04bb nagf_numdiff_sample
Generates sample points for function evaluations by d04ba
Back to D04 Chapter Summary

D05 – Integral Equations

Examples of routines and methods in this chapter:

d05aa nagf_inteq_fredholm2_split
Linear nonsingular Fredholm integral equation, second kind, split kernel
d05ab nagf_inteq_fredholm2_smooth
Linear nonsingular Fredholm integral equation, second kind, smooth kernel
d05ba nagf_inteq_volterra2
Nonlinear Volterra convolution equation, second kind
d05bd nagf_inteq_abel2_weak
Nonlinear convolution Volterra–Abel equation, second kind, weakly singular
d05be nagf_inteq_abel1_weak
Nonlinear convolution Volterra–Abel equation, first kind, weakly singular
d05bw nagf_inteq_volterra_weights
Generate weights for use in solving Volterra equations
d05by nagf_inteq_abel_weak_weights
Generate weights for use in solving weakly singular Abel-type equations
Back to D05 Chapter Summary

D06 – Mesh Generation

Examples of routines and methods in this chapter:

d06aa nagf_mesh_2d_gen_inc
Generates a two-dimensional mesh using a simple incremental method
d06ab nagf_mesh_2d_gen_delaunay
Generates a two-dimensional mesh using a Delaunay–Voronoi process
d06ac nagf_mesh_2d_gen_front
Generates a two-dimensional mesh using an Advancing-front method
d06ba nagf_mesh_2d_gen_boundary
Generates a boundary mesh
d06ca nagf_mesh_2d_smooth_bary
Uses a barycentering technique to smooth a given mesh
d06cb nagf_mesh_2d_sparsity
Generates a sparsity pattern of a Finite Element matrix associated with a given mesh
d06cc nagf_mesh_2d_renumber
Renumbers a given mesh using Gibbs method
d06da nagf_mesh_2d_transform_affine
Generates a mesh resulting from an affine transformation of a given mesh
d06db nagf_mesh_2d_join
Joins together two given adjacent (possibly overlapping) meshes
Back to D06 Chapter Summary

E01 – Interpolation

Examples of routines and methods in this chapter:

e01aa nagf_interp_dim1_aitken
Interpolated values, Aitken's technique, unequally spaced data, one variable
e01ab nagf_interp_dim1_everett
Interpolated values, Everett's formula, equally spaced data, one variable
e01ae nagf_interp_dim1_cheb
Interpolating functions, polynomial interpolant, data may include derivative values, one variable
e01ba nagf_interp_dim1_spline
Interpolating functions, cubic spline interpolant, one variable
e01be nagf_interp_dim1_monotonic
Interpolating functions, monotonicity-preserving, piecewise cubic Hermite, one variable
e01bf nagf_interp_dim1_monotonic_eval
Interpolated values, interpolant computed by e01be, function only, one variable
e01bg nagf_interp_dim1_monotonic_deriv
Interpolated values, interpolant computed by e01be, function and first derivative, one variable
e01bh nagf_interp_dim1_monotonic_intg
Interpolated values, interpolant computed by e01be, definite integral, one variable
e01da nagf_interp_2d_spline_grid
Interpolating functions, fitting bicubic spline, data on rectangular grid
e01ea nagf_interp_2d_triangulate
Triangulation of two-dimensional scattered grid, method of Renka and Cline
e01eb nagf_interp_2d_triang_bary_eval
Barycentric interpolation on function values provided on a two-dimensional scattered grid
e01ra nagf_interp_dim1_ratnl
Interpolating functions, rational interpolant, one variable
e01rb nagf_interp_dim1_ratnl_eval
Interpolated values, evaluate rational interpolant computed by e01ra, one variable
e01sa nagf_interp_2d_scat
Interpolating functions, method of Renka and Cline, two variables
e01sb nagf_interp_2d_scat_eval
Interpolated values, evaluate interpolant computed by e01sa, two variables
e01sg nagf_interp_2d_scat_shep
Interpolating functions, modified Shepard's method, two variables
e01sh nagf_interp_2d_scat_shep_eval
Interpolated values, evaluate interpolant computed by e01sg, function and first derivatives, two variables
e01tg nagf_interp_3d_scat_shep
Interpolating functions, modified Shepard's method, three variables
e01th nagf_interp_3d_scat_shep_eval
Interpolated values, evaluate interpolant computed by e01tg, function and first derivatives, three variables
e01tk nagf_interp_4d_scat_shep
Interpolating functions, modified Shepard's method, four variables
e01tl nagf_interp_4d_scat_shep_eval
Interpolated values, evaluate interpolant computed by e01tk, function and first derivatives, four variables
e01tm nagf_interp_5d_scat_shep
Interpolating functions, modified Shepard's method, five variables
e01tn nagf_interp_5d_scat_shep_eval
Interpolated values, evaluate interpolant computed by e01tm, function and first derivatives, five variables
e01zm nagf_interp_nd_scat_shep
Interpolating function, modified Shepard's method, d dimensions
e01zn nagf_interp_nd_scat_shep_eval
Interpolated values, evaluate interpolant computed by e01zm, function and first derivatives, d dimensions
Back to E01 Chapter Summary

E02 – Curve and Surface Fitting

Examples of routines and methods in this chapter:

e02ad nagf_fit_1dcheb_arb
Least squares curve fit, by polynomials, arbitrary data points
e02ae nagf_fit_1dcheb_eval
Evaluation of fitted polynomial in one variable from Chebyshev series form (simplified parameter list)
e02af nagf_fit_1dcheb_glp
Least squares polynomial fit, special data points (including interpolation)
e02ag nagf_fit_1dcheb_con
Least squares polynomial fit, values and derivatives may be constrained, arbitrary data points
e02ah nagf_fit_1dcheb_deriv
Derivative of fitted polynomial in Chebyshev series form
e02aj nagf_fit_1dcheb_integ
Integral of fitted polynomial in Chebyshev series form
e02ak nagf_fit_1dcheb_eval2
Evaluation of fitted polynomial in one variable from Chebyshev series form
e02al nagf_fit_1d_minimax_polynomial
Minimax curve fit by polynomials
e02ba nagf_fit_1dspline_knots
Least squares curve cubic spline fit (including interpolation)
e02bb nagf_fit_1dspline_eval
Evaluation of fitted cubic spline, function only
e02bc nagf_fit_1dspline_deriv
Evaluation of fitted cubic spline, function and derivatives
e02bd nagf_fit_1dspline_integ
Evaluation of fitted cubic spline, definite integral
e02be nagf_fit_1dspline_auto
Least squares cubic spline curve fit, automatic knot placement
e02bf nagf_fit_1dspline_deriv_vector
Evaluation of fitted cubic spline, function and optionally derivatives at a vector of points
e02ca nagf_fit_2dcheb_lines
Least squares surface fit by polynomials, data on lines parallel to one independent coordinate axis
e02cb nagf_fit_2dcheb_eval
Evaluation of fitted polynomial in two variables
e02da nagf_fit_2dspline_panel
Least squares surface fit, bicubic splines
e02dc nagf_fit_2dspline_grid
Least squares surface fit by bicubic splines with automatic knot placement, data on rectangular grid
e02dd nagf_fit_2dspline_sctr
Least squares surface fit by bicubic splines with automatic knot placement, scattered data
e02de nagf_fit_2dspline_evalv
Evaluation of fitted bicubic spline at a vector of points
e02df nagf_fit_2dspline_evalm
Evaluation of fitted bicubic spline at a mesh of points
e02dh nagf_fit_2dspline_derivm
Evaluation of spline surface at mesh of points with derivatives
e02ga nagf_fit_glin_l1sol
L1-approximation by general linear function
e02gb nagf_fit_glinc_l1sol
L1-approximation by general linear function subject to linear inequality constraints
e02gc nagf_fit_glin_linf
L-approximation by general linear function
e02jd nagf_fit_2dspline_ts_sctr
Spline approximation to a set of scattered data using a two-stage approximation method
e02je nagf_fit_2dspline_ts_evalv
Evaluation at a vector of points of a spline computed by e02jd
e02jf nagf_fit_2dspline_ts_evalm
Evaluation at a mesh of points of a spline computed by e02jd
e02ra nagf_fit_pade_app
Padé approximants
e02rb nagf_fit_pade_eval
Evaluation of fitted rational function as computed by e02ra
e02za nagf_fit_2dspline_sort
Sort two-dimensional data into panels for fitting bicubic splines
e02zk nagf_fit_opt_set
Option setting routine
e02zl nagf_fit_opt_get
Option getting routine
Back to E02 Chapter Summary

E04 – Minimizing or Maximizing a Function

Examples of routines and methods in this chapter:

e04ab nagf_opt_one_var_func_old
Minimum, function of one variable, using function values only
e04bb nagf_opt_one_var_deriv_old
Minimum, function of one variable, using first derivative
e04cb nagf_opt_uncon_simplex
Unconstrained minimum, Nelder–Mead simplex algorithm, using function values only
e04cb nagf_opt_uncon_simplex_dummy_monit
e04dg nagf_opt_uncon_conjgrd_comp_old
Unconstrained minimum, preconditioned conjugate gradient algorithm, using first derivatives (comprehensive)
e04dj nagf_opt_uncon_conjgrd_option_file_old
Supply optional parameter values for e04dg from external file
e04dk nagf_opt_uncon_conjgrd_option_string_old
Supply optional parameter values to e04dg from a character string
e04fc nagf_opt_lsq_uncon_mod_func_comp
Unconstrained minimum of a sum of squares, combined Gauss–Newton and modified Newton algorithm, using function values only (comprehensive)
e04fd nagf_opt_lsq_dummy_lsqmon
dummy
e04ff nagf_opt_handle_solve_dfls
Derivative-free (DFO) solver for a nonlinear least squares objective function with bounded variables
e04ff nagf_opt_bobyqa_ls_dummy_monit
dummy
e04fy nagf_opt_lsq_uncon_mod_func_easy
Unconstrained minimum of a sum of squares, combined Gauss–Newton and modified Newton algorithm, using function values only (easy-to-use)
e04gb nagf_opt_lsq_uncon_quasi_deriv_comp
Unconstrained minimum of a sum of squares, combined Gauss–Newton and quasi-Newton algorithm, using first derivatives (comprehensive)
e04gd nagf_opt_lsq_uncon_mod_deriv_comp
Unconstrained minimum of a sum of squares, combined Gauss–Newton and modified Newton algorithm, using first derivatives (comprehensive)
e04gy nagf_opt_lsq_uncon_quasi_deriv_easy
Unconstrained minimum of a sum of squares, combined Gauss–Newton and quasi-Newton algorithm, using first derivatives (easy-to-use)
e04gz nagf_opt_lsq_uncon_mod_deriv_easy
Unconstrained minimum of a sum of squares, combined Gauss–Newton and modified Newton algorithm, using first derivatives (easy-to-use)
e04hc nagf_opt_check_deriv
Check user's routine for calculating first derivatives of function
e04hd nagf_opt_check_deriv2
Check user's routine for calculating second derivatives of function
e04he nagf_opt_lsq_uncon_mod_deriv2_comp
Unconstrained minimum of a sum of squares, combined Gauss–Newton and modified Newton algorithm, using second derivatives (comprehensive)
e04hy nagf_opt_lsq_uncon_mod_deriv2_easy
Unconstrained minimum of a sum of squares, combined Gauss–Newton and modified Newton algorithm, using second derivatives (easy-to-use)
e04jc nagf_opt_bounds_bobyqa_func
Bound constrained minimum, model-based algorithm, using function values only
e04jy nagf_opt_bounds_quasi_func_easy
Bound constrained minimum, quasi-Newton algorithm, using function values only (easy-to-use)
e04kd nagf_opt_bounds_mod_deriv_comp
Bound constrained minimum, modified Newton algorithm, using first derivatives (comprehensive)
e04ky nagf_opt_bounds_quasi_deriv_easy
Bound constrained minimum, quasi-Newton algorithm, using first derivatives (easy-to-use)
e04kz nagf_opt_bounds_mod_deriv_easy
Bound constrained minimum, modified Newton algorithm, using first derivatives (easy-to-use)
e04lb nagf_opt_bounds_mod_deriv2_comp
Bound constrained minimum, modified Newton algorithm, using first and second derivatives (comprehensive)
e04ly nagf_opt_bounds_mod_deriv2_easy
Bound constrained minimum, modified Newton algorithm, using first and second derivatives (easy-to-use)
e04mf nagf_opt_lp_solve_old
Linear programming (LP), dense, active-set method
e04mg nagf_opt_lp_option_file_old
Supply optional parameter values for e04mf from external file
e04mh nagf_opt_lp_option_string_old
Supply optional parameter values to e04mf from a character string
e04mt nagf_opt_handle_solve_lp_ipm
Linear programming (LP), sparse, interior point method (IPM)
e04mt nagf_opt_lp_imp_dummy_monit
dummy
e04mw nagf_opt_miqp_mps_write
Write MPS data file defining LP, QP, MILP or MIQP problem
e04mx nagf_opt_miqp_mps_read
Read MPS data file defining LP, QP, MILP or MIQP problem
e04mz nagf_opt_qpconvex1_sparse_mps
Read MPS data file defining LP or QP problem, deprecated
e04nc nagf_opt_lsq_lincon_solve_old
Linear programming (LP) convex quadratic programming (QP) or linearly-constrained linear least squares problem, dense
e04nd nagf_opt_lsq_lincon_option_file_old
Supply optional parameter values for e04nc from external file
e04ne nagf_opt_lsq_lincon_option_string_old
Supply optional parameter values to e04nc from a character string
e04nf nagf_opt_qp_dense_solve_old
General (possibly non-convex) quadratic programming (QP), dense, active-set method
e04ng nagf_opt_qp_dense_option_file_old
Supply optional parameter values for e04nf from external file
e04nh nagf_opt_qp_dense_option_string_old
Supply optional parameter values to e04nf from a character string
e04nk nagf_opt_qpconvex1_sparse_solve_old
Linear programming (LP) or convex quadratic programming (QP), sparse, active-set method
e04nk nagf_opt_qpconvex1_sparse_dummy_qphx_old
dummy
e04nl nagf_opt_qpconvex1_sparse_option_file_old
Supply optional parameter values for e04nk from external file
e04nm nagf_opt_qpconvex1_sparse_option_string_old
Supply optional parameter values to e04nk from a character string
e04np nagf_opt_qpconvex2_sparse_init
Initialization routine for e04nq
e04nq nagf_opt_qpconvex2_sparse_solve
Linear programming (LP) or convex quadratic programming (QP), sparse, active-set method, recommended
e04nr nagf_opt_qpconvex2_sparse_option_file
Supply optional parameter values for e04nq from external file
e04ns nagf_opt_qpconvex2_sparse_option_string
Set a single option for e04nq from a character string
e04ns nagf_opt_qpconvex2_sparse_dummy_qphx
dummy
e04nt nagf_opt_qpconvex2_sparse_option_integer_set
Set a single option for e04nq from an integer argument
e04nu nagf_opt_qpconvex2_sparse_option_double_set
Set a single option for e04nq from a real argument
e04nx nagf_opt_qpconvex2_sparse_option_integer_get
Get the setting of an integer valued option of e04nq
e04ny nagf_opt_qpconvex2_sparse_option_double_get
Get the setting of a real valued option of e04nq
e04pc nagf_opt_bnd_lin_lsq
Computes the least squares solution to a set of linear equations subject to fixed upper and lower bounds on the variables. An option is provided to return a minimal length solution if a solution is not unique
e04ra nagf_opt_handle_init
Initialization of a handle for the NAG optimization modelling suite for problems, such as, linear programming (LP), quadratic programming (QP), nonlinear programming (NLP), least squares (LSQ) problems, linear semidefinite programming (SDP) or SDP with bilinear matrix inequalities (BMI-SDP)
e04rd nagf_opt_sdp_read_sdpa
A reader of sparse SDPA data files for linear SDP problems
e04re nagf_opt_handle_set_linobj
Define a linear objective function to a problem initialized by e04ra
e04rf nagf_opt_handle_set_quadobj
Define a linear or a quadratic objective function to a problem initialized by e04ra
e04rg nagf_opt_handle_set_nlnobj
Define a nonlinear objective function to a problem initialized by e04ra
e04rh nagf_opt_handle_set_simplebounds
Define bounds of variables of a problem initialized by e04ra
e04rj nagf_opt_handle_set_linconstr
Define a block of linear constraints to a problem initialized by e04ra
e04rk nagf_opt_handle_set_nlnconstr
Define a block of nonlinear constraints to a problem initialized by e04ra
e04rl nagf_opt_handle_set_nlnhess
Define a structure of Hessian of the objective, constraints or the Lagrangian to a problem initialized by e04ra
e04rm nagf_opt_handle_set_nlnls
Define a nonlinear least squares objective function to a problem initialized by e04ra
e04rn nagf_opt_handle_set_linmatineq
Add one or more linear matrix inequality constraints to a problem initialized by e04ra
e04rp nagf_opt_handle_set_quadmatineq
Define bilinear matrix terms to a problem initialized by e04ra
e04rx nagf_opt_handle_set_get_real
Retrieve or write a piece of information in a problem handle initialized by e04ra
e04ry nagf_opt_handle_print
Print information about a problem handle initialized by e04ra
e04rz nagf_opt_handle_free
Destroy the problem handle initialized by e04ra and deallocate all the memory used
e04st nagf_opt_handle_solve_ipopt
Run an interior point solver on a sparse nonlinear programming problem (NLP) initialized by e04ra and defined by other routines from the suite
e04sv nagf_opt_handle_solve_pennon
Run the Pennon solver on a compatible problem initialized by e04ra and defined by other routines from the suite, such as, semidefinite programming (SDP) and SDP with bilinear matrix inequalities (BMI)
e04uc nagf_opt_nlp1_solve_old
Nonlinear programming (NLP), dense, active-set SQP method, using function values and optionally first derivatives, recommended
e04ud nagf_opt_nlp1_option_file_old
Supply optional parameter values for e04uc or e04uf from external file
e04ud nagf_opt_nlp1_dummy_confun
dummy
e04ue nagf_opt_nlp1_option_string_old
Supply optional parameter values to e04uc or e04uf from a character string
e04uf nagf_opt_nlp1_rcomm_old
Nonlinear programming (NLP), dense, active-set, SQP method, using function values and optionally first derivatives (reverse communication, comprehensive)
e04ug nagf_opt_nlp1_sparse_solve_old
Nonlinear programming (NLP), sparse, active-set SQP method, using function values and optionally first derivatives
e04ug nagf_opt_nlp1_sparse_dummy_confun
dummy
e04ug nagf_opt_nlp1_sparse_dummy_objfun
dummy
e04uh nagf_opt_nlp1_sparse_option_file_old
Supply optional parameter values for e04ug from external file
e04uj nagf_opt_nlp1_sparse_option_string_old
Supply optional parameter values to e04ug from a character string
e04uq nagf_opt_lsq_gencon_deriv_option_file_old
Supply optional parameter values for e04us from external file
e04ur nagf_opt_lsq_gencon_deriv_option_string_old
Supply optional parameter values to e04us from a character string
e04us nagf_opt_lsq_gencon_deriv_old
Minimum of a sum of squares, nonlinear constraints, dense, active-set SQP method, using function values and optionally first derivatives
e04vg nagf_opt_nlp2_sparse_init
Initialization routine for e04vh
e04vh nagf_opt_nlp2_sparse_solve
Nonlinear programming (NLP), sparse, active-set SQP method, using function values and optionally first derivatives, recommended
e04vj nagf_opt_nlp2_sparse_jacobian
Determine the pattern of nonzeros in the Jacobian matrix for e04vh
e04vk nagf_opt_nlp2_sparse_option_file
Supply optional parameter values for e04vh from external file
e04vl nagf_opt_nlp2_sparse_option_string
Set a single option for e04vh from a character string
e04vm nagf_opt_nlp2_sparse_option_integer_set
Set a single option for e04vh from an integer argument
e04vn nagf_opt_nlp2_sparse_option_double_set
Set a single option for e04vh from a real argument
e04vr nagf_opt_nlp2_sparse_option_integer_get
Get the setting of an integer valued option of e04vh
e04vs nagf_opt_nlp2_sparse_option_double_get
Get the setting of a real valued option of e04vh
e04wb nagf_opt_nlp1_init
Initialization routine for e04dg, e04mf, e04nc, e04nf, e04nk, e04uc, e04uf, e04ug and e04us
e04wc nagf_opt_nlp2_init
Initialization routine for e04wd
e04wd nagf_opt_nlp2_solve
Nonlinear programming (NLP), dense, active-set SQP method, using function values and optionally first derivatives
e04wd nagf_opt_nlp2_dummy_confun
dummy
e04we nagf_opt_nlp2_option_file
Supply optional parameter values for e04wd from external file
e04wf nagf_opt_nlp2_option_string
Set a single option for e04wd from a character string
e04wg nagf_opt_nlp2_option_integer_set
Set a single option for e04wd from an integer argument
e04wh nagf_opt_nlp2_option_double_set
Set a single option for e04wd from a real argument
e04wk nagf_opt_nlp2_option_integer_get
Get the setting of an integer valued option of e04wd
e04wl nagf_opt_nlp2_option_double_get
Get the setting of a real valued option of e04wd
e04xa nagf_opt_estimate_deriv_old
Estimate (using numerical differentiation) gradient and/or Hessian of a function
e04ya nagf_opt_lsq_check_deriv
Check user's routine for calculating Jacobian of first derivatives
e04yb nagf_opt_lsq_check_hessian
Check user's routine for calculating Hessian of a sum of squares
e04yc nagf_opt_lsq_uncon_covariance
Covariance matrix for nonlinear least squares problem (unconstrained)
e04zm nagf_opt_handle_opt_set
Option setting routine for the solvers from the NAG optimization modelling suite
e04zn nagf_opt_handle_opt_get
Option getting routine for the solvers from the NAG optimization modelling suite
e04zp nagf_opt_handle_opt_set_file
Option setting routine for the solvers from the NAG optimization modelling suite from external file
Back to E04 Chapter Summary

E05 – Global Optimization of a Function

Examples of routines and methods in this chapter:

e05ja nagf_glopt_bnd_mcs_init
Initialization routine for e05jb
e05jb nagf_glopt_bnd_mcs_solve
Global optimization by multi-level coordinate search, simple bounds, using function values only
e05jc nagf_glopt_bnd_mcs_optset_file
Supply optional parameter values for e05jb from external file
e05jd nagf_glopt_bnd_mcs_optset_string
Set a single optional parameter for e05jb from a character string
e05je nagf_glopt_bnd_mcs_optset_char
Set a single optional parameter for e05jb from an 'ON'/'OFF'-valued character argument
e05jf nagf_glopt_bnd_mcs_optset_int
Set a single optional parameter for e05jb from an integer argument
e05jg nagf_glopt_bnd_mcs_optset_real
Set a single optional parameter for e05jb from a real argument
e05jh nagf_glopt_bnd_mcs_option_check
Determine whether an optional parameter for e05jb has been set by you or not
e05jj nagf_glopt_bnd_mcs_optget_char
Get the setting of an 'ON'/'OFF'-valued character optional parameter of e05jb
e05jk nagf_glopt_bnd_mcs_optget_int
Get the setting of an integer valued optional parameter of e05jb
e05jl nagf_glopt_bnd_mcs_optget_real
Get the setting of a real valued optional parameter of e05jb
e05sa nagf_glopt_bnd_pso
Global optimization using particle swarm algorithm (PSO), bound constraints only
e05sb nagf_glopt_nlp_pso
Global optimization using particle swarm algorithm (PSO), comprehensive
e05sx nagf_glopt_bnd_pso_dummy_monmod
dummy
e05sy nagf_glopt_nlp_pso_dummy_monmod
dummy
e05uc nagf_glopt_nlp_multistart_sqp
Global optimization using multi-start, nonlinear constraints
e05ud nagf_glopt_nlp_multistart_dcf
dummy
e05us nagf_glopt_nlp_multistart_sqp_lsq
Global optimization of a sum of squares problem using multi-start, nonlinear constraints
e05zk nagf_glopt_optset
Option setting routine for e05sa, e05sb, e05uc and e05us
e05zl nagf_glopt_optget
Option getting routine for e05sa, e05sb, e05uc and e05us
Back to E05 Chapter Summary

F01 – Matrix Operations, Including Inversion

Examples of routines and methods in this chapter:

f01ab nagf_matop_real_symm_posdef_inv
Inverse of real symmetric positive definite matrix using iterative refinement
f01ad nagf_matop_real_symm_posdef_inv_noref
Inverse of real symmetric positive definite matrix
f01bl nagf_matop_real_gen_pseudinv
Pseudo-inverse and rank of real m by n matrix (mn)
f01br nagf_matop_real_gen_sparse_lu
LU factorization of real sparse matrix
f01bs nagf_matop_real_gen_sparse_lu_reuse
LU factorization of real sparse matrix with known sparsity pattern
f01bu nagf_matop_real_symm_posdef_fac
ULDLTUT factorization of real symmetric positive definite band matrix
f01bv nagf_matop_real_symm_posdef_geneig
Reduction to standard form, generalized real symmetric-definite banded eigenproblem
f01ck nagf_matop_real_gen_matmul
Multiplication of real matrices
f01cr nagf_matop_real_gen_trans_inplace
Transposition of a real matrix
f01ct nagf_matop_real_addsub
Sum or difference of two real matrices, optional scaling and transposition
f01cw nagf_matop_complex_addsub
Sum or difference of two complex matrices, optional scaling and transposition
f01ec nagf_matop_real_gen_matrix_exp
Real matrix exponential
f01ed nagf_matop_real_symm_matrix_exp
Real symmetric matrix exponential
f01ef nagf_matop_real_symm_matrix_fun
Function of a real symmetric matrix
f01ej nagf_matop_real_gen_matrix_log
Real matrix logarithm
f01ek nagf_matop_real_gen_matrix_fun_std
Exponential, sine, cosine, sinh or cosh of a real matrix (Schur–Parlett algorithm)
f01el nagf_matop_real_gen_matrix_fun_num
Function of a real matrix (using numerical differentiation)
f01em nagf_matop_real_gen_matrix_fun_usd
Function of a real matrix (using user-supplied derivatives)
f01en nagf_matop_real_gen_matrix_sqrt
Real matrix square root
f01ep nagf_matop_real_tri_matrix_sqrt
Real upper quasi-triangular matrix square root
f01eq nagf_matop_real_gen_matrix_pow
General power of a real matrix
f01fc nagf_matop_complex_gen_matrix_exp
Complex matrix exponential
f01fd nagf_matop_complex_herm_matrix_exp
Complex Hermitian matrix exponential
f01ff nagf_matop_complex_herm_matrix_fun
Function of a complex Hermitian matrix
f01fj nagf_matop_complex_gen_matrix_log
Complex matrix logarithm
f01fk nagf_matop_complex_gen_matrix_fun_std
Exponential, sine, cosine, sinh or cosh of a complex matrix (Schur–Parlett algorithm)
f01fl nagf_matop_complex_gen_matrix_fun_num
Function of a complex matrix (using numerical differentiation)
f01fm nagf_matop_complex_gen_matrix_fun_usd
Function of a complex matrix (using user-supplied derivatives)
f01fn nagf_matop_complex_gen_matrix_sqrt
Complex matrix square root
f01fp nagf_matop_complex_tri_matrix_sqrt
Complex upper triangular matrix square root
f01fq nagf_matop_complex_gen_matrix_pow
General power of a complex matrix
f01ga nagf_matop_real_gen_matrix_actexp
Action of a real matrix exponential on a real matrix
f01gb nagf_matop_real_gen_matrix_actexp_rcomm
Action of a real matrix exponential on a real matrix (reverse communication)
f01ha nagf_matop_complex_gen_matrix_actexp
Action of a complex matrix exponential on a complex matrix
f01hb nagf_matop_complex_gen_matrix_actexp_rcomm
Action of a complex matrix exponential on a complex matrix (reverse communication)
f01ja nagf_matop_real_gen_matrix_cond_std
Condition number for the exponential, logarithm, sine, cosine, sinh or cosh of a real matrix
f01jb nagf_matop_real_gen_matrix_cond_num
Condition number for a function of a real matrix (using numerical differentiation)
f01jc nagf_matop_real_gen_matrix_cond_usd
Condition number for a function of a real matrix (using user-supplied derivatives)
f01jd nagf_matop_real_gen_matrix_cond_sqrt
Condition number for square root of real matrix
f01je nagf_matop_real_gen_matrix_cond_pow
Condition number for real matrix power
f01jf nagf_matop_real_gen_matrix_frcht_pow
Fréchet derivative of real matrix power
f01jg nagf_matop_real_gen_matrix_cond_exp
Condition number for real matrix exponential
f01jh nagf_matop_real_gen_matrix_frcht_exp
Fréchet derivative of real matrix exponential
f01jj nagf_matop_real_gen_matrix_cond_log
Condition number for real matrix logarithm
f01jk nagf_matop_real_gen_matrix_frcht_log
Fréchet derivative of real matrix logarithm
f01ka nagf_matop_complex_gen_matrix_cond_std
Condition number for the exponential, logarithm, sine, cosine, sinh or cosh of a complex matrix
f01kb nagf_matop_complex_gen_matrix_cond_num
Condition number for a function of a complex matrix (using numerical differentiation)
f01kc nagf_matop_complex_gen_matrix_cond_usd
Condition number for a function of a complex matrix (using user-supplied derivatives)
f01kd nagf_matop_complex_gen_matrix_cond_sqrt
Condition number for square root of complex matrix
f01ke nagf_matop_complex_gen_matrix_cond_pow
Condition number for complex matrix power
f01kf nagf_matop_complex_gen_matrix_frcht_pow
Fréchet derivative of complex matrix power
f01kg nagf_matop_complex_gen_matrix_cond_exp
Condition number for complex matrix exponential
f01kh nagf_matop_complex_gen_matrix_frcht_exp
Fréchet derivative of complex matrix exponential
f01kj nagf_matop_complex_gen_matrix_cond_log
Condition number for complex matrix logarithm
f01kk nagf_matop_complex_gen_matrix_frcht_log
Fréchet derivative of complex matrix logarithm
f01le nagf_matop_real_gen_tridiag_lu
LU factorization of real tridiagonal matrix
f01lh nagf_matop_real_gen_blkdiag_lu
LU factorization of real almost block diagonal matrix
f01mc nagf_matop_real_vband_posdef_fac
LDLT factorization of real symmetric positive definite variable-bandwidth matrix
f01qg nagf_matop_real_trapez_rq
RQ factorization of real m by n upper trapezoidal matrix (mn)
f01qj nagf_matop_real_gen_rq
RQ factorization of real m by n matrix (mn)
f01qk nagf_matop_real_gen_rq_formq
Operations with orthogonal matrices, form rows of Q, after RQ factorization by f01qj
f01rg nagf_matop_complex_trapez_rq
RQ factorization of complex m by n upper trapezoidal matrix (mn)
f01rj nagf_matop_complex_gen_rq
RQ factorization of complex m by n matrix (mn)
f01rk nagf_matop_complex_gen_rq_formq
Operations with unitary matrices, form rows of Q, after RQ factorization by f01rj
f01va nagf_matop_dtrttp
Copies a real triangular matrix from full format to packed format
f01vb nagf_matop_ztrttp
Copies a complex triangular matrix from full format to packed format
f01vc nagf_matop_dtpttr
Copies a real triangular matrix from packed format to full format
f01vd nagf_matop_ztpttr
Copies a complex triangular matrix from packed format to full format
f01ve nagf_matop_dtrttf
Copies a real triangular matrix from full format to Rectangular Full Packed format
f01vf nagf_matop_ztrttf
Copies a complex triangular matrix from full format to Rectangular Full Packed format
f01vg nagf_matop_dtfttr
Copies a real triangular matrix from Rectangular Full Packed format to full format
f01vh nagf_matop_ztfttr
Copies a complex triangular matrix from Rectangular Full Packed format to full format
f01vj nagf_matop_dtpttf
Copies a real triangular matrix from packed format to Rectangular Full Packed format
f01vk nagf_matop_ztpttf
Copies a complex triangular matrix from packed format to Rectangular Full Packed format
f01vl nagf_matop_dtfttp
Copies a real triangular matrix from Rectangular Full Packed format to packed format
f01vm nagf_matop_ztfttp
Copies a complex triangular matrix from Rectangular Full Packed format to packed format
f01za nagf_matop_real_tri_pack
Convert real matrix between packed triangular and square storage formats
f01zb nagf_matop_complex_tri_pack
Convert complex matrix between packed triangular and square storage formats
f01zc nagf_matop_real_band_pack
Convert real matrix between packed banded and rectangular storage formats
f01zd nagf_matop_complex_band_pack
Convert complex matrix between packed banded and rectangular storage formats
Back to F01 Chapter Summary

F02 – Eigenvalues and Eigenvectors

Examples of routines and methods in this chapter:

f02ec nagf_eigen_real_gen_eigsys
Selected eigenvalues and eigenvectors of real nonsymmetric matrix (Black Box)
f02ek nagf_eigen_real_gen_sparse_arnoldi
Selected eigenvalues and eigenvectors of a real sparse general matrix
f02ek nagf_eigen_arnoldi_option
dummy
f02ek nagf_eigen_arnoldi_monit_gen
dummy
f02fj nagf_eigen_real_symm_sparse_eigsys
Selected eigenvalues and eigenvectors of sparse symmetric eigenproblem (Black Box)
f02fj nagf_eigen_monit
dummy
f02fk nagf_eigen_real_symm_sparse_arnoldi
Selected eigenvalues and eigenvectors of a real symmetric sparse matrix
f02fk nagf_eigen_arnoldi_monit_symm
dummy
f02gc nagf_eigen_complex_gen_eigsys
Selected eigenvalues and eigenvectors of complex nonsymmetric matrix (Black Box)
f02jc nagf_eigen_real_gen_quad
Solves the quadratic eigenvalue problem for real matrices
f02jq nagf_eigen_complex_gen_quad
Solves the quadratic eigenvalue problem for complex matrices
f02wg nagf_eigen_real_gen_partialsvd
Computes leading terms in the singular value decomposition of a real general matrix; also computes corresponding left and right singular vectors
f02wu nagf_eigen_real_triang_svd
SVD of real upper triangular matrix (Black Box)
f02xu nagf_eigen_complex_triang_svd
SVD of complex upper triangular matrix (Black Box)
Back to F02 Chapter Summary

F03 – Determinants

Examples of routines and methods in this chapter:

f03ba nagf_det_real_gen
Determinant of real matrix, matrix already factorized by f07ad
f03bf nagf_det_real_sym
Determinant of real symmetric positive definite matrix
f03bh nagf_det_real_band_sym
Determinant of real symmetric positive definite banded matrix previously factorized by f07hd
f03bn nagf_det_complex_gen
Determinant of complex matrix previously LU factorized
Back to F03 Chapter Summary

F04 – Simultaneous Linear Equations

Examples of routines and methods in this chapter:

f04am nagf_linsys_real_gen_lsqsol
Least squares solution of m real equations in n unknowns, rank =n, mn using iterative refinement (Black Box)
f04ax nagf_linsys_real_sparse_fac_solve
Solution of real sparse simultaneous linear equations (coefficient matrix already factorized)
f04ba nagf_linsys_real_square_solve
Computes the solution, estimated condition number and error-bound to a real system of linear equations
f04bb nagf_linsys_real_band_solve
Computes the solution, estimated condition number and error-bound to a real banded system of linear equations
f04bc nagf_linsys_real_tridiag_solve
Computes the solution, estimated condition number and error-bound to a real tridiagonal system of linear equations
f04bd nagf_linsys_real_posdef_solve
Computes the solution, estimated condition number and error-bound to a real symmetric positive definite system of linear equations
f04be nagf_linsys_real_posdef_packed_solve
Computes the solution, estimated condition number and error-bound to a real symmetric positive definite system of linear equations, packed storage
f04bf nagf_linsys_real_posdef_band_solve
Computes the solution, estimated condition number and error-bound to a real symmetric positive definite banded system of linear equations
f04bg nagf_linsys_real_posdef_tridiag_solve
Computes the solution, estimated condition number and error-bound to a real symmetric positive definite tridiagonal system of linear equations
f04bh nagf_linsys_real_symm_solve
Computes the solution, estimated condition number and error-bound to a real symmetric system of linear equations
f04bj nagf_linsys_real_symm_packed_solve
Computes the solution, estimated condition number and error-bound to a real symmetric system of linear equations, packed storage
f04ca nagf_linsys_complex_square_solve
Computes the solution, estimated condition number and error-bound to a complex system of linear equations
f04cb nagf_linsys_complex_band_solve
Computes the solution, estimated condition number and error-bound to a complex banded system of linear equations
f04cc nagf_linsys_complex_tridiag_solve
Computes the solution, estimated condition number and error-bound to a complex tridiagonal system of linear equations
f04cd nagf_linsys_complex_posdef_solve
Computes the solution, estimated condition number and error-bound to a complex Hermitian positive definite system of linear equations
f04ce nagf_linsys_complex_posdef_packed_solve
Computes the solution, estimated condition number and error-bound to a complex Hermitian positive definite system of linear equations, packed storage
f04cf nagf_linsys_complex_posdef_band_solve
Computes the solution, estimated condition number and error-bound to a complex Hermitian positive definite banded system of linear equations
f04cg nagf_linsys_complex_posdef_tridiag_solve
Computes the solution, estimated condition number and error-bound to a complex Hermitian positive definite tridiagonal system of linear equations
f04ch nagf_linsys_complex_herm_solve
Computes the solution and error-bound to a complex Hermitian system of linear equations
f04cj nagf_linsys_complex_herm_packed_solve
Computes the solution, estimated condition number and error-bound to a complex Hermitian system of linear equations, packed storage
f04dh nagf_linsys_complex_symm_solve
Computes the solution, estimated condition number and error-bound to a complex symmetric system of linear equations
f04dj nagf_linsys_complex_symm_packed_solve
Computes the solution, estimated condition number and error-bound to a complex symmetric system of linear equations, packed storage
f04fe nagf_linsys_real_toeplitz_yule
Solution of the Yule–Walker equations for real symmetric positive definite Toeplitz matrix, one right-hand side
f04ff nagf_linsys_real_toeplitz_solve
Solution of real symmetric positive definite Toeplitz system, one right-hand side
f04jg nagf_linsys_real_gen_solve
Least squares (if rank =n) or minimal least squares (if rank <n) solution of m real equations in n unknowns, mn
f04le nagf_linsys_real_tridiag_fac_solve
Solution of real tridiagonal simultaneous linear equations (coefficient matrix already factorized by f01le)
f04lh nagf_linsys_real_blkdiag_fac_solve
Solution of real almost block diagonal simultaneous linear equations (coefficient matrix already factorized by f01lh)
f04mc nagf_linsys_real_posdef_vband_solve
Solution of real symmetric positive definite variable-bandwidth simultaneous linear equations (coefficient matrix already factorized by f01mc)
f04me nagf_linsys_real_toeplitz_yule_update
Update solution of the Yule–Walker equations for real symmetric positive definite Toeplitz matrix
f04mf nagf_linsys_real_toeplitz_update
Update solution of real symmetric positive definite Toeplitz system
f04qa nagf_linsys_real_gen_sparse_lsqsol
Sparse linear least squares problem, m real equations in n unknowns
f04ya nagf_linsys_real_gen_lsq_covmat
Covariance matrix for linear least squares problems, m real equations in n unknowns
f04yd nagf_linsys_real_gen_norm_rcomm
Norm estimation (for use in condition estimation), real rectangular matrix
f04zd nagf_linsys_complex_gen_norm_rcomm
Norm estimation (for use in condition estimation), complex rectangular matrix
Back to F04 Chapter Summary

F05 – Orthogonalization

Examples of routines and methods in this chapter:

f05aa nagf_orthog_real_gram_schmidt
Gram–Schmidt orthogonalization of n vectors of order m
Back to F05 Chapter Summary

F06 – Linear Algebra Support Routines

Examples of routines and methods in this chapter:

f06aa nagf_blas_drotg
Generate real plane rotation
f06ba nagf_blas_drotgc
Generate real plane rotation, storing tangent
f06bc nagf_blas_dcsg
Recover cosine and sine from given real tangent
f06be nagf_blas_drotj
Generate real Jacobi plane rotation
f06bh nagf_blas_drot2
Apply real similarity rotation to 2 by 2 symmetric matrix
f06bl nagf_blas_ddiv
Compute quotient of two real scalars, with overflow flag
f06bm nagf_blas_dnorm
Compute Euclidean norm from scaled form
f06bn nagf_blas_dpyth
Compute square root of (a2+b2), real a and b
f06bp nagf_blas_deig2
Compute eigenvalue of 2 by 2 real symmetric matrix
f06ca nagf_blas_zrotgc
Generate complex plane rotation, storing tangent, real cosine
f06cb nagf_blas_zrotgs
Generate complex plane rotation, storing tangent, real sine
f06cc nagf_blas_zcsg
Recover cosine and sine from given complex tangent, real cosine
f06cd nagf_blas_zcsgs
Recover cosine and sine from given complex tangent, real sine
f06ch nagf_blas_zrot2
Apply complex similarity rotation to 2 by 2 Hermitian matrix
f06cl nagf_blas_zdiv
Compute quotient of two complex scalars, with overflow flag
f06db nagf_blas_iload
Broadcast scalar into integer vector
f06df nagf_blas_icopy
Copy integer vector
f06ea nagf_blas_ddot
Dot product of two real vectors
f06ec nagf_blas_daxpy
Add scalar times real vector to real vector
f06ed nagf_blas_dscal
Multiply real vector by scalar
f06ef nagf_blas_dcopy
Copy real vector
f06eg nagf_blas_dswap
Swap two real vectors
f06ej nagf_blas_dnrm2
Compute Euclidean norm of real vector
f06ek nagf_blas_dasum
Sum absolute values of real vector elements
f06ep nagf_blas_drot
Apply real plane rotation
f06er nagf_blas_ddoti
Dot product of a real sparse and a full vector
f06et nagf_blas_daxpyi
Add scalar times real sparse vector to a full vector
f06eu nagf_blas_dgthr
Gather real sparse vector
f06ev nagf_blas_dgthrz
Gather and set to zero real sparse vector
f06ew nagf_blas_dsctr
Scatter real sparse vector
f06ex nagf_blas_droti
Apply plane rotation to a real sparse and a full vector
f06fa nagf_blas_dvcos
Compute cosine of angle between two real vectors
f06fb nagf_blas_dload
Broadcast scalar into real vector
f06fc nagf_blas_ddscl
Multiply real vector by diagonal matrix
f06fd nagf_blas_axpzy
Multiply real vector by scalar, preserving input vector
f06fe nagf_blas_drscl
Multiply real vector by reciprocal of scalar
f06fg nagf_blas_dnegv
Negate real vector
f06fj nagf_blas_dssq
Update Euclidean norm of real vector in scaled form
f06fk nagf_blas_dnrm2w
Compute weighted Euclidean norm of real vector
f06fl nagf_blas_darang
Elements of real vector with largest and smallest absolute value
f06fp nagf_blas_drots
Apply real symmetric plane rotation to two vectors
f06fq nagf_blas_dsrotg
Generate sequence of real plane rotations
f06fr nagf_blas_dnhousg
Generate real elementary reflection, NAG style
f06fs nagf_blas_dlhousg
Generate real elementary reflection, LINPACK style
f06ft nagf_blas_dnhous
Apply real elementary reflection, NAG style
f06fu nagf_blas_dlhous
Apply real elementary reflection, LINPACK style
f06ga nagf_blas_zdotu
Dot product of two complex vectors, unconjugated
f06gb nagf_blas_zdotc
Dot product of two complex vectors, conjugated
f06gc nagf_blas_zaxpy
Add scalar times complex vector to complex vector
f06gd nagf_blas_zscal
Multiply complex vector by complex scalar
f06gf nagf_blas_zcopy
Copy complex vector
f06gg nagf_blas_zswap
Swap two complex vectors
f06gr nagf_blas_zdotui
Dot product of a complex sparse and a full vector, unconjugated
f06gs nagf_blas_zdotci
Dot product of a complex sparse and a full vector, conjugated
f06gt nagf_blas_zaxpyi
Add scalar times complex sparse vector to a full vector
f06gu nagf_blas_zgthr
Gather complex sparse vector
f06gv nagf_blas_zgthrz
Gather and set to zero complex sparse vector
f06gw nagf_blas_zsctr
Scatter complex sparse vector
f06hb nagf_blas_zload
Broadcast scalar into complex vector
f06hc nagf_blas_zdscl
Multiply complex vector by complex diagonal matrix
f06hd nagf_blas_zaxpzy
Multiply complex vector by complex scalar, preserving input vector
f06hg nagf_blas_znegv
Negate complex vector
f06hm nagf_blas_zrot
Apply plane rotation with real cosine and complex sine
f06hp nagf_blas_zcrot
Apply complex plane rotation
f06hq nagf_blas_zsrotg
Generate sequence of complex plane rotations
f06hr nagf_blas_zhousg
Generate complex elementary reflection
f06ht nagf_blas_zhous
Apply complex elementary reflection
f06jd nagf_blas_zdscal
Multiply complex vector by real scalar
f06jj nagf_blas_dznrm2
Compute Euclidean norm of complex vector
f06jk nagf_blas_dzasum
Sum absolute values of complex vector elements
f06jl nagf_blas_idamax
Index, real vector element with largest absolute value
f06jm nagf_blas_izamax
Index, complex vector element with largest absolute value
f06kc nagf_blas_zddscl
Multiply complex vector by real diagonal matrix
f06kd nagf_blas_zdaxpzy
Multiply complex vector by real scalar, preserving input vector
f06ke nagf_blas_zdrscl
Multiply complex vector by reciprocal of real scalar
f06kf nagf_blas_zdcopy
Copy real vector to complex vector
f06kj nagf_blas_dzssq
Update Euclidean norm of complex vector in scaled form
f06kl nagf_blas_idrank
Last non-negligible element of real vector
f06kp nagf_blas_zdrot
Apply real plane rotation to two complex vectors
f06pa nagf_blas_dgemv
Matrix-vector product, real rectangular matrix
f06pb nagf_blas_dgbmv
Matrix-vector product, real rectangular band matrix
f06pc nagf_blas_dsymv
Matrix-vector product, real symmetric matrix
f06pd nagf_blas_dsbmv
Matrix-vector product, real symmetric band matrix
f06pe nagf_blas_dspmv
Matrix-vector product, real symmetric packed matrix
f06pf nagf_blas_dtrmv
Matrix-vector product, real triangular matrix
f06pg nagf_blas_dtbmv
Matrix-vector product, real triangular band matrix
f06ph nagf_blas_dtpmv
Matrix-vector product, real triangular packed matrix
f06pj nagf_blas_dtrsv
System of equations, real triangular matrix
f06pk nagf_blas_dtbsv
System of equations, real triangular band matrix
f06pl nagf_blas_dtpsv
System of equations, real triangular packed matrix
f06pm nagf_blas_dger
Rank-1 update, real rectangular matrix
f06pp nagf_blas_dsyr
Rank-1 update, real symmetric matrix
f06pq nagf_blas_dspr
Rank-1 update, real symmetric packed matrix
f06pr nagf_blas_dsyr2
Rank-2 update, real symmetric matrix
f06ps nagf_blas_dspr2
Rank-2 update, real symmetric packed matrix
f06qf nagf_blas_dmcopy
Matrix copy, real rectangular or trapezoidal matrix
f06qh nagf_blas_dmload
Matrix initialization, real rectangular matrix
f06qj nagf_blas_dgeap
Permute rows or columns, real rectangular matrix, permutations represented by an integer array
f06qk nagf_blas_dgeapr
Permute rows or columns, real rectangular matrix, permutations represented by a real array
f06qm nagf_blas_dsysrc
Orthogonal similarity transformation of real symmetric matrix as a sequence of plane rotations
f06qp nagf_blas_dutr1
QR factorization by sequence of plane rotations, rank-1 update of real upper triangular matrix
f06qq nagf_blas_dutupd
QR factorization by sequence of plane rotations, real upper triangular matrix augmented by a full row
f06qr nagf_blas_duhqr
QR or RQ factorization by sequence of plane rotations, real upper Hessenberg matrix
f06qs nagf_blas_dusqr
QR or RQ factorization by sequence of plane rotations, real upper spiked matrix
f06qt nagf_blas_dutsqr
QR factorization of UP or RQ factorization of PU, U real upper triangular, P a sequence of plane rotations
f06qv nagf_blas_dutsrh
Compute upper Hessenberg matrix by sequence of plane rotations, real upper triangular matrix
f06qw nagf_blas_dutsrs
Compute upper spiked matrix by sequence of plane rotations, real upper triangular matrix
f06qx nagf_blas_dgesrc
Apply sequence of plane rotations, real rectangular matrix
f06ra nagf_blas_dlange
1-norm, -norm, Frobenius norm, largest absolute element, real general matrix
f06rb nagf_blas_dlangb
1-norm, -norm, Frobenius norm, largest absolute element, real band matrix
f06rc nagf_blas_dlansy
1-norm, -norm, Frobenius norm, largest absolute element, real symmetric matrix
f06rd nagf_blas_dlansp
1-norm, -norm, Frobenius norm, largest absolute element, real symmetric matrix, packed storage
f06re nagf_blas_dlansb
1-norm, -norm, Frobenius norm, largest absolute element, real symmetric band matrix
f06rj nagf_blas_dlantr
1-norm, -norm, Frobenius norm, largest absolute element, real trapezoidal/triangular matrix
f06rk nagf_blas_dlantp
1-norm, -norm, Frobenius norm, largest absolute element, real triangular matrix, packed storage
f06rl nagf_blas_dlantb
1-norm, -norm, Frobenius norm, largest absolute element, real triangular band matrix
f06rm nagf_blas_dlanhs
1-norm, -norm, Frobenius norm, largest absolute element, real upper Hessenberg matrix
f06rn nagf_blas_dlangt
1-norm, -norm, Frobenius norm, largest absolute element, real tridiagonal matrix
f06rp nagf_blas_dlanst
1-norm, -norm, Frobenius norm, largest absolute element, real symmetric tridiagonal matrix
f06sa nagf_blas_zgemv
Matrix-vector product, complex rectangular matrix
f06sb nagf_blas_zgbmv
Matrix-vector product, complex rectangular band matrix
f06sc nagf_blas_zhemv
Matrix-vector product, complex Hermitian matrix
f06sd nagf_blas_zhbmv
Matrix-vector product, complex Hermitian band matrix
f06se nagf_blas_zhpmv
Matrix-vector product, complex Hermitian packed matrix
f06sf nagf_blas_ztrmv
Matrix-vector product, complex triangular matrix
f06sg nagf_blas_ztbmv
Matrix-vector product, complex triangular band matrix
f06sh nagf_blas_ztpmv
Matrix-vector product, complex triangular packed matrix
f06sj nagf_blas_ztrsv
System of equations, complex triangular matrix
f06sk nagf_blas_ztbsv
System of equations, complex triangular band matrix
f06sl nagf_blas_ztpsv
System of equations, complex triangular packed matrix
f06sm nagf_blas_zgeru
Rank-1 update, complex rectangular matrix, unconjugated vector
f06sn nagf_blas_zgerc
Rank-1 update, complex rectangular matrix, conjugated vector
f06sp nagf_blas_zher
Rank-1 update, complex Hermitian matrix
f06sq nagf_blas_zhpr
Rank-1 update, complex Hermitian packed matrix
f06sr nagf_blas_zher2
Rank-2 update, complex Hermitian matrix
f06ss nagf_blas_zhpr2
Rank-2 update, complex Hermitian packed matrix
f06ta nagf_blas_zsymv
Matrix-vector product, complex symmetric matrix
f06tb nagf_blas_zsyr
Rank-1 update, complex symmetric matrix
f06tc nagf_blas_zspmv
Matrix-vector product, complex symmetric packed matrix
f06td nagf_blas_zspr
Rank-1 update, complex symmetric packed matrix
f06tf nagf_blas_zmcopy
Matrix copy, complex rectangular or trapezoidal matrix
f06th nagf_blas_zmload
Matrix initialization, complex rectangular matrix
f06tm nagf_blas_zhesrc
Unitary similarity transformation of Hermitian matrix as a sequence of plane rotations
f06tp nagf_blas_zutr1
QR factorization by sequence of plane rotations, rank-1 update of complex upper triangular matrix
f06tq nagf_blas_zutupd
QR factorization by sequence of plane rotations, complex upper triangular matrix augmented by a full row
f06tr nagf_blas_zuhqr
QR or RQ factorization by sequence of plane rotations, complex upper Hessenberg matrix
f06ts nagf_blas_zusqr
QR or RQ factorization by sequence of plane rotations, complex upper spiked matrix
f06tt nagf_blas_zutsqr
QR factorization of UP or RQ factorization of PU, U complex upper triangular, P a sequence of plane rotations
f06tv nagf_blas_zutsrh
Compute upper Hessenberg matrix by sequence of plane rotations, complex upper triangular matrix
f06tw nagf_blas_zutsrs
Compute upper spiked matrix by sequence of plane rotations, complex upper triangular matrix
f06tx nagf_blas_zgesrc
Apply sequence of plane rotations, complex rectangular matrix, real cosine and complex sine
f06ty nagf_blas_zgesrs
Apply sequence of plane rotations, complex rectangular matrix, complex cosine and real sine
f06ua nagf_blas_zlange
1-norm, -norm, Frobenius norm, largest absolute element, complex general matrix
f06ub nagf_blas_zlangb
1-norm, -norm, Frobenius norm, largest absolute element, complex band matrix
f06uc nagf_blas_zlanhe
1-norm, -norm, Frobenius norm, largest absolute element, complex Hermitian matrix
f06ud nagf_blas_zlanhp
1-norm, -norm, Frobenius norm, largest absolute element, complex Hermitian matrix, packed storage
f06ue nagf_blas_zlanhb
1-norm, -norm, Frobenius norm, largest absolute element, complex Hermitian band matrix
f06uf nagf_blas_zlansy
1-norm, -norm, Frobenius norm, largest absolute element, complex symmetric matrix
f06ug nagf_blas_zlansp
1-norm, -norm, Frobenius norm, largest absolute element, complex symmetric matrix, packed storage
f06uh nagf_blas_zlansb
1-norm, -norm, Frobenius norm, largest absolute element, complex symmetric band matrix
f06uj nagf_blas_zlantr
1-norm, -norm, Frobenius norm, largest absolute element, complex trapezoidal/triangular matrix
f06uk nagf_blas_zlantp
1-norm, -norm, Frobenius norm, largest absolute element, complex triangular matrix, packed storage
f06ul nagf_blas_zlantb
1-norm, -norm, Frobenius norm, largest absolute element, complex triangular band matrix
f06um nagf_blas_zlanhs
1-norm, -norm, Frobenius norm, largest absolute element, complex Hessenberg matrix
f06un nagf_blas_zlangt
1-norm, -norm, Frobenius norm, largest absolute element, complex tridiagonal matrix
f06up nagf_blas_zlanht
1-norm, -norm, Frobenius norm, largest absolute element, complex Hermitian tridiagonal matrix
f06vj nagf_blas_zgeap
Permute rows or columns, complex rectangular matrix, permutations represented by an integer array
f06vk nagf_blas_zgeapr
Permute rows or columns, complex rectangular matrix, permutations represented by a real array
f06vx nagf_blas_zsgesr
Apply sequence of plane rotations, complex rectangular matrix, real cosine and sine
f06wa nagf_blas_dlansf
1-norm, -norm, Frobenius norm, largest absolute element, real symmetric matrix, Rectangular Full Packed format
f06wb nagf_blas_dtfsm
Solves a system of equations with multiple right-hand sides, real triangular coefficient matrix, Rectangular Full Packed format
f06wc nagf_blas_dsfrk
Rank-k update of a real symmetric matrix, Rectangular Full Packed format
f06wn nagf_blas_zlanhf
1-norm, -norm, Frobenius norm, largest absolute element, complex Hermitian matrix, Rectangular Full Packed format
f06wp nagf_blas_ztfsm
Solves system of equations with multiple right-hand sides, complex triangular coefficient matrix, Rectangular Full Packed format
f06wq nagf_blas_zhfrk
Rank-k update of a complex Hermitian matrix, Rectangular Full Packed format
f06ya nagf_blas_dgemm
Matrix-matrix product, two real rectangular matrices
f06yc nagf_blas_dsymm
Matrix-matrix product, one real symmetric matrix, one real rectangular matrix
f06yf nagf_blas_dtrmm
Matrix-matrix product, one real triangular matrix, one real rectangular matrix
f06yj nagf_blas_dtrsm
Solves a system of equations with multiple right-hand sides, real triangular coefficient matrix
f06yp nagf_blas_dsyrk
Rank-k update of a real symmetric matrix
f06yr nagf_blas_dsyr2k
Rank-2k update of a real symmetric matrix
f06za nagf_blas_zgemm
Matrix-matrix product, two complex rectangular matrices
f06zc nagf_blas_zhemm
Matrix-matrix product, one complex Hermitian matrix, one complex rectangular matrix
f06zf nagf_blas_ztrmm
Matrix-matrix product, one complex triangular matrix, one complex rectangular matrix
f06zj nagf_blas_ztrsm
Solves system of equations with multiple right-hand sides, complex triangular coefficient matrix
f06zp nagf_blas_zherk
Rank-k update of a complex Hermitian matrix
f06zr nagf_blas_zher2k
Rank-2k update of a complex Hermitian matrix
f06zt nagf_blas_zsymm
Matrix-matrix product, one complex symmetric matrix, one complex rectangular matrix
f06zu nagf_blas_zsyrk
Rank-k update of a complex symmetric matrix
f06zw nagf_blas_zsyr2k
Rank-2k update of a complex symmetric matrix
Back to F06 Chapter Summary

F07 – Linear Equations (LAPACK)

Examples of routines and methods in this chapter:

f07aa nagf_lapacklin_dgesv
Computes the solution to a real system of linear equations
f07ab nagf_lapacklin_dgesvx
Uses the LU factorization to compute the solution, error-bound and condition estimate for a real system of linear equations
f07ac nagf_lapacklin_dsgesv
Computes the solution to a real system of linear equations using mixed precision arithmetic
f07ad nagf_lapacklin_dgetrf
LU factorization of real m by n matrix
f07ae nagf_lapacklin_dgetrs
Solution of real system of linear equations, multiple right-hand sides, matrix already factorized by f07ad
f07af nagf_lapacklin_dgeequ
Computes row and column scalings intended to equilibrate a general real matrix and reduce its condition number
f07ag nagf_lapacklin_dgecon
Estimate condition number of real matrix, matrix already factorized by f07ad
f07ah nagf_lapacklin_dgerfs
Refined solution with error bounds of real system of linear equations, multiple right-hand sides
f07aj nagf_lapacklin_dgetri
Inverse of real matrix, matrix already factorized by f07ad
f07an nagf_lapacklin_zgesv
Computes the solution to a complex system of linear equations
f07ap nagf_lapacklin_zgesvx
Uses the LU factorization to compute the solution, error-bound and condition estimate for a complex system of linear equations
f07aq nagf_lapacklin_zcgesv
Computes the solution to a complex system of linear equations using mixed precision arithmetic
f07ar nagf_lapacklin_zgetrf
LU factorization of complex m by n matrix
f07as nagf_lapacklin_zgetrs
Solution of complex system of linear equations, multiple right-hand sides, matrix already factorized by f07ar
f07at nagf_lapacklin_zgeequ
Computes row and column scalings intended to equilibrate a general complex matrix and reduce its condition number
f07au nagf_lapacklin_zgecon
Estimate condition number of complex matrix, matrix already factorized by f07ar
f07av nagf_lapacklin_zgerfs
Refined solution with error bounds of complex system of linear equations, multiple right-hand sides
f07aw nagf_lapacklin_zgetri
Inverse of complex matrix, matrix already factorized by f07ar
f07ba nagf_lapacklin_dgbsv
Computes the solution to a real banded system of linear equations
f07bb nagf_lapacklin_dgbsvx
Uses the LU factorization to compute the solution, error-bound and condition estimate for a real banded system of linear equations
f07bd nagf_lapacklin_dgbtrf
LU factorization of real m by n band matrix
f07be nagf_lapacklin_dgbtrs
Solution of real band system of linear equations, multiple right-hand sides, matrix already factorized by f07bd
f07bf nagf_lapacklin_dgbequ
Computes row and column scalings intended to equilibrate a real banded matrix and reduce its condition number
f07bg nagf_lapacklin_dgbcon
Estimate condition number of real band matrix, matrix already factorized by f07bd
f07bh nagf_lapacklin_dgbrfs
Refined solution with error bounds of real band system of linear equations, multiple right-hand sides
f07bn nagf_lapacklin_zgbsv
Computes the solution to a complex banded system of linear equations
f07bp nagf_lapacklin_zgbsvx
Uses the LU factorization to compute the solution, error-bound and condition estimate for a complex banded system of linear equations
f07br nagf_lapacklin_zgbtrf
LU factorization of complex m by n band matrix
f07bs nagf_lapacklin_zgbtrs
Solution of complex band system of linear equations, multiple right-hand sides, matrix already factorized by f07br
f07bt nagf_lapacklin_zgbequ
Computes row and column scalings intended to equilibrate a complex banded matrix and reduce its condition number
f07bu nagf_lapacklin_zgbcon
Estimate condition number of complex band matrix, matrix already factorized by f07br
f07bv nagf_lapacklin_zgbrfs
Refined solution with error bounds of complex band system of linear equations, multiple right-hand sides
f07ca nagf_lapacklin_dgtsv
Computes the solution to a real tridiagonal system of linear equations
f07cb nagf_lapacklin_dgtsvx
Uses the LU factorization to compute the solution, error-bound and condition estimate for a real tridiagonal system of linear equations
f07cd nagf_lapacklin_dgttrf
LU factorization of real tridiagonal matrix
f07ce nagf_lapacklin_dgttrs
Solves a real tridiagonal system of linear equations using the LU factorization computed by f07cd
f07cg nagf_lapacklin_dgtcon
Estimates the reciprocal of the condition number of a real tridiagonal matrix using the LU factorization computed by f07cd
f07ch nagf_lapacklin_dgtrfs
Refined solution with error bounds of real tridiagonal system of linear equations, multiple right-hand sides
f07cn nagf_lapacklin_zgtsv
Computes the solution to a complex tridiagonal system of linear equations
f07cp nagf_lapacklin_zgtsvx
Uses the LU factorization to compute the solution, error-bound and condition estimate for a complex tridiagonal system of linear equations
f07cr nagf_lapacklin_zgttrf
LU factorization of complex tridiagonal matrix
f07cs nagf_lapacklin_zgttrs
Solves a complex tridiagonal system of linear equations using the LU factorization computed by f07cd
f07cu nagf_lapacklin_zgtcon
Estimates the reciprocal of the condition number of a complex tridiagonal matrix using the LU factorization computed by f07cd
f07cv nagf_lapacklin_zgtrfs
Refined solution with error bounds of complex tridiagonal system of linear equations, multiple right-hand sides
f07fa nagf_lapacklin_dposv
Computes the solution to a real symmetric positive definite system of linear equations
f07fb nagf_lapacklin_dposvx
Uses the Cholesky factorization to compute the solution, error-bound and condition estimate for a real symmetric positive definite system of linear equations
f07fc nagf_lapacklin_dsposv
Computes the solution to a real symmetric positive definite system of linear equations using mixed precision arithmetic
f07fd nagf_lapacklin_dpotrf
Cholesky factorization of real symmetric positive definite matrix
f07fe nagf_lapacklin_dpotrs
Solution of real symmetric positive definite system of linear equations, multiple right-hand sides, matrix already factorized by f07fd
f07ff nagf_lapacklin_dpoequ
Computes row and column scalings intended to equilibrate a real symmetric positive definite matrix and reduce its condition number
f07fg nagf_lapacklin_dpocon
Estimate condition number of real symmetric positive definite matrix, matrix already factorized by f07fd
f07fh nagf_lapacklin_dporfs
Refined solution with error bounds of real symmetric positive definite system of linear equations, multiple right-hand sides
f07fj nagf_lapacklin_dpotri
Inverse of real symmetric positive definite matrix, matrix already factorized by f07fd
f07fn nagf_lapacklin_zposv
Computes the solution to a complex Hermitian positive definite system of linear equations
f07fp nagf_lapacklin_zposvx
Uses the Cholesky factorization to compute the solution, error-bound and condition estimate for a complex Hermitian positive definite system of linear equations
f07fq nagf_lapacklin_zcposv
Computes the solution to a complex Hermitian positive definite system of linear equations using mixed precision arithmetic
f07fr nagf_lapacklin_zpotrf
Cholesky factorization of complex Hermitian positive definite matrix
f07fs nagf_lapacklin_zpotrs
Solution of complex Hermitian positive definite system of linear equations, multiple right-hand sides, matrix already factorized by f07fr
f07ft nagf_lapacklin_zpoequ
Computes row and column scalings intended to equilibrate a complex Hermitian positive definite matrix and reduce its condition number
f07fu nagf_lapacklin_zpocon
Estimate condition number of complex Hermitian positive definite matrix, matrix already factorized by f07fr
f07fv nagf_lapacklin_zporfs
Refined solution with error bounds of complex Hermitian positive definite system of linear equations, multiple right-hand sides
f07fw nagf_lapacklin_zpotri
Inverse of complex Hermitian positive definite matrix, matrix already factorized by f07fr
f07ga nagf_lapacklin_dppsv
Computes the solution to a real symmetric positive definite system of linear equations, packed storage
f07gb nagf_lapacklin_dppsvx
Uses the Cholesky factorization to compute the solution, error-bound and condition estimate for a real symmetric positive definite system of linear equations, packed storage
f07gd nagf_lapacklin_dpptrf
Cholesky factorization of real symmetric positive definite matrix, packed storage
f07ge nagf_lapacklin_dpptrs
Solution of real symmetric positive definite system of linear equations, multiple right-hand sides, matrix already factorized by f07gd, packed storage
f07gf nagf_lapacklin_dppequ
Computes row and column scalings intended to equilibrate a real symmetric positive definite matrix and reduce its condition number, packed storage
f07gg nagf_lapacklin_dppcon
Estimate condition number of real symmetric positive definite matrix, matrix already factorized by f07gd, packed storage
f07gh nagf_lapacklin_dpprfs
Refined solution with error bounds of real symmetric positive definite system of linear equations, multiple right-hand sides, packed storage
f07gj nagf_lapacklin_dpptri
Inverse of real symmetric positive definite matrix, matrix already factorized by f07gd, packed storage
f07gn nagf_lapacklin_zppsv
Computes the solution to a complex Hermitian positive definite system of linear equations, packed storage
f07gp nagf_lapacklin_zppsvx
Uses the Cholesky factorization to compute the solution, error-bound and condition estimate for a complex Hermitian positive definite system of linear equations, packed storage
f07gr nagf_lapacklin_zpptrf
Cholesky factorization of complex Hermitian positive definite matrix, packed storage
f07gs nagf_lapacklin_zpptrs
Solution of complex Hermitian positive definite system of linear equations, multiple right-hand sides, matrix already factorized by f07gr, packed storage
f07gt nagf_lapacklin_zppequ
Computes row and column scalings intended to equilibrate a complex Hermitian positive definite matrix and reduce its condition number, packed storage
f07gu nagf_lapacklin_zppcon
Estimate condition number of complex Hermitian positive definite matrix, matrix already factorized by f07gr, packed storage
f07gv nagf_lapacklin_zpprfs
Refined solution with error bounds of complex Hermitian positive definite system of linear equations, multiple right-hand sides, packed storage
f07gw nagf_lapacklin_zpptri
Inverse of complex Hermitian positive definite matrix, matrix already factorized by f07gr, packed storage
f07ha nagf_lapacklin_dpbsv
Computes the solution to a real symmetric positive definite banded system of linear equations
f07hb nagf_lapacklin_dpbsvx
Uses the Cholesky factorization to compute the solution, error-bound and condition estimate for a real symmetric positive definite banded system of linear equations
f07hd nagf_lapacklin_dpbtrf
Cholesky factorization of real symmetric positive definite band matrix
f07he nagf_lapacklin_dpbtrs
Solution of real symmetric positive definite band system of linear equations, multiple right-hand sides, matrix already factorized by f07hd
f07hf nagf_lapacklin_dpbequ
Computes row and column scalings intended to equilibrate a real symmetric positive definite banded matrix and reduce its condition number
f07hg nagf_lapacklin_dpbcon
Estimate condition number of real symmetric positive definite band matrix, matrix already factorized by f07hd
f07hh nagf_lapacklin_dpbrfs
Refined solution with error bounds of real symmetric positive definite band system of linear equations, multiple right-hand sides
f07hn nagf_lapacklin_zpbsv
Computes the solution to a complex Hermitian positive definite banded system of linear equations
f07hp nagf_lapacklin_zpbsvx
Uses the Cholesky factorization to compute the solution, error-bound and condition estimate for a complex Hermitian positive definite banded system of linear equations
f07hr nagf_lapacklin_zpbtrf
Cholesky factorization of complex Hermitian positive definite band matrix
f07hs nagf_lapacklin_zpbtrs
Solution of complex Hermitian positive definite band system of linear equations, multiple right-hand sides, matrix already factorized by f07hr
f07ht nagf_lapacklin_zpbequ
Computes row and column scalings intended to equilibrate a complex Hermitian positive definite banded matrix and reduce its condition number
f07hu nagf_lapacklin_zpbcon
Estimate condition number of complex Hermitian positive definite band matrix, matrix already factorized by f07hr
f07hv nagf_lapacklin_zpbrfs
Refined solution with error bounds of complex Hermitian positive definite band system of linear equations, multiple right-hand sides
f07ja nagf_lapacklin_dptsv
Computes the solution to a real symmetric positive definite tridiagonal system of linear equations
f07jb nagf_lapacklin_dptsvx
Uses the LDLT factorization to compute the solution, error-bound and condition estimate for a real symmetric positive definite tridiagonal system of linear equations
f07jd nagf_lapacklin_dpttrf
Computes the LDLT factorization of a real symmetric positive definite tridiagonal matrix
f07je nagf_lapacklin_dpttrs
Solves a real symmetric positive definite tridiagonal system using the LDLT factorization computed by f07jd
f07jg nagf_lapacklin_dptcon
Computes the reciprocal of the condition number of a real symmetric positive definite tridiagonal system using the LDLT factorization computed by f07jd
f07jh nagf_lapacklin_dptrfs
Refined solution with error bounds of real symmetric positive definite tridiagonal system of linear equations, multiple right-hand sides
f07jn nagf_lapacklin_zptsv
Computes the solution to a complex Hermitian positive definite tridiagonal system of linear equations
f07jp nagf_lapacklin_zptsvx
Uses the LDLT factorization to compute the solution, error-bound and condition estimate for a complex Hermitian positive definite tridiagonal system of linear equations
f07jr nagf_lapacklin_zpttrf
Computes the LDLH factorization of a complex Hermitian positive definite tridiagonal matrix
f07js nagf_lapacklin_zpttrs
Solves a complex Hermitian positive definite tridiagonal system using the LDLH factorization computed by f07jr
f07ju nagf_lapacklin_zptcon
Computes the reciprocal of the condition number of a complex Hermitian positive definite tridiagonal system using the LDLH factorization computed by f07jr
f07jv nagf_lapacklin_zptrfs
Refined solution with error bounds of complex Hermitian positive definite tridiagonal system of linear equations, multiple right-hand sides
f07kd nagf_lapacklin_dpstrf
Cholesky factorization, with complete pivoting, of a real, symmetric, positive semidefinite matrix
f07kr nagf_lapacklin_zpstrf
Cholesky factorization of complex Hermitian positive semidefinite matrix
f07ma nagf_lapacklin_dsysv
Computes the solution to a real symmetric system of linear equations
f07mb nagf_lapacklin_dsysvx
Uses the diagonal pivoting factorization to compute the solution to a real symmetric system of linear equations
f07md nagf_lapacklin_dsytrf
Bunch–Kaufman factorization of real symmetric indefinite matrix
f07me nagf_lapacklin_dsytrs
Solution of real symmetric indefinite system of linear equations, multiple right-hand sides, matrix already factorized by f07md
f07mg nagf_lapacklin_dsycon
Estimate condition number of real symmetric indefinite matrix, matrix already factorized by f07md
f07mh nagf_lapacklin_dsyrfs
Refined solution with error bounds of real symmetric indefinite system of linear equations, multiple right-hand sides
f07mj nagf_lapacklin_dsytri
Inverse of real symmetric indefinite matrix, matrix already factorized by f07md
f07mn nagf_lapacklin_zhesv
Computes the solution to a complex Hermitian system of linear equations
f07mp nagf_lapacklin_zhesvx
Uses the diagonal pivoting factorization to compute the solution to a complex Hermitian system of linear equations
f07mr nagf_lapacklin_zhetrf
Bunch–Kaufman factorization of complex Hermitian indefinite matrix
f07ms nagf_lapacklin_zhetrs
Solution of complex Hermitian indefinite system of linear equations, multiple right-hand sides, matrix already factorized by f07mr
f07mu nagf_lapacklin_zhecon
Estimate condition number of complex Hermitian indefinite matrix, matrix already factorized by f07mr
f07mv nagf_lapacklin_zherfs
Refined solution with error bounds of complex Hermitian indefinite system of linear equations, multiple right-hand sides
f07mw nagf_lapacklin_zhetri
Inverse of complex Hermitian indefinite matrix, matrix already factorized by f07mr
f07nn nagf_lapacklin_zsysv
Computes the solution to a complex symmetric system of linear equations
f07np nagf_lapacklin_zsysvx
Uses the diagonal pivoting factorization to compute the solution to a complex symmetric system of linear equations
f07nr nagf_lapacklin_zsytrf
Bunch–Kaufman factorization of complex symmetric matrix
f07ns nagf_lapacklin_zsytrs
Solution of complex symmetric system of linear equations, multiple right-hand sides, matrix already factorized by f07nr
f07nu nagf_lapacklin_zsycon
Estimate condition number of complex symmetric matrix, matrix already factorized by f07nr
f07nv nagf_lapacklin_zsyrfs
Refined solution with error bounds of complex symmetric system of linear equations, multiple right-hand sides
f07nw nagf_lapacklin_zsytri
Inverse of complex symmetric matrix, matrix already factorized by f07nr
f07pa nagf_lapacklin_dspsv
Computes the solution to a real symmetric system of linear equations, packed storage
f07pb nagf_lapacklin_dspsvx
Uses the diagonal pivoting factorization to compute the solution to a real symmetric system of linear equations, packed storage. Error bounds and a condition estimate are also computed
f07pd nagf_lapacklin_dsptrf
Bunch–Kaufman factorization of real symmetric indefinite matrix, packed storage
f07pe nagf_lapacklin_dsptrs
Solution of real symmetric indefinite system of linear equations, multiple right-hand sides, matrix already factorized by f07pd, packed storage
f07pg nagf_lapacklin_dspcon
Estimate condition number of real symmetric indefinite matrix, matrix already factorized by f07pd, packed storage
f07ph nagf_lapacklin_dsprfs
Refined solution with error bounds of real symmetric indefinite system of linear equations, multiple right-hand sides, packed storage
f07pj nagf_lapacklin_dsptri
Inverse of real symmetric indefinite matrix, matrix already factorized by f07pd, packed storage
f07pn nagf_lapacklin_zhpsv
Computes the solution to a complex Hermitian system of linear equations, packed storage
f07pp nagf_lapacklin_zhpsvx
Uses the diagonal pivoting factorization to compute the solution to a complex, Hermitian, system of linear equations, error bounds and condition estimates. Packed storage
f07pr nagf_lapacklin_zhptrf
Bunch–Kaufman factorization of complex Hermitian indefinite matrix, packed storage
f07ps nagf_lapacklin_zhptrs
Solution of complex Hermitian indefinite system of linear equations, multiple right-hand sides, matrix already factorized by f07pr, packed storage
f07pu nagf_lapacklin_zhpcon
Estimate condition number of complex Hermitian indefinite matrix, matrix already factorized by f07pr, packed storage
f07pv nagf_lapacklin_zhprfs
Refined solution with error bounds of complex Hermitian indefinite system of linear equations, multiple right-hand sides, packed storage
f07pw nagf_lapacklin_zhptri
Inverse of complex Hermitian indefinite matrix, matrix already factorized by f07pr, packed storage
f07qn nagf_lapacklin_zspsv
Computes the solution to a complex symmetric system of linear equations, packed storage
f07qp nagf_lapacklin_zspsvx
Uses the diagonal pivoting factorization to compute the solution to a complex, symmetric, system of linear equations, error bounds and condition estimates. Packed storage
f07qr nagf_lapacklin_zsptrf
Bunch–Kaufman factorization of complex symmetric matrix, packed storage
f07qs nagf_lapacklin_zsptrs
Solution of complex symmetric system of linear equations, multiple right-hand sides, matrix already factorized by f07qr, packed storage
f07qu nagf_lapacklin_zspcon
Estimate condition number of complex symmetric matrix, matrix already factorized by f07qr, packed storage
f07qv nagf_lapacklin_zsprfs
Refined solution with error bounds of complex symmetric system of linear equations, multiple right-hand sides, packed storage
f07qw nagf_lapacklin_zsptri
Inverse of complex symmetric matrix, matrix already factorized by f07qr, packed storage
f07te nagf_lapacklin_dtrtrs
Solution of real triangular system of linear equations, multiple right-hand sides
f07tg nagf_lapacklin_dtrcon
Estimate condition number of real triangular matrix
f07th nagf_lapacklin_dtrrfs
Error bounds for solution of real triangular system of linear equations, multiple right-hand sides
f07tj nagf_lapacklin_dtrtri
Inverse of real triangular matrix
f07ts nagf_lapacklin_ztrtrs
Solution of complex triangular system of linear equations, multiple right-hand sides
f07tu nagf_lapacklin_ztrcon
Estimate condition number of complex triangular matrix
f07tv nagf_lapacklin_ztrrfs
Error bounds for solution of complex triangular system of linear equations, multiple right-hand sides
f07tw nagf_lapacklin_ztrtri
Inverse of complex triangular matrix
f07ue nagf_lapacklin_dtptrs
Solution of real triangular system of linear equations, multiple right-hand sides, packed storage
f07ug nagf_lapacklin_dtpcon
Estimate condition number of real triangular matrix, packed storage
f07uh nagf_lapacklin_dtprfs
Error bounds for solution of real triangular system of linear equations, multiple right-hand sides, packed storage
f07uj nagf_lapacklin_dtptri
Inverse of real triangular matrix, packed storage
f07us nagf_lapacklin_ztptrs
Solution of complex triangular system of linear equations, multiple right-hand sides, packed storage
f07uu nagf_lapacklin_ztpcon
Estimate condition number of complex triangular matrix, packed storage
f07uv nagf_lapacklin_ztprfs
Error bounds for solution of complex triangular system of linear equations, multiple right-hand sides, packed storage
f07uw nagf_lapacklin_ztptri
Inverse of complex triangular matrix, packed storage
f07ve nagf_lapacklin_dtbtrs
Solution of real band triangular system of linear equations, multiple right-hand sides
f07vg nagf_lapacklin_dtbcon
Estimate condition number of real band triangular matrix
f07vh nagf_lapacklin_dtbrfs
Error bounds for solution of real band triangular system of linear equations, multiple right-hand sides
f07vs nagf_lapacklin_ztbtrs
Solution of complex band triangular system of linear equations, multiple right-hand sides
f07vu nagf_lapacklin_ztbcon
Estimate condition number of complex band triangular matrix
f07vv nagf_lapacklin_ztbrfs
Error bounds for solution of complex band triangular system of linear equations, multiple right-hand sides
f07wd nagf_lapacklin_dpftrf
Cholesky factorization of real symmetric positive definite matrix, Rectangular Full Packed format
f07we nagf_lapacklin_dpftrs
Solution of real symmetric positive definite system of linear equations, multiple right-hand sides, coefficient matrix already factorized by f07wd, Rectangular Full Packed format
f07wj nagf_lapacklin_dpftri
Inverse of real symmetric positive definite matrix, matrix already factorized by f07wd, Rectangular Full Packed format
f07wk nagf_lapacklin_dtftri
Inverse of real triangular matrix, Rectangular Full Packed format
f07wr nagf_lapacklin_zpftrf
Cholesky factorization of complex Hermitian positive definite matrix, Rectangular Full Packed format
f07ws nagf_lapacklin_zpftrs
Solution of complex Hermitian positive definite system of linear equations, multiple right-hand sides, coefficient matrix already factorized by f07wr, Rectangular Full Packed format
f07ww nagf_lapacklin_zpftri
Inverse of complex Hermitian positive definite matrix, matrix already factorized by f07wr, Rectangular Full Packed format
f07wx nagf_lapacklin_ztftri
Inverse of complex triangular matrix, Rectangular Full Packed format
Back to F07 Chapter Summary

F08 – Least Squares and Eigenvalue Problems (LAPACK)

Examples of routines and methods in this chapter:

f08aa nagf_lapackeig_dgels
Solves a real linear least squares problem of full rank
f08ab nagf_lapackeig_dgeqrt
Performs a QR factorization of real general rectangular matrix, with explicit blocking
f08ac nagf_lapackeig_dgemqrt
Applies the orthogonal transformation determined by f08ab
f08ae nagf_lapackeig_dgeqrf
Performs a QR factorization of real general rectangular matrix
f08af nagf_lapackeig_dorgqr
Forms all or part of orthogonal Q from QR factorization determined by f08ae, f08be and f08bf
f08ag nagf_lapackeig_dormqr
Applies an orthogonal transformation determined by f08ae, f08be and f08bf
f08ah nagf_lapackeig_dgelqf
Performs a LQ factorization of real general rectangular matrix
f08aj nagf_lapackeig_dorglq
Forms all or part of orthogonal Q from LQ factorization determined by f08ah
f08ak nagf_lapackeig_dormlq
Applies the orthogonal transformation determined by f08ah
f08an nagf_lapackeig_zgels
Solves a complex linear least problem of full rank
f08ap nagf_lapackeig_zgeqrt
Performs a QR factorization of complex general rectangular matrix using recursive algorithm
f08aq nagf_lapackeig_zgemqrt
Applies the unitary transformation determined by f08ap
f08as nagf_lapackeig_zgeqrf
Performs a QR factorization of complex general rectangular matrix
f08at nagf_lapackeig_zungqr
Forms all or part of unitary Q from QR factorization determined by f08as, f08bs and f08bt
f08au nagf_lapackeig_zunmqr
Applies a unitary transformation determined by f08as, f08bs and f08bt
f08av nagf_lapackeig_zgelqf
Performs a LQ factorization of complex general rectangular matrix
f08aw nagf_lapackeig_zunglq
Forms all or part of unitary Q from LQ factorization determined by f08av
f08ax nagf_lapackeig_zunmlq
Applies the unitary transformation determined by f08av
f08ba nagf_lapackeig_dgelsy
Computes the minimum-norm solution to a real linear least squares problem
f08bb nagf_lapackeig_dtpqrt
QR factorization of real general triangular-pentagonal matrix
f08bc nagf_lapackeig_dtpmqrt
Applies the orthogonal transformation determined by f08bb
f08be nagf_lapackeig_dgeqpf
QR factorization, with column pivoting, of real general rectangular matrix
f08bf nagf_lapackeig_dgeqp3
QR factorization, with column pivoting, using BLAS-3, of real general rectangular matrix
f08bh nagf_lapackeig_dtzrzf
Reduces a real upper trapezoidal matrix to upper triangular form
f08bk nagf_lapackeig_dormrz
Applies the orthogonal transformation determined by f08bh
f08bn nagf_lapackeig_zgelsy
Computes the minimum-norm solution to a complex linear least squares problem
f08bp nagf_lapackeig_ztpqrt
QR factorization of complex triangular-pentagonal matrix
f08bq nagf_lapackeig_ztpmqrt
Applies the unitary transformation determined by f08bp
f08bs nagf_lapackeig_zgeqpf
QR factorization, with column pivoting, of complex general rectangular matrix
f08bt nagf_lapackeig_zgeqp3
QR factorization, with column pivoting, using BLAS-3, of complex general rectangular matrix
f08bv nagf_lapackeig_ztzrzf
Reduces a complex upper trapezoidal matrix to upper triangular form
f08bx nagf_lapackeig_zunmrz
Applies the unitary transformation determined by f08bv
f08ce nagf_lapackeig_dgeqlf
QL factorization of real general rectangular matrix
f08cf nagf_lapackeig_dorgql
Form all or part of orthogonal Q from QL factorization determined by f08ce
f08cg nagf_lapackeig_dormql
Applies the orthogonal transformation determined by f08ce
f08ch nagf_lapackeig_dgerqf
RQ factorization of real general rectangular matrix
f08cj nagf_lapackeig_dorgrq
Form all or part of orthogonal Q from RQ factorization determined by f08ch
f08ck nagf_lapackeig_dormrq
Applies the orthogonal transformation determined by f08ch
f08cs nagf_lapackeig_zgeqlf
QL factorization of complex general rectangular matrix
f08ct nagf_lapackeig_zungql
Form all or part of unitary Q from QL factorization determined by f08cs
f08cu nagf_lapackeig_zunmql
Applies the unitary transformation determined by f08cs
f08cv nagf_lapackeig_zgerqf
RQ factorization of complex general rectangular matrix
f08cw nagf_lapackeig_zungrq
Form all or part of unitary Q from RQ factorization determined by f08cv
f08cx nagf_lapackeig_zunmrq
Applies the unitary transformation determined by f08cv
f08fa nagf_lapackeig_dsyev
Computes all eigenvalues and, optionally, eigenvectors of a real symmetric matrix
f08fb nagf_lapackeig_dsyevx
Computes selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix
f08fc nagf_lapackeig_dsyevd
Computes all eigenvalues and, optionally, all eigenvectors of real symmetric matrix (divide-and-conquer)
f08fd nagf_lapackeig_dsyevr
Computes selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix (Relatively Robust Representations)
f08fe nagf_lapackeig_dsytrd
Orthogonal reduction of real symmetric matrix to symmetric tridiagonal form
f08ff nagf_lapackeig_dorgtr
Generate orthogonal transformation matrix from reduction to tridiagonal form determined by f08fe
f08fg nagf_lapackeig_dormtr
Applies the orthogonal transformation determined by f08fe
f08fl nagf_lapackeig_ddisna
Computes the reciprocal condition numbers for the eigenvectors of a real symmetric or complex Hermitian matrix or for the left or right singular vectors of a general matrix
f08fn nagf_lapackeig_zheev
Computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix
f08fp nagf_lapackeig_zheevx
Computes selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix
f08fq nagf_lapackeig_zheevd
Computes all eigenvalues and, optionally, all eigenvectors of complex Hermitian matrix (divide-and-conquer)
f08fr nagf_lapackeig_zheevr
Computes selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix (Relatively Robust Representations)
f08fs nagf_lapackeig_zhetrd
Unitary reduction of complex Hermitian matrix to real symmetric tridiagonal form
f08ft nagf_lapackeig_zungtr
Generate unitary transformation matrix from reduction to tridiagonal form determined by f08fs
f08fu nagf_lapackeig_zunmtr
Applies the unitary transformation matrix determined by f08fs
f08ga nagf_lapackeig_dspev
Computes all eigenvalues and, optionally, eigenvectors of a real symmetric matrix, packed storage
f08gb nagf_lapackeig_dspevx
Computes selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix, packed storage
f08gc nagf_lapackeig_dspevd
Computes all eigenvalues and, optionally, all eigenvectors of real symmetric matrix, packed storage (divide-and-conquer or Pal–Walker–Kahan variant of the QL or QR algorithm)
f08ge nagf_lapackeig_dsptrd
Orthogonal reduction of real symmetric matrix to symmetric tridiagonal form, packed storage
f08gf nagf_lapackeig_dopgtr
Generate orthogonal transformation matrix from reduction to tridiagonal form determined by f08ge
f08gg nagf_lapackeig_dopmtr
Applies the orthogonal transformation determined by f08ge
f08gn nagf_lapackeig_zhpev
Computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix, packed storage
f08gp nagf_lapackeig_zhpevx
Computes selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix, packed storage
f08gq nagf_lapackeig_zhpevd
Computes all eigenvalues and, optionally, all eigenvectors of complex Hermitian matrix, packed storage (divide-and-conquer or Pal–Walker–Kahan variant of the QL or QR algorithm)
f08gs nagf_lapackeig_zhptrd
Performs a unitary reduction of complex Hermitian matrix to real symmetric tridiagonal form, packed storage
f08gt nagf_lapackeig_zupgtr
Generates a unitary transformation matrix from reduction to tridiagonal form determined by f08gs
f08gu nagf_lapackeig_zupmtr
Applies the unitary transformation matrix determined by f08gs
f08ha nagf_lapackeig_dsbev
Computes all eigenvalues and, optionally, eigenvectors of a real symmetric band matrix
f08hb nagf_lapackeig_dsbevx
Computes selected eigenvalues and, optionally, eigenvectors of a real symmetric band matrix
f08hc nagf_lapackeig_dsbevd
Computes all eigenvalues and, optionally, all eigenvectors of real symmetric band matrix (divide-and-conquer or Pal–Walker–Kahan variant of the QL or QR algorithm)
f08he nagf_lapackeig_dsbtrd
Performs an orthogonal reduction of real symmetric band matrix to symmetric tridiagonal form
f08hn nagf_lapackeig_zhbev
Computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix
f08hp nagf_lapackeig_zhbevx
Computes selected eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix
f08hq nagf_lapackeig_zhbevd
Computes all eigenvalues and, optionally, all eigenvectors of complex Hermitian band matrix (divide-and-conquer)
f08hs nagf_lapackeig_zhbtrd
Performs a unitary reduction of complex Hermitian band matrix to real symmetric tridiagonal form
f08ja nagf_lapackeig_dstev
Computes all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix
f08jb nagf_lapackeig_dstevx
Computes selected eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix
f08jc nagf_lapackeig_dstevd
Computes all eigenvalues and, optionally, all eigenvectors of real symmetric tridiagonal matrix (divide-and-conquer)
f08jd nagf_lapackeig_dstevr
Computes selected eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix (Relatively Robust Representations)
f08je nagf_lapackeig_dsteqr
Computes all eigenvalues and eigenvectors of real symmetric tridiagonal matrix, reduced from real symmetric matrix using the implicit QL or QR algorithm
f08jf nagf_lapackeig_dsterf
Computes all eigenvalues of real symmetric tridiagonal matrix, root-free variant of the QL or QR algorithm
f08jg nagf_lapackeig_dpteqr
Computes all eigenvalues and eigenvectors of real symmetric positive definite tridiagonal matrix, reduced from real symmetric positive definite matrix
f08jh nagf_lapackeig_dstedc
Computes all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix or a matrix reduced to this form (divide-and-conquer)
f08jj nagf_lapackeig_dstebz
Computes selected eigenvalues of real symmetric tridiagonal matrix by bisection
f08jk nagf_lapackeig_dstein
Computes selected eigenvectors of real symmetric tridiagonal matrix by inverse iteration, storing eigenvectors in real array
f08jl nagf_lapackeig_dstegr
Computes selected eigenvalues and, optionally, the corresponding eigenvectors of a real symmetric tridiagonal matrix or a symmetric matrix reduced to this form (Relatively Robust Representations)
f08js nagf_lapackeig_zsteqr
Computes all eigenvalues and eigenvectors of real symmetric tridiagonal matrix, reduced from complex Hermitian matrix, using the implicit QL or QR algorithm
f08ju nagf_lapackeig_zpteqr
Computes all eigenvalues and eigenvectors of real symmetric positive definite tridiagonal matrix, reduced from complex Hermitian positive definite matrix
f08jv nagf_lapackeig_zstedc
Computes all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix or a complex Hermitian matrix reduced to this form (divide-and-conquer)
f08jx nagf_lapackeig_zstein
Computes selected eigenvectors of real symmetric tridiagonal matrix by inverse iteration, storing eigenvectors in complex array
f08jy nagf_lapackeig_zstegr
Computes selected eigenvalues and, optionally, the corresponding eigenvectors of a real symmetric tridiagonal matrix or a complex Hermitian matrix reduced to this form (Relatively Robust Representations)
f08ka nagf_lapackeig_dgelss
Computes the minimum-norm solution to a real linear least squares problem using singular value decomposition
f08kb nagf_lapackeig_dgesvd
Computes the singular value decomposition of a real matrix, optionally computing the left and/or right singular vectors
f08kc nagf_lapackeig_dgelsd
Computes the minimum-norm solution to a real linear least squares problem using singular value decomposition (divide-and-conquer)
f08kd nagf_lapackeig_dgesdd
Computes the singular value decomposition of a real matrix, optionally computing the left and/or right singular vectors (divide-and-conquer)
f08ke nagf_lapackeig_dgebrd
Performs an orthogonal reduction of real general rectangular matrix to bidiagonal form
f08kf nagf_lapackeig_dorgbr
Generates an orthogonal transformation matrices from reduction to bidiagonal form determined by f08ke
f08kg nagf_lapackeig_dormbr
Applies the orthogonal transformations from reduction to bidiagonal form determined by f08ke
f08kh nagf_lapackeig_dgejsv
Computes the singular value decomposition of a real matrix, optionally computing the left and/or right singular vectors (preconditioned Jacobi)
f08kj nagf_lapackeig_dgesvj
Computes the singular value decomposition of a real matrix, optionally computing the left and/or right singular vectors (fast Jacobi)
f08kn nagf_lapackeig_zgelss
Computes the minimum-norm solution to a complex linear least squares problem using singular value decomposition
f08kp nagf_lapackeig_zgesvd
Computes the singular value decomposition of a complex matrix, optionally computing the left and/or right singular vectors
f08kq nagf_lapackeig_zgelsd
Computes the minimum-norm solution to a complex linear least squares problem using singular value decomposition (divide-and-conquer)
f08kr nagf_lapackeig_zgesdd
Computes the singular value decomposition of a complex matrix, optionally computing the left and/or right singular vectors (divide-and-conquer)
f08ks nagf_lapackeig_zgebrd
Performs a unitary reduction of complex general rectangular matrix to bidiagonal form
f08kt nagf_lapackeig_zungbr
Generates unitary transformation matrices from the reduction to bidiagonal form determined by f08ks
f08ku nagf_lapackeig_zunmbr
Applies the unitary transformations from reduction to bidiagonal form determined by f08ks
f08le nagf_lapackeig_dgbbrd
Performs a reduction of real rectangular band matrix to upper bidiagonal form
f08ls nagf_lapackeig_zgbbrd
Reduction of complex rectangular band matrix to upper bidiagonal form
f08md nagf_lapackeig_dbdsdc
Computes the singular value decomposition of a real bidiagonal matrix, optionally computing the singular vectors (divide-and-conquer)
f08me nagf_lapackeig_dbdsqr
Performs an SVD of real bidiagonal matrix reduced from real general matrix
f08ms nagf_lapackeig_zbdsqr
Performs an SVD of real bidiagonal matrix reduced from complex general matrix
f08na nagf_lapackeig_dgeev
Computes all eigenvalues and, optionally, left and/or right eigenvectors of a real nonsymmetric matrix
f08nb nagf_lapackeig_dgeevx
Computes all eigenvalues and, optionally, left and/or right eigenvectors of a real nonsymmetric matrix; also, optionally, the balancing transformation, the reciprocal condition numbers for the eigenvalues and for the right eigenvectors
f08ne nagf_lapackeig_dgehrd
Performs an orthogonal reduction of real general matrix to upper Hessenberg form
f08nf nagf_lapackeig_dorghr
Generates an orthogonal transformation matrix from reduction to Hessenberg form determined by f08ne
f08ng nagf_lapackeig_dormhr
Applies the orthogonal transformation matrix from reduction to Hessenberg form determined by f08ne
f08nh nagf_lapackeig_dgebal
Balances a real general matrix
f08nj nagf_lapackeig_dgebak
Transforms eigenvectors of real balanced matrix to those of original matrix supplied to f08nh
f08nn nagf_lapackeig_zgeev
Computes all eigenvalues and, optionally, left and/or right eigenvectors of a complex nonsymmetric matrix
f08np nagf_lapackeig_zgeevx
Computes all eigenvalues and, optionally, left and/or right eigenvectors of a complex nonsymmetric matrix; also, optionally, the balancing transformation, the reciprocal condition numbers for the eigenvalues and for the right eigenvectors
f08ns nagf_lapackeig_zgehrd
Performs a unitary reduction of complex general matrix to upper Hessenberg form
f08nt nagf_lapackeig_zunghr
Generates a unitary transformation matrix from reduction to Hessenberg form determined by f08ns
f08nu nagf_lapackeig_zunmhr
Applies the unitary transformation matrix from reduction to Hessenberg form determined by f08ns
f08nv nagf_lapackeig_zgebal
Balances a complex general matrix
f08nw nagf_lapackeig_zgebak
Transforms eigenvectors of complex balanced matrix to those of original matrix supplied to f08nv
f08pa nagf_lapackeig_dgees
Computes for real square nonsymmetric matrix, the eigenvalues, the real Schur form, and, optionally, the matrix of Schur vectors
f08pb nagf_lapackeig_dgeesx
Computes for real square nonsymmetric matrix, the eigenvalues, the real Schur form, and, optionally, the matrix of Schur vectors; also, optionally, computes reciprocal condition numbers for selected eigenvalues
f08pe nagf_lapackeig_dhseqr
Computes the eigenvalues and Schur factorization of real upper Hessenberg matrix reduced from real general matrix
f08pk nagf_lapackeig_dhsein
Computes selected right and/or left eigenvectors of real upper Hessenberg matrix by inverse iteration
f08pn nagf_lapackeig_zgees
Computes for complex square nonsymmetric matrix, the eigenvalues, the Schur form, and, optionally, the matrix of Schur vectors
f08pp nagf_lapackeig_zgeesx
Computes for real square nonsymmetric matrix, the eigenvalues, the Schur form, and, optionally, the matrix of Schur vectors; also computes a reciprocal condition number for the average of the selected eigenvalues and for the right invariant subspace corresponding to these eigenvalues
f08ps nagf_lapackeig_zhseqr
Computes the eigenvalues and Schur factorization of complex upper Hessenberg matrix reduced from complex general matrix
f08px nagf_lapackeig_zhsein
Computes selected right and/or left eigenvectors of complex upper Hessenberg matrix by inverse iteration
f08qf nagf_lapackeig_dtrexc
Reorders a Schur factorization of real matrix using orthogonal similarity transformation
f08qg nagf_lapackeig_dtrsen
Reorders a Schur factorization of real matrix, form orthonormal basis of right invariant subspace for selected eigenvalues, with estimates of sensitivities
f08qh nagf_lapackeig_dtrsyl
Solves the real Sylvester matrix equation AX+XB=C, A and B are upper quasi-triangular or transposes
f08qk nagf_lapackeig_dtrevc
Computes left and right eigenvectors of real upper quasi-triangular matrix
f08ql nagf_lapackeig_dtrsna
Computes estimates of sensitivities of selected eigenvalues and eigenvectors of real upper quasi-triangular matrix
f08qt nagf_lapackeig_ztrexc
Reorders a Schur factorization of complex matrix using unitary similarity transformation
f08qu nagf_lapackeig_ztrsen
Reorders a Schur factorization of complex matrix, form orthonormal basis of right invariant subspace for selected eigenvalues, with estimates of sensitivities
f08qv nagf_lapackeig_ztrsyl
Solves the complex Sylvester matrix equation AX+XB=C, A and B are upper triangular or conjugate-transposes
f08qx nagf_lapackeig_ztrevc
Computes left and right eigenvectors of complex upper triangular matrix
f08qy nagf_lapackeig_ztrsna
Computes estimates of sensitivities of selected eigenvalues and eigenvectors of complex upper triangular matrix
f08ra nagf_lapackeig_dorcsd
Computes the CS decomposition of an orthogonal matrix partitioned into four real submatrices
f08rn nagf_lapackeig_zuncsd
Computes the CS decomposition of a unitary matrix partitioned into four complex submatrices
f08sa nagf_lapackeig_dsygv
Computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem
f08sb nagf_lapackeig_dsygvx
Computes selected eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem
f08sc nagf_lapackeig_dsygvd
Computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem (divide-and-conquer)
f08se nagf_lapackeig_dsygst
Performs a reduction to standard form of real symmetric-definite generalized eigenproblem Ax=λBx, ABx=λx or BAx=λx, B factorized by f07fd
f08sn nagf_lapackeig_zhegv
Computes all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem
f08sp nagf_lapackeig_zhegvx
Computes selected eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem
f08sq nagf_lapackeig_zhegvd
Computes all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem (divide-and-conquer)
f08ss nagf_lapackeig_zhegst
Performs a reduction to standard form of complex Hermitian-definite generalized eigenproblem Ax=λBx, ABx=λx or BAx=λx, B factorized by f07fr
f08ta nagf_lapackeig_dspgv
Computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, packed storage
f08tb nagf_lapackeig_dspgvx
Computes selected eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, packed storage
f08tc nagf_lapackeig_dspgvd
Computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, packed storage (divide-and-conquer)
f08te nagf_lapackeig_dspgst
Performs a reduction to standard form of real symmetric-definite generalized eigenproblem Ax=λBx, ABx=λx or BAx=λx, packed storage, B factorized by f07gd
f08tn nagf_lapackeig_zhpgv
Computes all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, packed storage
f08tp nagf_lapackeig_zhpgvx
Computes selected eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, packed storage
f08tq nagf_lapackeig_zhpgvd
Computes selected eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, packed storage (divide-and-conquer)
f08ts nagf_lapackeig_zhpgst
Performs a reduction to standard form of complex Hermitian-definite generalized eigenproblem Ax=λBx, ABx=λx or BAx=λx, packed storage, B factorized by f07gr
f08ua nagf_lapackeig_dsbgv
Computes all the eigenvalues, and optionally, the eigenvectors of a real banded generalized symmetric-definite eigenproblem
f08ub nagf_lapackeig_dsbgvx
Computes selected eigenvalues, and optionally, the eigenvectors of a real banded generalized symmetric-definite eigenproblem
f08uc nagf_lapackeig_dsbgvd
Computes all the eigenvalues, and optionally, the eigenvectors of a real banded generalized symmetric-definite eigenproblem (divide-and-conquer)
f08ue nagf_lapackeig_dsbgst
Performs a reduction of real symmetric-definite banded generalized eigenproblem Ax=λBx to standard form Cy=λy, such that C has the same bandwidth as A
f08uf nagf_lapackeig_dpbstf
Computes a split Cholesky factorization of real symmetric positive definite band matrix A
f08un nagf_lapackeig_zhbgv
Computes all the eigenvalues, and optionally, the eigenvectors of a complex banded generalized Hermitian-definite eigenproblem
f08up nagf_lapackeig_zhbgvx
Computes selected eigenvalues, and optionally, the eigenvectors of a complex banded generalized Hermitian-definite eigenproblem
f08uq nagf_lapackeig_zhbgvd
Computes all the eigenvalues, and optionally, the eigenvectors of a complex banded generalized Hermitian-definite eigenproblem (divide-and-conquer)
f08us nagf_lapackeig_zhbgst
Performs a reduction of complex Hermitian-definite banded generalized eigenproblem Ax=λBx to standard form Cy=λy, such that C has the same bandwidth as A
f08ut nagf_lapackeig_zpbstf
Computes a split Cholesky factorization of complex Hermitian positive definite band matrix A
f08va nagf_lapackeig_dggsvd
Computes the generalized singular value decomposition of a real matrix pair
f08vc nagf_lapackeig_dggsvd3
Computes, using BLAS-3, the generalized singular value decomposition of a real matrix pair
f08ve nagf_lapackeig_dggsvp
Produces orthogonal matrices that simultaneously reduce the m by n matrix A and the p by n matrix B to upper triangular form
f08vg nagf_lapackeig_dggsvp3
Produces orthogonal matrices, using BLAS-3, that simultaneously reduce the m by n matrix A and the p by n matrix B to upper triangular form
f08vn nagf_lapackeig_zggsvd
Computes the generalized singular value decomposition of a complex matrix pair
f08vq nagf_lapackeig_zggsvd3
Computes, using BLAS-3, the generalized singular value decomposition of a complex matrix pair
f08vs nagf_lapackeig_zggsvp
Produces unitary matrices that simultaneously reduce the complex, m by n, matrix A and the complex, p by n, matrix B to upper triangular form
f08vu nagf_lapackeig_zggsvp3
Produces unitary matrices, using BLAS-3, that simultaneously reduce the complex, m by n, matrix A and the complex, p by n, matrix B to upper triangular form
f08wa nagf_lapackeig_dggev
Computes, for a real nonsymmetric matrix pair, the generalized eigenvalues, and optionally, the left and/or right generalized eigenvectors
f08wb nagf_lapackeig_dggevx
Computes, for a real nonsymmetric matrix pair, the generalized eigenvalues, and optionally, the left and/or right generalized eigenvectors; also, optionally, the balancing transformation, the reciprocal condition numbers for the eigenvalues and for the right eigenvectors
f08wc nagf_lapackeig_dggev3
Computes, for a real nonsymmetric matrix pair, using BLAS-3, the generalized eigenvalues, and optionally, the left and/or right generalized eigenvectors
f08we nagf_lapackeig_dgghrd
Performs an orthogonal reduction of a pair of real general matrices to generalized upper Hessenberg form
f08wf nagf_lapackeig_dgghd3
Performs, using BLAS-3, an orthogonal reduction of a pair of real general matrices to generalized upper Hessenberg form
f08wh nagf_lapackeig_dggbal
Balances a pair of real, square, matrices
f08wj nagf_lapackeig_dggbak
Transforms eigenvectors of a pair of real balanced matrices to those of original matrix pair supplied to f08wh
f08wn nagf_lapackeig_zggev
Computes, for a complex nonsymmetric matrix pair, the generalized eigenvalues, and optionally, the left and/or right generalized eigenvectors
f08wp nagf_lapackeig_zggevx
Computes, for a complex nonsymmetric matrix pair, the generalized eigenvalues, and optionally, the left and/or right generalized eigenvectors; also, optionally, the balancing transformation, the reciprocal condition numbers for the eigenvalues and for the right eigenvectors
f08wq nagf_lapackeig_zggev3
Computes, for a complex nonsymmetric matrix pair, using BLAS-3, the generalized eigenvalues, and optionally, the left and/or right generalized eigenvectors
f08ws nagf_lapackeig_zgghrd
Performs a unitary reduction of a pair of complex general matrices to generalized upper Hessenberg form
f08wt nagf_lapackeig_zgghd3
Performs, using BLAS-3, a unitary reduction of a pair of complex general matrices to generalized upper Hessenberg form
f08wv nagf_lapackeig_zggbal
Balances a pair of complex, square, matrices
f08ww nagf_lapackeig_zggbak
Transforms eigenvectors of a pair of complex balanced matrices to those of original matrix pair supplied to f08wv
f08xa nagf_lapackeig_dgges
Computes, for a real nonsymmetric matrix pair, the generalized eigenvalues, the generalized real Schur form and, optionally, the left and/or right matrices of Schur vectors
f08xb nagf_lapackeig_dggesx
Computes, for a real nonsymmetric matrix pair, the generalized eigenvalues, the generalized real Schur form and, optionally, the left and/or right matrices of Schur vectors; also, optionally, computes reciprocal condition numbers for selected eigenvalues
f08xc nagf_lapackeig_dgges3
Computes, for a real nonsymmetric matrix pair, using BLAS-3, the generalized eigenvalues, the generalized real Schur form and, optionally, the left and/or right matrices of Schur vectors
f08xe nagf_lapackeig_dhgeqz
Computes eigenvalues and generalized Schur factorization of real generalized upper Hessenberg form reduced from a pair of real general matrices
f08xn nagf_lapackeig_zgges
Computes, for a complex nonsymmetric matrix pair, the generalized eigenvalues, the generalized complex Schur form and, optionally, the left and/or right matrices of Schur vectors
f08xp nagf_lapackeig_zggesx
Computes, for a complex nonsymmetric matrix pair, the generalized eigenvalues, the generalized complex Schur form and, optionally, the left and/or right matrices of Schur vectors; also, optionally, computes reciprocal condition numbers for selected eigenvalues
f08xq nagf_lapackeig_zgges3
Computes, for a complex nonsymmetric matrix pair, using BLAS-3, the generalized eigenvalues, the generalized complex Schur form and, optionally, the left and/or right matrices of Schur vectors
f08xs nagf_lapackeig_zhgeqz
Eigenvalues and generalized Schur factorization of complex generalized upper Hessenberg form reduced from a pair of complex, square, matrices
f08ye nagf_lapackeig_dtgsja
Computes the generalized singular value decomposition of a real upper triangular (or trapezoidal) matrix pair
f08yf nagf_lapackeig_dtgexc
Reorders the generalized real Schur decomposition of a real matrix pair using an orthogonal equivalence transformation
f08yg nagf_lapackeig_dtgsen
Reorders the generalized real Schur decomposition of a real matrix pair using an orthogonal equivalence transformation, computes the generalized eigenvalues of the reordered pair and, optionally, computes the estimates of reciprocal condition numbers for eigenvalues and eigenspaces
f08yh nagf_lapackeig_dtgsyl
Solves the real-valued, generalized, quasi-trangular, Sylvester equation
f08yk nagf_lapackeig_dtgevc
Computes right and left generalized eigenvectors of the matrix pair (A,B) which is assumed to be in generalized upper Schur form
f08yl nagf_lapackeig_dtgsna
Estimates reciprocal condition numbers for specified eigenvalues and/or eigenvectors of a real matrix pair in generalized real Schur canonical form
f08ys nagf_lapackeig_ztgsja
Computes the generalized singular value decomposition of a complex upper triangular (or trapezoidal) matrix pair
f08yt nagf_lapackeig_ztgexc
Reorders the generalized Schur decomposition of a complex matrix pair using an unitary equivalence transformation
f08yu nagf_lapackeig_ztgsen
Reorders the generalized Schur decomposition of a complex matrix pair using an unitary equivalence transformation, computes the generalized eigenvalues of the reordered pair and, optionally, computes the estimates of reciprocal condition numbers for eigenvalues and eigenspaces
f08yv nagf_lapackeig_ztgsyl
Solves the complex generalized Sylvester equation
f08yx nagf_lapackeig_ztgevc
Computes left and right eigenvectors of a pair of complex upper triangular matrices
f08yy nagf_lapackeig_ztgsna
Estimates reciprocal condition numbers for specified eigenvalues and/or eigenvectors of a complex matrix pair in generalized Schur canonical form
f08za nagf_lapackeig_dgglse
Solves the real linear equality-constrained least squares (LSE) problem
f08zb nagf_lapackeig_dggglm
Solves a real general Gauss–Markov linear model (GLM) problem
f08ze nagf_lapackeig_dggqrf
Computes a generalized QR factorization of a real matrix pair
f08zf nagf_lapackeig_dggrqf
Computes a generalized RQ factorization of a real matrix pair
f08zn nagf_lapackeig_zgglse
Solves the complex linear equality-constrained least squares (LSE) problem
f08zp nagf_lapackeig_zggglm
Solves a complex general Gauss–Markov linear model (GLM) problem
f08zs nagf_lapackeig_zggqrf
Computes a generalized QR factorization of a complex matrix pair
f08zt nagf_lapackeig_zggrqf
Computes a generalized RQ factorization of a complex matrix pair
Back to F08 Chapter Summary

F10 – Randomized Numerical Linear Algebra

Examples of routines and methods in this chapter:

Back to F10 Chapter Summary

F11 – Large Scale Linear Systems

Examples of routines and methods in this chapter:

f11bd nagf_sparse_real_gen_basic_setup
Real sparse nonsymmetric linear systems, setup for f11be
f11be nagf_sparse_real_gen_basic_solver
Real sparse nonsymmetric linear systems, preconditioned RGMRES, CGS, Bi-CGSTAB or TFQMR method
f11bf nagf_sparse_real_gen_basic_diag
Real sparse nonsymmetric linear systems, diagnostic for f11be
f11br nagf_sparse_complex_gen_basic_setup
Complex sparse non-Hermitian linear systems, setup for f11bs
f11bs nagf_sparse_complex_gen_basic_solver
Complex sparse non-Hermitian linear systems, preconditioned RGMRES, CGS, Bi-CGSTAB or TFQMR method
f11bt nagf_sparse_complex_gen_basic_diag
Complex sparse non-Hermitian linear systems, diagnostic for f11bs
f11da nagf_sparse_real_gen_precon_ilu
Real sparse nonsymmetric linear systems, incomplete LU factorization
f11db nagf_sparse_real_gen_precon_ilu_solve
Solution of linear system involving incomplete LU preconditioning matrix generated by f11da
f11dc nagf_sparse_real_gen_solve_ilu
Solution of real sparse nonsymmetric linear system, RGMRES, CGS, Bi-CGSTAB or TFQMR method, preconditioner computed by f11da
f11dd nagf_sparse_real_gen_precon_ssor_solve
Solution of linear system involving preconditioning matrix generated by applying SSOR to real sparse nonsymmetric matrix
f11de nagf_sparse_real_gen_solve_jacssor
Solution of real sparse nonsymmetric linear system, RGMRES, CGS, Bi-CGSTAB, or TFQMR method, Jacobi or SSOR preconditioner (Black Box)
f11df nagf_sparse_real_gen_precon_bdilu
Real sparse nonsymmetric linear system, incomplete LU factorization of local or overlapping diagonal blocks
f11dg nagf_sparse_real_gen_solve_bdilu
Solution of real sparse nonsymmetric linear system, RGMRES, CGS, Bi-CGSTAB or TFQMR method, incomplete LU block diagonal preconditioner computed by f11df
f11dk nagf_sparse_real_gen_precon_jacobi
Real, sparse, symmetric or nonsymmetric, linear systems, line Jacobi preconditioner
f11dn nagf_sparse_complex_gen_precon_ilu
Complex sparse non-Hermitian linear systems, incomplete LU factorization
f11dp nagf_sparse_complex_gen_precon_ilu_solve
Solution of complex linear system involving incomplete LU preconditioning matrix generated by f11dn
f11dq nagf_sparse_complex_gen_solve_ilu
Solution of complex sparse non-Hermitian linear system, RGMRES, CGS, Bi-CGSTAB or TFQMR method, preconditioner computed by f11dn (Black Box)
f11dr nagf_sparse_complex_gen_precon_ssor_solve
Solution of linear system involving preconditioning matrix generated by applying SSOR to complex sparse non-Hermitian matrix
f11ds nagf_sparse_complex_gen_solve_jacssor
Solution of complex sparse non-Hermitian linear system, RGMRES, CGS, Bi-CGSTAB or TFQMR method, Jacobi or SSOR preconditioner Black Box
f11dt nagf_sparse_complex_gen_precon_bdilu
Complex, sparse, non-Hermitian linear system, incomplete LU factorization of local or overlapping diagonal blocks
f11du nagf_sparse_complex_gen_solve_bdilu
Solution of complex, sparse, non-Hermitian linear system, RGMRES, CGS, Bi-CGSTAB or TFQMR method, incomplete LU block diagonal preconditioner computed by f11dt
f11dx nagf_sparse_complex_gen_precon_jacobi
Complex, sparse, Hermitian or non-Hermitian, linear systems, line Jacobi preconditioner
f11gd nagf_sparse_real_symm_basic_setup
Real sparse symmetric linear systems, setup for f11ge
f11ge nagf_sparse_real_symm_basic_solver
Real sparse symmetric linear systems, preconditioned conjugate gradient or Lanczos method or the MINRES algorithm
f11gf nagf_sparse_real_symm_basic_diag
Real sparse symmetric linear systems, diagnostic for f11ge
f11gr nagf_sparse_complex_herm_basic_setup
Complex sparse Hermitian linear systems, setup for f11gs
f11gs nagf_sparse_complex_herm_basic_solver
Complex sparse Hermitian linear systems, preconditioned conjugate gradient or Lanczos
f11gt nagf_sparse_complex_herm_basic_diag
Complex sparse Hermitian linear systems, diagnostic for f11gs
f11ja nagf_sparse_real_symm_precon_ichol
Real sparse symmetric matrix, incomplete Cholesky factorization
f11jb nagf_sparse_real_symm_precon_ichol_solve
Solution of linear system involving incomplete Cholesky preconditioning matrix generated by f11ja
f11jc nagf_sparse_real_symm_solve_ichol
Solution of real sparse symmetric linear system, conjugate gradient/Lanczos method, preconditioner computed by f11ja (Black Box)
f11jd nagf_sparse_real_symm_precon_ssor_solve
Solution of linear system involving preconditioning matrix generated by applying SSOR to real sparse symmetric matrix
f11je nagf_sparse_real_symm_solve_jacssor
Solution of real sparse symmetric linear system, conjugate gradient/Lanczos method, Jacobi or SSOR preconditioner (Black Box)
f11jn nagf_sparse_complex_herm_precon_ichol
Complex sparse Hermitian matrix, incomplete Cholesky factorization
f11jp nagf_sparse_complex_herm_precon_ilu_solve
Solution of complex linear system involving incomplete Cholesky preconditioning matrix generated by f11jn
f11jq nagf_sparse_complex_herm_solve_ilu
Solution of complex sparse Hermitian linear system, conjugate gradient/Lanczos method, preconditioner computed by f11jn (Black Box)
f11jr nagf_sparse_complex_herm_precon_ssor_solve
Solution of linear system involving preconditioning matrix generated by applying SSOR to complex sparse Hermitian matrix
f11js nagf_sparse_complex_herm_solve_jacssor
Solution of complex sparse Hermitian linear system, conjugate gradient/Lanczos method, Jacobi or SSOR preconditioner (Black Box)
f11md nagf_sparse_direct_real_gen_setup
Real sparse nonsymmetric linear systems, setup for f11me
f11me nagf_sparse_direct_real_gen_lu
LU factorization of real sparse matrix
f11mf nagf_sparse_direct_real_gen_solve
Solution of real sparse simultaneous linear equations (coefficient matrix already factorized)
f11mg nagf_sparse_direct_real_gen_cond
Estimate condition number of real matrix, matrix already factorized by f11me
f11mh nagf_sparse_direct_real_gen_refine
Refined solution with error bounds of real system of linear equations, multiple right-hand sides
f11mk nagf_sparse_direct_real_gen_matmul
Real sparse nonsymmetric matrix-matrix multiply, compressed column storage
f11ml nagf_sparse_direct_real_gen_norm
1-norm, -norm, largest absolute element, real, square, sparse matrix
f11mm nagf_sparse_direct_real_gen_diag
Real sparse nonsymmetric linear systems, diagnostic for f11me
f11xa nagf_sparse_real_gen_matvec
Real, sparse, nonsymmetric matrix-vector multiply
f11xe nagf_sparse_real_symm_matvec
Real sparse symmetric matrix-vector multiply
f11xn nagf_sparse_complex_gen_matvec
Complex sparse non-Hermitian matrix-vector multiply
f11xs nagf_sparse_complex_herm_matvec
Complex sparse Hermitian matrix-vector multiply
f11ye nagf_sparse_sym_rcm
Reverse Cuthill–McKee reordering of a sparse symmetric matrix in CCS format
f11za nagf_sparse_real_gen_sort
Real sparse nonsymmetric matrix reorder routine
f11zb nagf_sparse_real_symm_sort
Real sparse symmetric matrix reorder routine
f11zn nagf_sparse_complex_gen_sort
Complex sparse non-Hermitian matrix reorder routine
f11zp nagf_sparse_complex_herm_sort
Complex sparse Hermitian matrix reorder routine
Back to F11 Chapter Summary

F12 – Large Scale Eigenproblems

Examples of routines and methods in this chapter:

f12aa nagf_sparseig_real_init
Initialization routine for (f12ab) computing selected eigenvalues and, optionally, eigenvectors of a real nonsymmetric sparse (standard or generalized) eigenproblem
f12ab nagf_sparseig_real_iter
Selected eigenvalues and, optionally, eigenvectors of a real nonsymmetric sparse eigenproblem, reverse communication
f12ac nagf_sparseig_real_proc
Selected eigenvalues and, optionally, eigenvectors of a real nonsymmetric sparse eigenproblem, postprocessing for f12ab
f12ad nagf_sparseig_real_option
Set a single option from a string (f12ab/f12ac/f12ag)
f12ae nagf_sparseig_real_monit
Provides monitoring information for f12ab
f12af nagf_sparseig_real_band_init
Initialization routine for (f12ag) computing selected eigenvalues and, optionally, eigenvectors of a real nonsymmetric banded (standard or generalized) eigenproblem
f12ag nagf_sparseig_real_band_solve
Selected eigenvalues and, optionally, eigenvectors of a real nonsymmetric banded eigenproblem, driver
f12an nagf_sparseig_complex_init
Initialization routine for (f12ap) computing selected eigenvalues and, optionally, eigenvectors of a complex sparse (standard or generalized) eigenproblem
f12ap nagf_sparseig_complex_iter
Selected eigenvalues and, optionally, eigenvectors of a complex sparse eigenproblem, reverse communication
f12aq nagf_sparseig_complex_proc
Selected eigenvalues and, optionally, eigenvectors of a complex sparse eigenproblem, postprocessing for f12ap
f12ar nagf_sparseig_complex_option
Set a single option from a string (f12ap/f12aq)
f12as nagf_sparseig_complex_monit
Provides monitoring information for f12ap
f12at nagf_sparseig_complex_band_init
Initialization routine for f12au computing selected eigenvalues and, optionally, eigenvectors of a complex banded (standard or generalized) eigenproblem
f12au nagf_sparseig_complex_band_solve
Selected eigenvalues and, optionally, eigenvectors of complex non-Hermitian banded eigenproblem, driver
f12fa nagf_sparseig_real_symm_init
Initialization routine for (f12fb) computing selected eigenvalues and, optionally, eigenvectors of a real symmetric sparse (standard or generalized) eigenproblem
f12fb nagf_sparseig_real_symm_iter
Selected eigenvalues and, optionally, eigenvectors of a real symmetric sparse eigenproblem, reverse communication
f12fc nagf_sparseig_real_symm_proc
Selected eigenvalues and, optionally, eigenvectors of a real symmetric sparse eigenproblem, postprocessing for f12fb
f12fd nagf_sparseig_real_symm_option
Set a single option from a string (f12fb/f12fc/f12fg)
f12fe nagf_sparseig_real_symm_monit
Provides monitoring information for f12fb
f12ff nagf_sparseig_real_symm_band_init
Initialization routine for (f12fg) computing selected eigenvalues and, optionally, eigenvectors of a real symmetric banded (standard or generalized) eigenproblem
f12fg nagf_sparseig_real_symm_band_solve
Selected eigenvalues and, optionally, eigenvectors of a real symmetric banded eigenproblem, driver
Back to F12 Chapter Summary

F16 – Further Linear Algebra Support Routines

Examples of routines and methods in this chapter:

f16dl nagf_blast_isum
Sum elements of integer vector
f16dn nagf_blast_imax_val
Maximum value and location, integer vector
f16dp nagf_blast_imin_val
Minimum value and location, integer vector
f16dq nagf_blast_iamax_val
Maximum absolute value and location, integer vector
f16dr nagf_blast_iamin_val
Minimum absolute value and location, integer vector
f16ea nagf_blast_ddot
Dot product of two vectors, allows scaling and accumulation
f16ec nagf_blast_daxpby
Real weighted vector addition
f16eh nagf_blast_dwaxpby
Real weighted vector addition preserving input
f16el nagf_blast_dsum
Sum elements of real vector
f16gc nagf_blast_zaxpby
Complex weighted vector addition
f16gh nagf_blast_zwaxpby
Complex weighted vector addition preserving input
f16gl nagf_blast_zsum
Sum elements of complex vector
f16jn nagf_blast_dmax_val
Maximum value and location, real vector
f16jp nagf_blast_dmin_val
Minimum value and location, real vector
f16jq nagf_blast_damax_val
Maximum absolute value and location, real vector
f16jr nagf_blast_damin_val
Minimum absolute value and location, real vector
f16js nagf_blast_zamax_val
Maximum absolute value and location, complex vector
f16jt nagf_blast_zamin_val
Minimum absolute value and location, complex vector
f16rb nagf_blast_dgb_norm
1-norm, -norm, Frobenius norm, largest absolute element, real band matrix
f16ub nagf_blast_zgb_norm
1-norm, -norm, Frobenius norm, largest absolute element, complex band matrix
Back to F16 Chapter Summary

G01 – Simple Calculations on Statistical Data

Examples of routines and methods in this chapter:

g01ab nagf_stat_summary_2var
Means, corrected sums of squares and cross-products, etc., two variables, from raw data
g01ad nagf_stat_summary_freq
Mean, variance, skewness, kurtosis, etc., one variable, from frequency table
g01ae nagf_stat_frequency_table
Frequency table from raw data
g01af nagf_stat_contingency_table
Two-way contingency table analysis, with χ2/Fisher's exact test
g01al nagf_stat_5pt_summary
Computes a five-point summary (median, hinges and extremes)
g01am nagf_stat_quantiles
Find quantiles of an unordered vector, real numbers
g01an nagf_stat_quantiles_stream_fixed
Calculates approximate quantiles from a data stream of known size
g01ap nagf_stat_quantiles_stream_arbitrary
Calculates approximate quantiles from a data stream of unknown size
g01ar nagf_stat_plot_stem_leaf
Constructs a stem and leaf plot
g01as nagf_stat_plot_box_whisker
Constructs a box and whisker plot
g01at nagf_stat_summary_onevar
Computes univariate summary information: mean, variance, skewness, kurtosis
g01au nagf_stat_summary_onevar_combine
Combines multiple sets of summary information, for use after g01at
g01bj nagf_stat_prob_binomial
Binomial distribution function
g01bk nagf_stat_prob_poisson
Poisson distribution function
g01bl nagf_stat_prob_hypergeom
Hypergeometric distribution function
g01da nagf_stat_normal_scores_exact
Normal scores, accurate values
g01db nagf_stat_normal_scores_approx
Normal scores, approximate values
g01dc nagf_stat_normal_scores_var
Normal scores, approximate variance-covariance matrix
g01dd nagf_stat_test_shapiro_wilk
Shapiro and Wilk's W test for Normality
g01dh nagf_stat_ranks_and_scores
Ranks, Normal scores, approximate Normal scores or exponential (Savage) scores
g01ea nagf_stat_prob_normal
Computes probabilities for the standard Normal distribution
g01eb nagf_stat_prob_students_t
Computes probabilities for Student's t-distribution
g01ec nagf_stat_prob_chisq
Computes probabilities for χ2 distribution
g01ed nagf_stat_prob_f
Computes probabilities for F-distribution
g01ee nagf_stat_prob_beta
Computes upper and lower tail probabilities and probability density function for the beta distribution
g01ef nagf_stat_prob_gamma
Computes probabilities for the gamma distribution
g01em nagf_stat_prob_studentized_range
Computes probability for the Studentized range statistic
g01ep nagf_stat_prob_durbin_watson
Computes bounds for the significance of a Durbin–Watson statistic
g01er nagf_stat_prob_vonmises
Computes probability for von Mises distribution
g01et nagf_stat_prob_landau
Landau distribution function
g01eu nagf_stat_prob_vavilov
Vavilov distribution function
g01ew nagf_stat_prob_dickey_fuller_unit
Computes probabilities for the Dickey–Fuller unit root test
g01ey nagf_stat_prob_kolmogorov1
Computes probabilities for the one-sample Kolmogorov–Smirnov distribution
g01ez nagf_stat_prob_kolmogorov2
Computes probabilities for the two-sample Kolmogorov–Smirnov distribution
g01fa nagf_stat_inv_cdf_normal
Computes deviates for the standard Normal distribution
g01fb nagf_stat_inv_cdf_students_t
Computes deviates for Student's t-distribution
g01fc nagf_stat_inv_cdf_chisq
Computes deviates for the χ2 distribution
g01fd nagf_stat_inv_cdf_f
Computes deviates for the F-distribution
g01fe nagf_stat_inv_cdf_beta
Computes deviates for the beta distribution
g01ff nagf_stat_inv_cdf_gamma
Computes deviates for the gamma distribution
g01fm nagf_stat_inv_cdf_studentized_range
Computes deviates for the Studentized range statistic
g01ft nagf_stat_inv_cdf_landau
Landau inverse function Ψ(x)
g01gb nagf_stat_prob_students_t_noncentral
Computes probabilities for the non-central Student's t-distribution
g01gc nagf_stat_prob_chisq_noncentral
Computes probabilities for the non-central χ2 distribution
g01gd nagf_stat_prob_f_noncentral
Computes probabilities for the non-central F-distribution
g01ge nagf_stat_prob_beta_noncentral
Computes probabilities for the non-central beta distribution
g01ha nagf_stat_prob_bivariate_normal
Computes probability for the bivariate Normal distribution
g01hb nagf_stat_prob_multi_normal
Computes probabilities for the multivariate Normal distribution
g01hc nagf_stat_prob_bivariate_students_t
Computes probabilities for the bivariate Student's t-distribution
g01hd nagf_stat_prob_multi_students_t
Computes the probability for the multivariate Student's t-distribution
g01jc nagf_stat_prob_chisq_noncentral_lincomb
Computes probability for a positive linear combination of χ2 variables
g01jd nagf_stat_prob_chisq_lincomb
Computes lower tail probability for a linear combination of (central) χ2 variables
g01ka nagf_stat_pdf_normal
Calculates the value for the probability density function of the Normal distribution at a chosen point
g01kf nagf_stat_pdf_gamma
Calculates the value for the probability density function of the gamma distribution at a chosen point
g01kk nagf_stat_pdf_gamma_vector
Computes a vector of values for the probability density function of the gamma distribution
g01kq nagf_stat_pdf_normal_vector
Computes a vector of values for the probability density function of the Normal distribution
g01lb nagf_stat_pdf_multi_normal_vector
Computes a vector of values for the probability density function of the multivariate Normal distribution
g01mb nagf_stat_mills_ratio
Computes reciprocal of Mills' Ratio
g01mt nagf_stat_pdf_landau
Landau density function ϕ(λ)
g01mu nagf_stat_pdf_vavilov
Vavilov density function ϕV(λ;κ,β2)
g01na nagf_stat_moments_quad_form
Cumulants and moments of quadratic forms in Normal variables
g01nb nagf_stat_moments_ratio_quad_forms
Moments of ratios of quadratic forms in Normal variables, and related statistics
g01pt nagf_stat_pdf_landau_moment1
Landau first moment function Φ1(x)
g01qt nagf_stat_pdf_landau_moment2
Landau second moment function Φ2(x)
g01rt nagf_stat_pdf_landau_deriv
Landau derivative function ϕ(λ)
g01sa nagf_stat_prob_normal_vector
Computes a vector of probabilities for the standard Normal distribution
g01sb nagf_stat_prob_students_t_vector
Computes a vector of probabilities for the Student's t-distribution
g01sc nagf_stat_prob_chisq_vector
Computes a vector of probabilities for χ2 distribution
g01sd nagf_stat_prob_f_vector
Computes a vector of probabilities for F-distribution
g01se nagf_stat_prob_beta_vector
Computes a vector of probabilities for the beta distribution
g01sf nagf_stat_prob_gamma_vector
Computes a vector of probabilities for the gamma distribution
g01sj nagf_stat_prob_binomial_vector
Computes a vector of probabilities for the binomial distribution
g01sk nagf_stat_prob_poisson_vector
Computes a vector of probabilities for the Poisson distribution
g01sl nagf_stat_prob_hypergeom_vector
Computes a vector of probabilities for the hypergeometric distribution
g01ta nagf_stat_inv_cdf_normal_vector
Computes a vector of deviates for the standard Normal distribution
g01tb nagf_stat_inv_cdf_students_t_vector
Computes a vector of deviates for Student's t-distribution
g01tc nagf_stat_inv_cdf_chisq_vector
Computes a vector of deviates for χ2 distribution
g01td nagf_stat_inv_cdf_f_vector
Computes a vector of deviates for F-distribution
g01te nagf_stat_inv_cdf_beta_vector
Computes a vector of deviates for the beta distribution
g01tf nagf_stat_inv_cdf_gamma_vector
Computes a vector of deviates for the gamma distribution
g01wa nagf_stat_moving_average
Computes the mean and standard deviation using a rolling window
g01zu nagf_stat_init_vavilov
Initialization routine for g01mu and g01eu
Back to G01 Chapter Summary

G02 – Correlation and Regression Analysis

Examples of routines and methods in this chapter:

g02aa nagf_correg_corrmat_nearest
Computes the nearest correlation matrix to a real square matrix, using the method of Qi and Sun
g02ab nagf_correg_corrmat_nearest_bounded
Computes the nearest correlation matrix to a real square matrix, augmenting g02aa to incorporate weights and bounds
g02ae nagf_correg_corrmat_nearest_kfactor
Computes the nearest correlation matrix with k-factor structure to a real square matrix
g02aj nagf_correg_corrmat_h_weight
Computes the nearest correlation matrix to a real square matrix, using element-wise weighting
g02an nagf_correg_corrmat_shrinking
Computes a correlation matrix from an approximate matrix with fixed submatrix
g02ap nagf_correg_corrmat_target
Computes a correlation matrix from an approximate one using a specified target matrix
g02ba nagf_correg_coeffs_pearson
Pearson product-moment correlation coefficients, all variables, no missing values
g02bb nagf_correg_coeffs_pearson_miss_case
Pearson product-moment correlation coefficients, all variables, casewise treatment of missing values
g02bc nagf_correg_coeffs_pearson_miss_pair
Pearson product-moment correlation coefficients, all variables, pairwise treatment of missing values
g02bd nagf_correg_coeffs_zero
Correlation-like coefficients (about zero), all variables, no missing values
g02be nagf_correg_coeffs_zero_miss_case
Correlation-like coefficients (about zero), all variables, casewise treatment of missing values
g02bf nagf_correg_coeffs_zero_miss_pair
Correlation-like coefficients (about zero), all variables, pairwise treatment of missing values
g02bg nagf_correg_coeffs_pearson_subset
Pearson product-moment correlation coefficients, subset of variables, no missing values
g02bh nagf_correg_coeffs_pearson_subset_miss_case
Pearson product-moment correlation coefficients, subset of variables, casewise treatment of missing values
g02bj nagf_correg_coeffs_pearson_subset_miss_pair
Pearson product-moment correlation coefficients, subset of variables, pairwise treatment of missing values
g02bk nagf_correg_coeffs_zero_subset
Correlation-like coefficients (about zero), subset of variables, no missing values
g02bl nagf_correg_coeffs_zero_subset_miss_case
Correlation-like coefficients (about zero), subset of variables, casewise treatment of missing values
g02bm nagf_correg_coeffs_zero_subset_miss_pair
Correlation-like coefficients (about zero), subset of variables, pairwise treatment of missing values
g02bn nagf_correg_coeffs_kspearman_overwrite
Kendall/Spearman non-parametric rank correlation coefficients, no missing values, overwriting input data
g02bp nagf_correg_coeffs_kspearman_miss_case_overwrite
Kendall/Spearman non-parametric rank correlation coefficients, casewise treatment of missing values, overwriting input data
g02bq nagf_correg_coeffs_kspearman
Kendall/Spearman non-parametric rank correlation coefficients, no missing values, preserving input data
g02br nagf_correg_coeffs_kspearman_miss_case
Kendall/Spearman non-parametric rank correlation coefficients, casewise treatment of missing values, preserving input data
g02bs nagf_correg_coeffs_kspearman_miss_pair
Kendall/Spearman non-parametric rank correlation coefficients, pairwise treatment of missing values
g02bt nagf_correg_ssqmat_update
Update a weighted sum of squares matrix with a new observation
g02bu nagf_correg_ssqmat
Computes a weighted sum of squares matrix
g02bw nagf_correg_ssqmat_to_corrmat
Computes a correlation matrix from a sum of squares matrix
g02bx nagf_correg_corrmat
Computes (optionally weighted) correlation and covariance matrices
g02by nagf_correg_corrmat_partial
Computes partial correlation/variance-covariance matrix from correlation/variance-covariance matrix computed by g02bx
g02bz nagf_correg_ssqmat_combine
Combines two sums of squares matrices, for use after g02bu
g02ca nagf_correg_linregs_const
Simple linear regression with constant term, no missing values
g02cb nagf_correg_linregs_noconst
Simple linear regression without constant term, no missing values
g02cc nagf_correg_linregs_const_miss
Simple linear regression with constant term, missing values
g02cd nagf_correg_linregs_noconst_miss
Simple linear regression without constant term, missing values
g02ce nagf_correg_linregm_service_select
Service routine for multiple linear regression, select elements from vectors and matrices
g02cf nagf_correg_linregm_service_reorder
Service routine for multiple linear regression, reorder elements of vectors and matrices
g02cg nagf_correg_linregm_coeffs_const
Multiple linear regression, from correlation coefficients, with constant term
g02ch nagf_correg_linregm_coeffs_noconst
Multiple linear regression, from correlation-like coefficients, without constant term
g02da nagf_correg_linregm_fit
Fits a general (multiple) linear regression model
g02dc nagf_correg_linregm_obs_edit
Add/delete an observation to/from a general linear regression model
g02dd nagf_correg_linregm_update
Estimates of linear parameters and general linear regression model from updated model
g02de nagf_correg_linregm_var_add
Add a new independent variable to a general linear regression model
g02df nagf_correg_linregm_var_del
Delete an independent variable from a general linear regression model
g02dg nagf_correg_linregm_fit_newvar
Fits a general linear regression model to new dependent variable
g02dk nagf_correg_linregm_constrain
Estimates and standard errors of parameters of a general linear regression model for given constraints
g02dn nagf_correg_linregm_estfunc
Computes estimable function of a general linear regression model and its standard error
g02ea nagf_correg_linregm_rssq
Computes residual sums of squares for all possible linear regressions for a set of independent variables
g02ec nagf_correg_linregm_rssq_stat
Calculates R2 and CP values from residual sums of squares
g02ee nagf_correg_linregm_fit_onestep
Fits a linear regression model by forward selection
g02ef nagf_correg_linregm_fit_stepwise
Stepwise linear regression
g02fa nagf_correg_linregm_stat_resinf
Calculates standardized residuals and influence statistics
g02fc nagf_correg_linregm_stat_durbwat
Computes Durbin–Watson test statistic
g02ga nagf_correg_glm_normal
Fits a generalized linear model with Normal errors
g02gb nagf_correg_glm_binomial
Fits a generalized linear model with binomial errors
g02gc nagf_correg_glm_poisson
Fits a generalized linear model with Poisson errors
g02gd nagf_correg_glm_gamma
Fits a generalized linear model with gamma errors
g02gk nagf_correg_glm_constrain
Estimates and standard errors of parameters of a general linear model for given constraints
g02gn nagf_correg_glm_estfunc
Computes estimable function of a generalized linear model and its standard error
g02gp nagf_correg_glm_predict
Computes a predicted value and its associated standard error based on a previously fitted generalized linear model
g02ha nagf_correg_robustm
Robust regression, standard M-estimates
g02hb nagf_correg_robustm_wts
Robust regression, compute weights for use with g02hd
g02hd nagf_correg_robustm_user
Robust regression, compute regression with user-supplied functions and weights
g02hf nagf_correg_robustm_user_varmat
Robust regression, variance-covariance matrix following g02hd
g02hk nagf_correg_robustm_corr_huber
Calculates a robust estimation of a covariance matrix, Huber's weight function
g02hl nagf_correg_robustm_corr_user_deriv
Calculates a robust estimation of a covariance matrix, user-supplied weight function plus derivatives
g02hm nagf_correg_robustm_corr_user
Calculates a robust estimation of a covariance matrix, user-supplied weight function
g02ja nagf_correg_mixeff_reml
Linear mixed effects regression using Restricted Maximum Likelihood (REML)
g02jb nagf_correg_mixeff_ml
Linear mixed effects regression using Maximum Likelihood (ML)
g02jc nagf_correg_mixeff_hier_init
Hierarchical mixed effects regression, initialization routine for g02jd and g02je
g02jd nagf_correg_mixeff_hier_reml
Hierarchical mixed effects regression using Restricted Maximum Likelihood (REML)
g02je nagf_correg_mixeff_hier_ml
Hierarchical mixed effects regression using Maximum Likelihood (ML)
g02ka nagf_correg_ridge_opt
Ridge regression, optimizing a ridge regression parameter
g02kb nagf_correg_ridge
Ridge regression using a number of supplied ridge regression parameters
g02la nagf_correg_pls_svd
Partial least squares (PLS) regression using singular value decomposition
g02lb nagf_correg_pls_wold
Partial least squares (PLS) regression using Wold's iterative method
g02lc nagf_correg_pls_fit
PLS parameter estimates following partial least squares regression by g02la and g02lb
g02ld nagf_correg_pls_pred
PLS predictions based on parameter estimates from g02lc
g02ma nagf_correg_lars
Least angle regression (LARS), least absolute shrinkage and selection operator (LASSO) and forward stagewise regression
g02mb nagf_correg_lars_xtx
Least Angle Regression (LARS), Least Absolute Shrinkage and Selection Operator (LASSO) and forward stagewise regression using the cross-products matrix
g02mc nagf_correg_lars_param
Calculates additional parameter estimates following Least Angle Regression (LARS), Least Absolute Shrinkage and Selection Operator (LASSO) or forward stagewise regression
g02qf nagf_correg_quantile_linreg_easy
Linear quantile regression, simple interface, independent, identically distributed (IID) errors
g02qg nagf_correg_quantile_linreg
Linear quantile regression, comprehensive interface
g02zk nagf_correg_optset
Option setting routine for g02qg
g02zl nagf_correg_optget
Option getting routine for g02qg
Back to G02 Chapter Summary

G03 – Multivariate Methods

Examples of routines and methods in this chapter:

g03aa nagf_mv_prin_comp
Performs principal component analysis
g03ac nagf_mv_canon_var
Performs canonical variate analysis
g03ad nagf_mv_canon_corr
Performs canonical correlation analysis
g03ba nagf_mv_rot_orthomax
Computes orthogonal rotations for loading matrix, generalized orthomax criterion
g03bc nagf_mv_rot_procrustes
Computes Procrustes rotations
g03bd nagf_mv_rot_promax
ProMax rotations
g03ca nagf_mv_factor
Computes maximum likelihood estimates of the parameters of a factor analysis model, factor loadings, communalities and residual correlations
g03cc nagf_mv_factor_score
Computes factor score coefficients (for use after g03ca)
g03da nagf_mv_discrim
Computes test statistic for equality of within-group covariance matrices and matrices for discriminant analysis
g03db nagf_mv_discrim_mahal
Computes Mahalanobis squared distances for group or pooled variance-covariance matrices (for use after g03da)
g03dc nagf_mv_discrim_group
Allocates observations to groups according to selected rules (for use after g03da)
g03ea nagf_mv_distance_mat
Computes distance matrix
g03ec nagf_mv_cluster_hier
Hierarchical cluster analysis
g03ef nagf_mv_cluster_kmeans
K-means cluster analysis
g03eh nagf_mv_cluster_hier_dendrogram
Constructs dendrogram (for use after g03ec)
g03ej nagf_mv_cluster_hier_indicator
Computes cluster indicator variable (for use after g03ec)
g03fa nagf_mv_multidimscal_metric
Performs principal coordinate analysis, classical metric scaling
g03fc nagf_mv_multidimscal_ordinal
Performs non-metric (ordinal) multidimensional scaling
g03ga nagf_mv_gaussian_mixture
Fits a Gaussian mixture model
g03za nagf_mv_z_scores
Produces standardized values (z-scores) for a data matrix
Back to G03 Chapter Summary

G04 – Analysis of Variance

Examples of routines and methods in this chapter:

g04ag nagf_anova_hier2
Two-way analysis of variance, hierarchical classification, subgroups of unequal size
g04bb nagf_anova_random
Analysis of variance, randomized block or completely randomized design, treatment means and standard errors
g04bc nagf_anova_rowcol
Analysis of variance, general row and column design, treatment means and standard errors
g04ca nagf_anova_factorial
Analysis of variance, complete factorial design, treatment means and standard errors
g04da nagf_anova_contrasts
Computes sum of squares for contrast between means
g04db nagf_anova_confidence
Computes confidence intervals for differences between means computed by g04bb or g04bc
g04ea nagf_anova_dummyvars
Computes orthogonal polynomials or dummy variables for factor/classification variable
g04ga nagf_anova_icc
Intraclass correlation (ICC) for assessing rater reliability
Back to G04 Chapter Summary

G05 – Random Number Generators

Examples of routines and methods in this chapter:

g05kf nagf_rand_init_repeat
Initializes a pseudorandom number generator to give a repeatable sequence
g05kg nagf_rand_init_nonrepeat
Initializes a pseudorandom number generator to give a non-repeatable sequence
g05kh nagf_rand_init_leapfrog
Primes a pseudorandom number generator for generating multiple streams using leap-frog
g05kj nagf_rand_init_skipahead
Primes a pseudorandom number generator for generating multiple streams using skip-ahead
g05kk nagf_rand_init_skipahead_power2
Primes a pseudorandom number generator for generating multiple streams using skip-ahead, skipping ahead a power of 2
g05nc nagf_rand_permute
Pseudorandom permutation of an integer vector
g05nd nagf_rand_sample
Pseudorandom sample from an integer vector
g05ne nagf_rand_sample_wgt
Pseudorandom sample, without replacement, unequal weights
g05pd nagf_rand_times_garch_asym1
Generates a realization of a time series from a GARCH process with asymmetry of the form (εt-1+γ)2
g05pe nagf_rand_times_garch_asym2
Generates a realization of a time series from a GARCH process with asymmetry of the form (|εt-1|+γεt-1)2
g05pf nagf_rand_times_garch_gjr
Generates a realization of a time series from an asymmetric Glosten, Jagannathan and Runkle (GJR) GARCH process
g05pg nagf_rand_times_garch_exp
Generates a realization of a time series from an exponential GARCH (EGARCH) process
g05ph nagf_rand_times_arma
Generates a realization of a time series from an ARMA model
g05pj nagf_rand_times_mv_varma
Generates a realization of a multivariate time series from a VARMA model
g05pm nagf_rand_times_smooth_exp
Generates a realization of a time series from an exponential smoothing model
g05pv nagf_rand_kfold_xyw
Permutes a matrix, vector, vector triplet into a form suitable for K-fold cross validation
g05pw nagf_rand_subsamp_xyw
Permutes a matrix, vector, vector triplet into a form suitable for random sub-sampling validation
g05px nagf_rand_matrix_orthog
Generates a random orthogonal matrix
g05py nagf_rand_matrix_corr
Generates a random correlation matrix
g05pz nagf_rand_matrix_2waytable
Generates a random two-way table
g05rc nagf_rand_copula_students_t
Generates a matrix of pseudorandom numbers from a Student's t-copula
g05rd nagf_rand_copula_normal
Generates a matrix of pseudorandom numbers from a Gaussian copula
g05re nagf_rand_copula_clayton_bivar
Generates a matrix of pseudorandom numbers from a bivariate Clayton/Cook–Johnson copula
g05rf nagf_rand_copula_frank_bivar
Generates a matrix of pseudorandom numbers from a bivariate Frank copula
g05rg nagf_rand_copula_plackett_bivar
Generates a matrix of pseudorandom numbers from a bivariate Plackett copula
g05rh nagf_rand_copula_clayton
Generates a matrix of pseudorandom numbers from a multivariate Clayton/Cook–Johnson copula
g05rj nagf_rand_copula_frank
Generates a matrix of pseudorandom numbers from a multivariate Frank copula
g05rk nagf_rand_copula_gumbel
Generates a matrix of pseudorandom numbers from a Gumbel–Hougaard copula
g05ry nagf_rand_multivar_students_t
Generates a matrix of pseudorandom numbers from a multivariate Student's t-distribution
g05rz nagf_rand_multivar_normal
Generates a matrix of pseudorandom numbers from a multivariate Normal distribution
g05sa nagf_rand_dist_uniform01
Generates a vector of pseudorandom numbers from a uniform distribution over (0,1]
g05sb nagf_rand_dist_beta
Generates a vector of pseudorandom numbers from a beta distribution
g05sc nagf_rand_dist_cauchy
Generates a vector of pseudorandom numbers from a Cauchy distribution
g05sd nagf_rand_dist_chisq
Generates a vector of pseudorandom numbers from a χ2 distribution
g05se nagf_rand_dist_dirichlet
Generates a vector of pseudorandom numbers from a Dirichlet distribution
g05sf nagf_rand_dist_exp
Generates a vector of pseudorandom numbers from an exponential distribution
g05sg nagf_rand_dist_expmix
Generates a vector of pseudorandom numbers from an exponential mix distribution
g05sh nagf_rand_dist_f
Generates a vector of pseudorandom numbers from an F-distribution
g05sj nagf_rand_dist_gamma
Generates a vector of pseudorandom numbers from a gamma distribution
g05sk nagf_rand_dist_normal
Generates a vector of pseudorandom numbers from a Normal distribution
g05sl nagf_rand_dist_logistic
Generates a vector of pseudorandom numbers from a logistic distribution
g05sm nagf_rand_dist_lognormal
Generates a vector of pseudorandom numbers from a log-normal distribution
g05sn nagf_rand_dist_students_t
Generates a vector of pseudorandom numbers from a Student's t-distribution
g05sp nagf_rand_dist_triangular
Generates a vector of pseudorandom numbers from a triangular distribution
g05sq nagf_rand_dist_uniform
Generates a vector of pseudorandom numbers from a uniform distribution over [a,b]
g05sr nagf_rand_dist_vonmises
Generates a vector of pseudorandom numbers from a von Mises distribution
g05ss nagf_rand_dist_weibull
Generates a vector of pseudorandom numbers from a Weibull distribution
g05ta nagf_rand_int_binomial
Generates a vector of pseudorandom integers from a binomial distribution
g05tb nagf_rand_logical
Generates a vector of pseudorandom logical values
g05tc nagf_rand_int_geom
Generates a vector of pseudorandom integers from a geometric distribution
g05td nagf_rand_int_general
Generates a vector of pseudorandom integers from a general discrete distribution
g05te nagf_rand_int_hypergeom
Generates a vector of pseudorandom integers from a hypergeometric distribution
g05tf nagf_rand_int_log
Generates a vector of pseudorandom integers from a logarithmic distribution
g05tg nagf_rand_int_multinomial
Generates a vector of pseudorandom integers from a multinomial distribution
g05th nagf_rand_int_negbin
Generates a vector of pseudorandom integers from a negative binomial distribution
g05tj nagf_rand_int_poisson
Generates a vector of pseudorandom integers from a Poisson distribution
g05tk nagf_rand_int_poisson_varmean
Generates a vector of pseudorandom integers from a Poisson distribution with varying mean
g05tl nagf_rand_int_uniform
Generates a vector of pseudorandom integers from a uniform distribution
g05xa nagf_rand_bb_init
Initializes the Brownian bridge generator
g05xb nagf_rand_bb
Generate paths for a free or non-free Wiener process using the Brownian bridge algorithm
g05xc nagf_rand_bb_inc_init
Initializes the generator which backs out the increments of sample paths generated by a Brownian bridge algorithm
g05xd nagf_rand_bb_inc
Backs out the increments from sample paths generated by a Brownian bridge algorithm
g05xe nagf_rand_bb_make_bridge_order
Creates a Brownian bridge construction order out of a set of input times
g05yj nagf_rand_quasi_normal
Generates a Normal quasi-random number sequence
g05yk nagf_rand_quasi_lognormal
Generates a log-normal quasi-random number sequence
g05yl nagf_rand_quasi_init
Initializes a quasi-random number generator
g05ym nagf_rand_quasi_uniform
Generates a uniform quasi-random number sequence
g05yn nagf_rand_quasi_init_scrambled
Initializes a scrambled quasi-random number generator
g05zm nagf_rand_field_1d_user_setup
Setup for simulating one-dimensional random fields, user-defined variogram
g05zn nagf_rand_field_1d_predef_setup
Setup for simulating one-dimensional random fields
g05zp nagf_rand_field_1d_generate
Generates realizations of a one-dimensional random field
g05zq nagf_rand_field_2d_user_setup
Setup for simulating two-dimensional random fields, user-defined variogram
g05zr nagf_rand_field_2d_predef_setup
Setup for simulating two-dimensional random fields, preset variogram
g05zs nagf_rand_field_2d_generate
Generates realizations of a two-dimensional random field
g05zt nagf_rand_field_fracbm_generate
Generates realizations of fractional Brownian motion
Back to G05 Chapter Summary

G07 – Univariate Estimation

Examples of routines and methods in this chapter:

g07aa nagf_univar_ci_binomial
Computes confidence interval for the parameter of a binomial distribution
g07ab nagf_univar_ci_poisson
Computes confidence interval for the parameter of a Poisson distribution
g07bb nagf_univar_estim_normal
Computes maximum likelihood estimates for parameters of the Normal distribution from grouped and/or censored data
g07be nagf_univar_estim_weibull
Computes maximum likelihood estimates for parameters of the Weibull distribution
g07bf nagf_univar_estim_genpareto
Estimates parameter values of the generalized Pareto distribution
g07ca nagf_univar_ttest_2normal
Computes t-test statistic for a difference in means between two Normal populations, confidence interval
g07da nagf_univar_robust_1var_median
Robust estimation, median, median absolute deviation, robust standard deviation
g07db nagf_univar_robust_1var_mestim
Robust estimation, M-estimates for location and scale parameters, standard weight functions
g07dc nagf_univar_robust_1var_mestim_wgt
Robust estimation, M-estimates for location and scale parameters, user-defined weight functions
g07dd nagf_univar_robust_1var_trimmed
Computes a trimmed and winsorized mean of a single sample with estimates of their variance
g07ea nagf_univar_robust_1var_ci
Robust confidence intervals, one-sample
g07eb nagf_univar_robust_2var_ci
Robust confidence intervals, two-sample
g07ga nagf_univar_outlier_peirce_1var
Outlier detection using method of Peirce, raw data or single variance supplied
g07gb nagf_univar_outlier_peirce_2var
Outlier detection using method of Peirce, two variances supplied
Back to G07 Chapter Summary

G08 – Nonparametric Statistics

Examples of routines and methods in this chapter:

g08aa nagf_nonpar_test_sign
Sign test on two paired samples
g08ac nagf_nonpar_test_median
Median test on two samples of unequal size
g08ae nagf_nonpar_test_friedman
Friedman two-way analysis of variance on k matched samples
g08af nagf_nonpar_test_kruskal
Kruskal–Wallis one-way analysis of variance on k samples of unequal size
g08ag nagf_nonpar_test_wilcoxon
Performs the Wilcoxon one-sample (matched pairs) signed rank test
g08ah nagf_nonpar_test_mwu
Performs the Mann–Whitney U test on two independent samples
g08aj nagf_nonpar_prob_mwu_noties
Computes the exact probabilities for the Mann–Whitney U statistic, no ties in pooled sample
g08ak nagf_nonpar_prob_mwu_ties
Computes the exact probabilities for the Mann–Whitney U statistic, ties in pooled sample
g08al nagf_nonpar_test_cochranq
Performs the Cochran Q test on cross-classified binary data
g08ba nagf_nonpar_test_mooddavid
Mood's and David's tests on two samples of unequal size
g08cb nagf_nonpar_test_ks_1sample
Performs the one-sample Kolmogorov–Smirnov test for standard distributions
g08cc nagf_nonpar_test_ks_1sample_user
Performs the one-sample Kolmogorov–Smirnov test for a user-supplied distribution
g08cd nagf_nonpar_test_ks_2sample
Performs the two-sample Kolmogorov–Smirnov test
g08cg nagf_nonpar_test_chisq
Performs the χ2 goodness-of-fit test, for standard continuous distributions
g08ch nagf_nonpar_gofstat_anddar
Calculates the Anderson–Darling goodness-of-fit test statistic
g08cj nagf_nonpar_gofstat_anddar_unif
Calculates the Anderson–Darling goodness-of-fit test statistic and its probability for the case of uniformly distributed data
g08ck nagf_nonpar_gofstat_anddar_normal
Calculates the Anderson–Darling goodness-of-fit test statistic and its probability for the case of a fully-unspecified Normal distribution
g08cl nagf_nonpar_gofstat_anddar_exp
Calculates the Anderson–Darling goodness-of-fit test statistic and its probability for the case of an unspecified exponential distribution
g08da nagf_nonpar_concordance_kendall
Kendall's coefficient of concordance
g08ea nagf_nonpar_randtest_runs
Performs the runs up or runs down test for randomness
g08eb nagf_nonpar_randtest_pairs
Performs the pairs (serial) test for randomness
g08ec nagf_nonpar_randtest_triplets
Performs the triplets test for randomness
g08ed nagf_nonpar_randtest_gaps
Performs the gaps test for randomness
g08ra nagf_nonpar_rank_regsn
Regression using ranks, uncensored data
g08rb nagf_nonpar_rank_regsn_censored
Regression using ranks, right-censored data
Back to G08 Chapter Summary

G10 – Smoothing in Statistics

Examples of routines and methods in this chapter:

g10ab nagf_smooth_fit_spline
Fit cubic smoothing spline, smoothing parameter given
g10ac nagf_smooth_fit_spline_parest
Fit cubic smoothing spline, smoothing parameter estimated
g10bb nagf_smooth_kerndens_gauss
Kernel density estimate using Gaussian kernel (thread safe)
g10ca nagf_smooth_data_runningmedian
Compute smoothed data sequence using running median smoothers
g10za nagf_smooth_data_order
Reorder data to give ordered distinct observations
Back to G10 Chapter Summary

G11 – Contingency Table Analysis

Examples of routines and methods in this chapter:

g11aa nagf_contab_chisq
χ2 statistics for two-way contingency table
g11ba nagf_contab_tabulate_stat
Computes multiway table from set of classification factors using selected statistic
g11bb nagf_contab_tabulate_percentile
Computes multiway table from set of classification factors using given percentile/quantile
g11bc nagf_contab_tabulate_margin
Computes marginal tables for multiway table computed by g11ba or g11bb
g11ca nagf_contab_condl_logistic
Returns parameter estimates for the conditional analysis of stratified data
g11sa nagf_contab_binary
Contingency table, latent variable model for binary data
g11sb nagf_contab_binary_service
Frequency count for g11sa
Back to G11 Chapter Summary

G12 – Survival Analysis

Examples of routines and methods in this chapter:

g12aa nagf_surviv_kaplanmeier
Computes Kaplan–Meier (product-limit) estimates of survival probabilities
g12ab nagf_surviv_logrank
Computes rank statistics for comparing survival curves
g12ba nagf_surviv_coxmodel
Fits Cox's proportional hazard model
g12za nagf_surviv_coxmodel_risksets
Creates the risk sets associated with the Cox proportional hazards model for fixed covariates
Back to G12 Chapter Summary

G13 – Time Series Analysis

Examples of routines and methods in this chapter:

g13aa nagf_tsa_uni_diff
Univariate time series, seasonal and non-seasonal differencing
g13ab nagf_tsa_uni_autocorr
Univariate time series, sample autocorrelation function
g13ac nagf_tsa_uni_autocorr_part
Univariate time series, partial autocorrelations from autocorrelations
g13ad nagf_tsa_uni_arima_prelim
Univariate time series, preliminary estimation, seasonal ARIMA model
g13ae nagf_tsa_uni_arima_estim
Univariate time series, estimation, seasonal ARIMA model (comprehensive)
g13af nagf_tsa_uni_arima_estim_easy
Univariate time series, estimation, seasonal ARIMA model (easy-to-use)
g13ag nagf_tsa_uni_arima_update
Univariate time series, update state set for forecasting
g13ah nagf_tsa_uni_arima_forecast_state
Univariate time series, forecasting from state set
g13aj nagf_tsa_uni_arima_forcecast
Univariate time series, state set and forecasts, from fully specified seasonal ARIMA model
g13am nagf_tsa_uni_smooth_exp
Univariate time series, exponential smoothing
g13as nagf_tsa_uni_arima_resid
Univariate time series, diagnostic checking of residuals, following g13ae or g13af
g13au nagf_tsa_uni_means
Computes quantities needed for range-mean or standard deviation-mean plot
g13aw nagf_tsa_uni_dickey_fuller_unit
Computes (augmented) Dickey–Fuller unit root test statistic
g13ba nagf_tsa_multi_filter_arima
Multivariate time series, filtering (pre-whitening) by an ARIMA model
g13bb nagf_tsa_multi_filter_transf
Multivariate time series, filtering by a transfer function model
g13bc nagf_tsa_multi_xcorr
Multivariate time series, cross-correlations
g13bd nagf_tsa_multi_transf_prelim
Multivariate time series, preliminary estimation of transfer function model
g13be nagf_tsa_multi_inputmod_estim
Multivariate time series, estimation of multi-input model
g13bg nagf_tsa_multi_inputmod_update
Multivariate time series, update state set for forecasting from multi-input model
g13bh nagf_tsa_multi_inputmod_forecast_state
Multivariate time series, forecasting from state set of multi-input model
g13bj nagf_tsa_multi_inputmod_forecast
Multivariate time series, state set and forecasts from fully specified multi-input model
g13ca nagf_tsa_uni_spectrum_lag
Univariate time series, smoothed sample spectrum using rectangular, Bartlett, Tukey or Parzen lag window
g13cb nagf_tsa_uni_spectrum_daniell
Univariate time series, smoothed sample spectrum using spectral smoothing by the trapezium frequency (Daniell) window
g13cc nagf_tsa_multi_spectrum_lag
Multivariate time series, smoothed sample cross spectrum using rectangular, Bartlett, Tukey or Parzen lag window
g13cd nagf_tsa_multi_spectrum_daniell
Multivariate time series, smoothed sample cross spectrum using spectral smoothing by the trapezium frequency (Daniell) window
g13ce nagf_tsa_multi_spectrum_bivar
Multivariate time series, cross amplitude spectrum, squared coherency, bounds, univariate and bivariate (cross) spectra
g13cf nagf_tsa_multi_gain_bivar
Multivariate time series, gain, phase, bounds, univariate and bivariate (cross) spectra
g13cg nagf_tsa_multi_noise_bivar
Multivariate time series, noise spectrum, bounds, impulse response function and its standard error
g13db nagf_tsa_multi_autocorr_part
Multivariate time series, multiple squared partial autocorrelations
g13dd nagf_tsa_multi_varma_estimate
Multivariate time series, estimation of VARMA model
g13dj nagf_tsa_multi_varma_forecast
Multivariate time series, forecasts and their standard errors
g13dk nagf_tsa_multi_varma_update
Multivariate time series, updates forecasts and their standard errors
g13dl nagf_tsa_multi_diff
Multivariate time series, differences and/or transforms
g13dm nagf_tsa_multi_corrmat_cross
Multivariate time series, sample cross-correlation or cross-covariance matrices
g13dn nagf_tsa_multi_corrmat_partlag
Multivariate time series, sample partial lag correlation matrices, χ2 statistics and significance levels
g13dp nagf_tsa_multi_regmat_partial
Multivariate time series, partial autoregression matrices
g13ds nagf_tsa_multi_varma_diag
Multivariate time series, diagnostic checking of residuals, following g13dd
g13dx nagf_tsa_uni_arma_roots
Calculates the zeros of a vector autoregressive (or moving average) operator
g13ea nagf_tsa_multi_kalman_sqrt_var
Combined measurement and time update, one iteration of Kalman filter, time-varying, square root covariance filter
g13eb nagf_tsa_multi_kalman_sqrt_invar
Combined measurement and time update, one iteration of Kalman filter, time-invariant, square root covariance filter
g13ej nagf_tsa_kalman_unscented_state_revcom
Combined time and measurement update, one iteration of the Unscented Kalman Filter for a nonlinear state space model, with additive noise (reverse communication)
g13ek nagf_tsa_kalman_unscented_state
Combined time and measurement update, one iteration of the Unscented Kalman Filter for a nonlinear state space model, with additive noise
g13fa nagf_tsa_uni_garch_asym1_estim
Univariate time series, parameter estimation for either a symmetric GARCH process or a GARCH process with asymmetry of the form (εt-1+γ)2
g13fb nagf_tsa_uni_garch_asym1_forecast
Univariate time series, forecast function for either a symmetric GARCH process or a GARCH process with asymmetry of the form (εt-1+γ)2
g13fc nagf_tsa_uni_garch_asym2_estim
Univariate time series, parameter estimation for a GARCH process with asymmetry of the form (|εt-1|+γεt-1)2
g13fd nagf_tsa_uni_garch_asym2_forecast
Univariate time series, forecast function for a GARCH process with asymmetry of the form (|εt-1|+γεt-1)2
g13fe nagf_tsa_uni_garch_gjr_estim
Univariate time series, parameter estimation for an asymmetric Glosten, Jagannathan and Runkle (GJR) GARCH process
g13ff nagf_tsa_uni_garch_gjr_forecast
Univariate time series, forecast function for an asymmetric Glosten, Jagannathan and Runkle (GJR) GARCH process
g13fg nagf_tsa_uni_garch_exp_estim
Univariate time series, parameter estimation for an exponential GARCH (EGARCH) process
g13fh nagf_tsa_uni_garch_exp_forecast
Univariate time series, forecast function for an exponential GARCH (EGARCH) process
g13me nagf_tsa_inhom_iema
Computes the iterated exponential moving average for a univariate inhomogeneous time series
g13mf nagf_tsa_inhom_iema_all
Computes the iterated exponential moving average for a univariate inhomogeneous time series, intermediate results are also returned
g13mg nagf_tsa_inhom_ma
Computes the exponential moving average for a univariate inhomogeneous time series
g13na nagf_tsa_cp_pelt
Change point detection, using the PELT algorithm
g13nb nagf_tsa_cp_pelt_user
Change points detection using the PELT algorithm, user supplied cost function
g13nd nagf_tsa_cp_binary
Change point detection, using binary segmentation
g13ne nagf_tsa_cp_binary_user
Change point detection, using binary segmentation, user supplied cost function
Back to G13 Chapter Summary

G22 – Linear Model Specification

Examples of routines and methods in this chapter:

g22ya nagf_blgm_lm_formula
Specify a linear model via a formula string
g22yb nagf_blgm_lm_describe_data
Describe a dataset
g22yc nagf_blgm_lm_design_matrix
Construct a design matrix from a linear model specified using g22ya
g22yd nagf_blgm_lm_submodel
Construct a vector indicating which columns of a design matrix to include in a submodel specified using g22ya
g22za nagf_blgm_handle_free
Destroy a G22 handle and deallocate all the memory used
g22zm nagf_blgm_optset
Option setting routine for Chapter G22
g22zn nagf_blgm_optget
Option getting routine for Chapter G22
Back to G22 Chapter Summary

H – Operations Research

Examples of routines and methods in this chapter:

h02bb nagf_mip_ilp_dense
Integer LP problem (dense)
h02bf nagf_mip_ilp_mpsx
Interpret MPSX data file defining IP or LP problem, optimize and print solution
h02bu nagf_mip_ilp_mpsx_convert
Convert MPSX data file defining IP or LP problem to format required by h02bb or e04mf
h02bv nagf_mip_ilp_print
Print IP or LP solutions with user-specified names for rows and columns
h02bz nagf_mip_ilp_info
Integer programming solution, supplies further information on solution obtained by h02bb
h02cb nagf_mip_iqp_dense
Integer QP problem (dense)
h02cb nagf_mip_iqp_dense_dummy_monit
dummy
h02cc nagf_mip_iqp_dense_optfile
Read optional parameter values for h02cb from external file
h02cd nagf_mip_iqp_dense_optstr
Supply optional parameter values to h02cb
h02ce nagf_mip_iqp_sparse
Integer LP or QP problem (sparse), using e04nk
h02ce nagf_mip_iqp_sparse_dummy_monit
dummy
h02cf nagf_mip_iqp_sparse_optfile
Read optional parameter values for h02ce from external file
h02cg nagf_mip_iqp_sparse_optstr
Supply optional parameter values to h02ce
h02da nagf_mip_sqp
Mixed integer nonlinear programming
h02zk nagf_mip_optset
Option setting routine for h02da
h02zl nagf_mip_optget
Option getting routine for h02da
h03ab nagf_mip_transportation
Transportation problem, modified 'stepping stone' method
h03ad nagf_mip_shortestpath
Shortest path problem, Dijkstra's algorithm
h03bb nagf_mip_tsp_simann
Travelling Salesman Problem, simulated annealing
h05aa nagf_mip_best_subset_given_size_revcomm
Best n subsets of size p (reverse communication)
h05ab nagf_mip_best_subset_given_size
Best n subsets of size p (direct communication)
Back to H Chapter Summary

J10 –

Examples of routines and methods in this chapter:

Back to J10 Chapter Summary

M01 – Sorting and Searching

Examples of routines and methods in this chapter:

m01ca nagf_sort_realvec_sort
Sort a vector, real numbers
m01cb nagf_sort_intvec_sort
Sort a vector, integer numbers
m01cc nagf_sort_charvec_sort
Sort a vector, character data
m01da nagf_sort_realvec_rank
Rank a vector, real numbers
m01db nagf_sort_intvec_rank
Rank a vector, integer numbers
m01dc nagf_sort_charvec_rank
Rank a vector, character data
m01de nagf_sort_realmat_rank_rows
Rank rows of a matrix, real numbers
m01df nagf_sort_intmat_rank_rows
Rank rows of a matrix, integer numbers
m01dj nagf_sort_realmat_rank_columns
Rank columns of a matrix, real numbers
m01dk nagf_sort_intmat_rank_columns
Rank columns of a matrix, integer numbers
m01dz nagf_sort_arbitrary_rank
Rank arbitrary data
m01ea nagf_sort_realvec_rank_rearrange
Rearrange a vector according to given ranks, real numbers
m01eb nagf_sort_intvec_rank_rearrange
Rearrange a vector according to given ranks, integer numbers
m01ec nagf_sort_charvec_rank_rearrange
Rearrange a vector according to given ranks, character data
m01ed nagf_sort_cmplxvec_rank_rearrange
Rearrange a vector according to given ranks, complex numbers
m01na nagf_sort_realvec_search
Binary search in set of real numbers
m01nb nagf_sort_intvec_search
Binary search in set of integer numbers
m01nc nagf_sort_charvec_search
Binary search in set of character data
m01za nagf_sort_permute_invert
Invert a permutation
m01zb nagf_sort_permute_check
Check validity of a permutation
m01zc nagf_sort_permute_decompose
Decompose a permutation into cycles
Back to M01 Chapter Summary

P01 – Error Trapping

Examples of routines and methods in this chapter:

Back to P01 Chapter Summary

S – Approximations of Special Functions

Examples of routines and methods in this chapter:

s01ba nagf_specfun_log_shifted
ln (1+x)
s01ea nagf_specfun_exp_complex
Complex exponential, ez
s07aa nagf_specfun_tan
tan x
s09aa nagf_specfun_arcsin
arcsin x
s09ab nagf_specfun_arccos
arccos x
s10aa nagf_specfun_tanh
tanh x
s10ab nagf_specfun_sinh
sinh x
s10ac nagf_specfun_cosh
cosh x
s11aa nagf_specfun_arctanh
arctanh x
s11ab nagf_specfun_arcsinh
arcsinh x
s11ac nagf_specfun_arccosh
arccosh x
s13aa nagf_specfun_integral_exp
Exponential integral E1(x)
s13ac nagf_specfun_integral_cos
Cosine integral Ci (x)
s13ad nagf_specfun_integral_sin
Sine integral Si (x)
s14aa nagf_specfun_gamma
Gamma function
s14ab nagf_specfun_gamma_log_real
Log gamma function, real argument
s14ac nagf_specfun_polygamma
ψ(x)-ln x
s14ad nagf_specfun_polygamma_deriv
Scaled derivatives of ψ(x)
s14ae nagf_specfun_psi_deriv_real
Polygamma function ψ(n)(x) for real x
s14af nagf_specfun_psi_deriv_complex
Polygamma function ψ(n)(z) for complex z
s14ag nagf_specfun_gamma_log_complex
Logarithm of the gamma function ln Γ(z), complex argument
s14ah nagf_specfun_gamma_log_scaled_real
Scaled log gamma function
s14ba nagf_specfun_gamma_incomplete
Incomplete gamma functions P(a,x) and Q(a,x)
s14cb nagf_specfun_beta_log_real
Logarithm of the beta function ln B(a,b)
s14cc nagf_specfun_beta_incomplete
Regularized incomplete beta function Ix(a,b) and its complement 1-Ix
s15ab nagf_specfun_cdf_normal
Cumulative Normal distribution function P(x)
s15ac nagf_specfun_compcdf_normal
Complement of cumulative Normal distribution function Q(x)
s15ad nagf_specfun_erfc_real
Complement of error function erfc (x)
s15ae nagf_specfun_erf_real
Error function erf (x)
s15af nagf_specfun_dawson
Dawson's integral
s15ag nagf_specfun_erfcx_real
Scaled complement of error function, erfcx (x)
s15dd nagf_specfun_erfc_complex
Scaled complex complement of error function, exp (-z2)erfc (-iz)
s17ac nagf_specfun_bessel_y0_real
Bessel function Y0(x)
s17ad nagf_specfun_bessel_y1_real
Bessel function Y1(x)
s17ae nagf_specfun_bessel_j0_real
Bessel function J0(x)
s17af nagf_specfun_bessel_j1_real
Bessel function J1(x)
s17ag nagf_specfun_airy_ai_real
Airy function Ai (x)
s17ah nagf_specfun_airy_bi_real
Airy function Bi (x)
s17aj nagf_specfun_airy_ai_deriv
Airy function Ai (x)
s17ak nagf_specfun_airy_bi_deriv
Airy function Bi (x)
s17al nagf_specfun_bessel_zeros
Zeros of Bessel functions Jα(x), Jα(x), Yα(x) or Yα(x)
s17aq nagf_specfun_bessel_y0_real_vector
Bessel function vectorized Y0(x)
s17ar nagf_specfun_bessel_y1_real_vector
Bessel function vectorized Y1(x)
s17as nagf_specfun_bessel_j0_real_vector
Bessel function vectorized J0(x)
s17at nagf_specfun_bessel_j1_real_vector
Bessel function vectorized J1(x)
s17au nagf_specfun_airy_ai_real_vector
Airy function vectorized Ai (x)
s17av nagf_specfun_airy_bi_real_vector
Airy function vectorized Bi (x)
s17aw nagf_specfun_airy_ai_deriv_vector
Derivatives of the Airy function, vectorized Ai (x)
s17ax nagf_specfun_airy_bi_deriv_vector
Derivatives of the Airy function, vectorized Bi (x)
s17dc nagf_specfun_bessel_y_complex
Bessel functions Yν+a(z), real a0, complex z, ν=0,1,2,
s17de nagf_specfun_bessel_j_complex
Bessel functions Jν+a(z), real a0, complex z, ν=0,1,2,
s17dg nagf_specfun_airy_ai_complex
Airy functions Ai (z) and Ai (z), complex z
s17dh nagf_specfun_airy_bi_complex
Airy functions Bi (z) and Bi (z), complex z
s17dl nagf_specfun_hankel_complex
Hankel functions Hν+a(j)(z), j=1,2, real a0, complex z, ν=0,1,2,
s17ga nagf_specfun_struve_h0
Struve function of order 0, H0(x)
s17gb nagf_specfun_struve_h1
Struve function of order 1, H1(x)
s18ac nagf_specfun_bessel_k0_real
Modified Bessel function K0(x)
s18ad nagf_specfun_bessel_k1_real
Modified Bessel function K1(x)
s18ae nagf_specfun_bessel_i0_real
Modified Bessel function I0(x)
s18af nagf_specfun_bessel_i1_real
Modified Bessel function I1(x)
s18aq nagf_specfun_bessel_k0_real_vector
Modified Bessel function vectorized K0(x)
s18ar nagf_specfun_bessel_k1_real_vector
Modified Bessel function vectorized K1(x)
s18as nagf_specfun_bessel_i0_real_vector
Modified Bessel function vectorized I0(x)
s18at nagf_specfun_bessel_i1_real_vector
Modified Bessel function vectorized I1(x)
s18cc nagf_specfun_bessel_k0_scaled
Scaled modified Bessel function exK0(x)
s18cd nagf_specfun_bessel_k1_scaled
Scaled modified Bessel function exK1(x)
s18ce nagf_specfun_bessel_i0_scaled
Scaled modified Bessel function e-|x|I0(x)
s18cf nagf_specfun_bessel_i1_scaled
Scaled modified Bessel function e-|x|I1(x)
s18cq nagf_specfun_bessel_k0_scaled_vector
Scaled modified Bessel function vectorized exK0(x)
s18cr nagf_specfun_bessel_k1_scaled_vector
Scaled modified Bessel function vectorized exK1(x)
s18cs nagf_specfun_bessel_i0_scaled_vector
Scaled modified Bessel function vectorized e-|x|I0(x)
s18ct nagf_specfun_bessel_i1_scaled_vector
Scaled modified Bessel function vectorized e-|x|I1(x)
s18dc nagf_specfun_bessel_k_complex
Modified Bessel functions Kν+a(z), real a0, complex z, ν=0,1,2,
s18de nagf_specfun_bessel_i_complex
Modified Bessel functions Iν+a(z), real a0, complex z, ν=0,1,2,
s18gk nagf_specfun_bessel_j_seq_complex
Bessel function of the 1st kind Jα±n(z)
s18ga nagf_specfun_struve_l0
Modified Struve function of order 0, L0(x)
s18gb nagf_specfun_struve_l1
Modified Struve function of order 1, L1(x)
s18gc nagf_specfun_struve_i0ml0
The function I0(x)-L0(x), where I0(x) is a modified Bessel function and L0(x) is a Struve function
s18gd nagf_specfun_struve_i1ml1
The function I1(x)-L1(x), where I1(x) is a modified Bessel function and L1(x) is a Struve function
s19aa nagf_specfun_kelvin_ber
Kelvin function ber x
s19ab nagf_specfun_kelvin_bei
Kelvin function bei x
s19ac nagf_specfun_kelvin_ker
Kelvin function ker x
s19ad nagf_specfun_kelvin_kei
Kelvin function kei x
s19an nagf_specfun_kelvin_ber_vector
Kelvin function vectorized ber x
s19ap nagf_specfun_kelvin_bei_vector
Kelvin function vectorized bei x
s19aq nagf_specfun_kelvin_ker_vector
Kelvin function vectorized ker x
s19ar nagf_specfun_kelvin_kei_vector
Kelvin function vectorized kei x
s20ac nagf_specfun_fresnel_s
Fresnel integral S(x)
s20ad nagf_specfun_fresnel_c
Fresnel integral C(x)
s20aq nagf_specfun_fresnel_s_vector
Fresnel integral vectorized S(x)
s20ar nagf_specfun_fresnel_c_vector
Fresnel integral vectorized C(x)
s21ba nagf_specfun_ellipint_symm_1_degen
Degenerate symmetrised elliptic integral of 1st kind RC(x,y)
s21bb nagf_specfun_ellipint_symm_1
Symmetrised elliptic integral of 1st kind RF(x,y,z)
s21bc nagf_specfun_ellipint_symm_2
Symmetrised elliptic integral of 2nd kind RD(x,y,z)
s21bd nagf_specfun_ellipint_symm_3
Symmetrised elliptic integral of 3rd kind RJ(x,y,z,r)
s21be nagf_specfun_ellipint_legendre_1
Elliptic integral of 1st kind, Legendre form, F(ϕm)
s21bf nagf_specfun_ellipint_legendre_2
Elliptic integral of 2nd kind, Legendre form, E(ϕm)
s21bg nagf_specfun_ellipint_legendre_3
Elliptic integral of 3rd kind, Legendre form, Π(n;ϕm)
s21bh nagf_specfun_ellipint_complete_1
Complete elliptic integral of 1st kind, Legendre form, K(m)
s21bj nagf_specfun_ellipint_complete_2
Complete elliptic integral of 2nd kind, Legendre form, E(m)
s21ca nagf_specfun_jacellip_real
Jacobian elliptic functions sn, cn and dn of real argument
s21cb nagf_specfun_jacellip_complex
Jacobian elliptic functions sn, cn and dn of complex argument
s21cc nagf_specfun_jactheta_real
Jacobian theta functions θk(x,q) of real argument
s21da nagf_specfun_ellipint_general_2
General elliptic integral of 2nd kind F(z,k,a,b) of complex argument
s22aa nagf_specfun_legendre_p
Legendre functions of 1st kind Pnm(x) or Pnm-(x)
s22ba nagf_specfun_1f1_real
Real confluent hypergeometric function 1F1(a;b;x)
s22bb nagf_specfun_1f1_real_scaled
Real confluent hypergeometric function 1F1(a;b;x) in scaled form
s22be nagf_specfun_2f1_real
Real Gauss hypergeometric function 2F1(a,b;c;x)
s22bf nagf_specfun_2f1_real_scaled
Real Gauss hypergeometric function 2F1(a,b;c;x) in scaled form
s30aa nagf_specfun_opt_bsm_price
Black–Scholes–Merton option pricing formula
s30ab nagf_specfun_opt_bsm_greeks
Black–Scholes–Merton option pricing formula with Greeks
s30ba nagf_specfun_opt_lookback_fls_price
Floating-strike lookback option pricing formula in the Black-Scholes-Merton model
s30bb nagf_specfun_opt_lookback_fls_greeks
Floating-strike lookback option pricing formula with Greeks in the Black-Scholes-Merton model
s30ca nagf_specfun_opt_binary_con_price
Binary option, cash-or-nothing pricing formula
s30cb nagf_specfun_opt_binary_con_greeks
Binary option, cash-or-nothing pricing formula with Greeks
s30cc nagf_specfun_opt_binary_aon_price
Binary option, asset-or-nothing pricing formula
s30cd nagf_specfun_opt_binary_aon_greeks
Binary option, asset-or-nothing pricing formula with Greeks
s30fa nagf_specfun_opt_barrier_std_price
Standard barrier option pricing formula
s30ja nagf_specfun_opt_jumpdiff_merton_price
Jump-diffusion, Merton's model, option pricing formula
s30jb nagf_specfun_opt_jumpdiff_merton_greeks
Jump-diffusion, Merton's model, option pricing formula with Greeks
s30na nagf_specfun_opt_heston_price
Heston's model option pricing formula
s30nb nagf_specfun_opt_heston_greeks
Heston's model option pricing formula with Greeks
s30nc nagf_specfun_opt_heston_term
Heston's model option pricing with term structure
s30qc nagf_specfun_opt_amer_bs_price
American option, Bjerksund and Stensland pricing formula
s30sa nagf_specfun_opt_asian_geom_price
Asian option, geometric continuous average rate pricing formula
s30sb nagf_specfun_opt_asian_geom_greeks
Asian option, geometric continuous average rate pricing formula with Greeks
Back to S Chapter Summary

X01 – Mathematical Constants

Examples of routines and methods in this chapter:

x01aa nagf_math_pi
Provides the mathematical constant π
x01ab nagf_math_euler
Provides the mathematical constant γ (Euler's constant)
Back to X01 Chapter Summary

X02 – Machine Constants

Examples of routines and methods in this chapter:

x02ah nagf_machine_sinarg_max
The largest permissible argument for sin and cos
x02aj nagf_machine_precision
The machine precision
x02ak nagf_machine_real_smallest
The smallest positive model number
x02al nagf_machine_real_largest
The largest positive model number
x02am nagf_machine_real_safe
The safe range parameter
x02an nagf_machine_complex_safe
The safe range parameter for complex floating-point arithmetic
x02bb nagf_machine_integer_max
The largest representable integer
x02be nagf_machine_decimal_digits
The maximum number of decimal digits that can be represented
x02bh nagf_machine_model_base
The floating-point model parameter, b
x02bj nagf_machine_model_digits
The floating-point model parameter, p
x02bk nagf_machine_model_minexp
The floating-point model parameter emin
x02bl nagf_machine_model_maxexp
The floating-point model parameter emax
Back to X02 Chapter Summary

X03 – Inner Products

Examples of routines and methods in this chapter:

x03aa nagf_dot_real_prec
Real inner product added to initial value, basic/additional precision
x03ab nagf_dot_complex_prec
Complex inner product added to initial value, basic/additional precision
Back to X03 Chapter Summary

X04 – Input/Output Utilities

Examples of routines and methods in this chapter:

x04aa nagf_file_set_unit_error
Return or set unit number for error messages
x04ab nagf_file_set_unit_advisory
Return or set unit number for advisory messages
x04ac nagf_file_open
Open unit number for reading, writing or appending, and associate unit with named file
x04ad nagf_file_close
Close file associated with given unit number
x04ba nagf_file_line_write
Write formatted record to external file
x04bb nagf_file_line_read
Read formatted record from external file
x04ca nagf_file_print_matrix_real_gen
Print real general matrix (easy-to-use)
x04cb nagf_file_print_matrix_real_gen_comp
Print real general matrix (comprehensive)
x04cc nagf_file_print_matrix_real_packed
Print real packed triangular matrix (easy-to-use)
x04cd nagf_file_print_matrix_real_packed_comp
Print real packed triangular matrix (comprehensive)
x04ce nagf_file_print_matrix_real_band
Print real packed banded matrix (easy-to-use)
x04cf nagf_file_print_matrix_real_band_comp
Print real packed banded matrix (comprehensive)
x04da nagf_file_print_matrix_complex_gen
Print complex general matrix (easy-to-use)
x04db nagf_file_print_matrix_complex_gen_comp
Print complex general matrix (comprehensive)
x04dc nagf_file_print_matrix_complex_packed
Print complex packed triangular matrix (easy-to-use)
x04dd nagf_file_print_matrix_complex_packed_comp
Print complex packed triangular matrix (comprehensive)
x04de nagf_file_print_matrix_complex_band
Print complex packed banded matrix (easy-to-use)
x04df nagf_file_print_matrix_complex_band_comp
Print complex packed banded matrix (comprehensive)
x04ea nagf_file_print_matrix_integer
Print integer matrix (easy-to-use)
x04eb nagf_file_print_matrix_integer_comp
Print integer matrix (comprehensive)
Back to X04 Chapter Summary

X05 – Date and Time Utilities

Examples of routines and methods in this chapter:

x05aa nagf_time_date_array
Return date and time as an array of integers
x05ab nagf_time_date_array_string
Convert array of integers representing date and time to character string
x05ac nagf_time_date_string_compare
Compare two character strings representing date and time
x05ba nagf_time_cpu
Return the CPU time
Back to X05 Chapter Summary

X06 – OpenMP Utilities

Examples of routines and methods in this chapter:

x06aa nagf_omp_set_num_threads
Sets the number of threads for OpenMP parallel regions
x06ab nagf_omp_get_num_threads
The number of OpenMP threads in the current team
x06ac nagf_omp_get_max_threads
An upper bound on the number of threads in the next parallel region
x06ad nagf_omp_get_thread_num
The OpenMP thread number of the calling thread
x06af nagf_omp_in_parallel
Tests for an active OpenMP parallel region
x06ag nagf_omp_set_nested
Enables or disables nested OpenMP parallelism
x06ah nagf_omp_get_nested
Tests the status of nested OpenMP parallelism
x06xa nagf_omp_using_threaded_impl
Tests whether a threaded NAG Library is being used
Back to X06 Chapter Summary

X07 – IEEE Arithmetic

Examples of routines and methods in this chapter:

x07aa nagf_ieee_is_finite
Determines whether its argument has a finite value
x07ab nagf_ieee_is_nan
Determines whether its argument is a NaN (Not A Number)
x07ba nagf_ieee_create_infinity
Creates a signed infinite value
x07bb nagf_ieee_create_nan
Creates a NaN (Not A Number)
x07ca nagf_ieee_get_exception_mode
Gets current behaviour of floating-point exceptions
x07cb nagf_ieee_set_exception_mode
Sets behaviour of floating-point exceptions
Back to X07 Chapter Summary

X10 – Automatic Differentiation Utilities

Examples of routines and methods in this chapter:

x10aa
Create a configuration data object
x10ab
Remove a configuration data object
x10ac
Set the algorithmic mode
x10ad
Get the algorithmic mode
x10ba
Create a callback data object
x10bb
Insert the location of the AD callback into the callback data object
x10bc
Set the callback algorithmic mode
x10bd
Get the callback algorithmic mode
x10be
Write an integer (working precision) scalar to the callback data object
x10bf
Write a real (working precision) scalar to the callback data object
x10bj
Write a scalar of type nagad_a1w_w_rtype to the callback data object
x10ce
Read an integer scalar from the callback data object
x10cf
Read a real (working precision) scalar from the callback data object
x10cj
Read a scalar of type nagad_a1w_w_rtype from the callback data object
Back to X10 Chapter Summary

© The Numerical Algorithms Group Ltd, Oxford, UK. 2018