1: $n$ – Integer Input: On entry: $n$ , the order of the matrix $A$ .

Constraint: $n \geq 0$ .
2: $d [\dim]$ – double Input/Output: Note: the dimension, dim, of the array d must be at least $\max (1, n)$ .

On entry: must contain the $n$ diagonal elements of the matrix $A$ .

On exit: is overwritten by the $n$ diagonal elements of the diagonal matrix $D$ from the $L D L^{T}$ factorization of $A$ .
3: $e [\dim]$ – double Input/Output: Note: the dimension, dim, of the array e must be at least $\max (1, n - 1)$ .

On entry: must contain the $(n - 1)$ subdiagonal elements of the matrix $A$ .

On exit: is overwritten by the $(n - 1)$ subdiagonal elements of the lower bidiagonal matrix $L$ . (e can also be regarded as containing the $(n - 1)$ superdiagonal elements of the upper bidiagonal matrix $U$ .)
4: $fail$ – NagError * Input/Output: The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).

6 Error Indicators and Warnings

NE_ALLOC_FAIL: Dynamic memory allocation failed.
See Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
NE_BAD_PARAM: On entry, argument $⟨ value ⟩$ had an illegal value.
NE_INT: On entry, $n = ⟨ value ⟩$ .
Constraint: $n \geq 0$ .
NE_INTERNAL_ERROR: An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
See Section 7.5 in the Introduction to the NAG Library CL Interface for further information.
NE_MAT_NOT_POS_DEF: The leading minor of order $n$ is not positive definite, the factorization was completed, but $d [n - 1] \leq 0$ .

The leading minor of order $⟨ value ⟩$ is not positive definite, the factorization could not be completed.
NE_NO_LICENCE: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library CL Interface for further information.

7 Accuracy

The computed factorization satisfies an equation of the form

A + E = L D L^{T},

where

{‖ E ‖}_{\infty} = O (ε) {‖ A ‖}_{\infty}

and

ε

is the machine precision.

Following the use of this function, f07jec can be used to solve systems of equations

A X = B

, and f07jgc can be used to estimate the condition number of

A

f07jdc is not threaded in any implementation.

The total number of floating-point operations required to factorize the matrix

A

is proportional to

n

The complex analogue of this function is f07jrc.

This example factorizes the symmetric positive definite tridiagonal matrix

A

given by

A = (\begin{array}{r} 4.0 & - 2.0 & 0 & 0 & 0 \\ - 2.0 & 10.0 & - 6.0 & 0 & 0 \\ 0 & - 6.0 & 29.0 & 15.0 & 0 \\ 0 & 0 & 15.0 & 25.0 & 8.0 \\ 0 & 0 & 0 & 8.0 & 5.0 \end{array}) .

f07jd: FL CL CPP AD