void	f07gaf_ (const char uplo, const Integer n, const Integer nrhs, double ap[], double b[], const Integer ldb, Integer *info, const Charlen length_uplo)

The routine may be called by the names f07gaf, nagf_lapacklin_dppsv or its LAPACK name dppsv.

3 Description

f07gaf uses the Cholesky decomposition to factor

A

A = U^{T} U

uplo ='U'

A = L L^{T}

uplo ='L'

, where

U

is an upper triangular matrix and

L

is a lower triangular matrix. The factored form of

A

is then used to solve the system of equations

A X = B

4 References

Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999) LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia https://www.netlib.org/lapack/lug

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

5 Arguments

1: $uplo$ – Character(1) Input

On entry: if

uplo ='U'

, the upper triangle of

A

is stored.

uplo ='L'

, the lower triangle of

A

is stored.

Constraint:

uplo ='U'

'L'

2: $n$ – Integer Input

On entry:

n

, the number of linear equations, i.e., the order of the matrix

A

Constraint:

n \geq 0

3: $nrhs$ – Integer Input

On entry:

r

, the number of right-hand sides, i.e., the number of columns of the matrix

B

Constraint:

nrhs \geq 0

4: $ap (*)$ – Real (Kind=nag_wp) array Input/Output

Note: the dimension of the array ap must be at least

\max (1, n \times (n + 1) / 2)

On entry: the

n

n

symmetric matrix

A

, packed by columns.

More precisely,

if $uplo ='U'$ , the upper triangle of $A$ must be stored with element $A_{i j}$ in $ap (i + j (j - 1) / 2)$ for $i \leq j$ ;
if $uplo ='L'$ , the lower triangle of $A$ must be stored with element $A_{i j}$ in $ap (i + (2 n - j) (j - 1) / 2)$ for $i \geq j$ .

On exit: if

info = 0

, the factor

U

L

from the Cholesky factorization

A = U^{T} U

A = L L^{T}

, in the same storage format as

A

5: $b (ldb *)$ – Real (Kind=nag_wp) array Input/Output

Note: the second dimension of the array b must be at least

\max (1, nrhs)

On entry: the

n

r

right-hand side matrix

B

On exit: if

info = 0

, the

n

r

solution matrix

X

6: $ldb$ – Integer Input

On entry: the first dimension of the array b as declared in the (sub)program from which f07gaf is called.

Constraint:

ldb \geq \max (1, n)

7: $info$ – Integer Output

On exit:

info = 0

unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

$info < 0$: If $info = - i$ , argument $i$ had an illegal value. An explanatory message is output, and execution of the program is terminated.

$info > 0$: The leading minor of order $〈value〉$ of $A$ is not positive definite, so the factorization could not be completed, and the solution has not been computed.

7 Accuracy

The computed solution for a single right-hand side,

\hat{x}

, satisfies an equation of the form

(A + E) \hat{x} = b,

where

{‖E‖}_{1} = O (ε) {‖A‖}_{1}

and

ε

is the machine precision. An approximate error bound for the computed solution is given by

\frac{{‖\hat{x} - x‖}_{1}}{{‖x‖}_{1}} \leq κ (A) \frac{{‖E‖}_{1}}{{‖A‖}_{1}},

where

κ (A) = {‖A^{- 1}‖}_{1} {‖A‖}_{1}

, the condition number of

A

with respect to the solution of the linear equations. See Section 4.4 of Anderson et al. (1999) for further details.

f07gbf is a comprehensive LAPACK driver that returns forward and backward error bounds and an estimate of the condition number. Alternatively, f04bef solves

A x = b

and returns a forward error bound and condition estimate. f04bef calls f07gaf to solve the equations.

8 Parallelism and Performance

f07gaf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

f07gaf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The total number of floating-point operations is approximately

\frac{1}{3} n^{3} + 2 n^{2} r

, where

r

is the number of right-hand sides.

The complex analogue of this routine is f07gnf.

10 Example

This example solves the equations

A x = b,

where

A

is the symmetric positive definite matrix

A = (\begin{matrix} 4.16 & - 3.12 & 0.56 & - 0.10 \\ - 3.12 & 5.03 & - 0.83 & 1.18 \\ 0.56 & - 0.83 & 0.76 & 0.34 \\ - 0.10 & 1.18 & 0.34 & 1.18 \end{matrix}) and b = (\begin{matrix} 8.70 \\ - 13.35 \\ 1.89 \\ - 4.14 \end{matrix}) .

Details of the Cholesky factorization of

A

are also output.

Interfaces: FL CL AD

NAG FL Interface Introduction

F07 (Lapacklin) Chapter Contents

F07 (Lapacklin) Chapter Introduction

f07ga: FL CL AD

NAG FL Interfacef07gaf (dppsv)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
f07gaf (dppsv)