F04 Chapter Contents
F04 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentF04ASF

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

## 1  Purpose

F04ASF calculates the accurate solution of a set of real symmetric positive definite linear equations with a single right-hand side, $Ax=b$, using a Cholesky factorization and iterative refinement.

## 2  Specification

 SUBROUTINE F04ASF ( A, LDA, B, N, C, WK1, WK2, IFAIL)
 INTEGER LDA, N, IFAIL REAL (KIND=nag_wp) A(LDA,*), B(max(1,N)), C(max(1,N)), WK1(max(1,N)), WK2(max(1,N))

## 3  Description

Given a set of real linear equations $Ax=b$, where $A$ is a symmetric positive definite matrix, F04ASF first computes a Cholesky factorization of $A$ as $A=L{L}^{\mathrm{T}}$ where $L$ is lower triangular. An approximation to $x$ is found by forward and backward substitution. The residual vector $r=b-Ax$ is then calculated using additional precision and a correction $d$ to $x$ is found by solving $L{L}^{\mathrm{T}}d=r$. $x$ is then replaced by $x+d$, and this iterative refinement of the solution is repeated until machine accuracy is obtained.

## 4  References

Wilkinson J H and Reinsch C (1971) Handbook for Automatic Computation II, Linear Algebra Springer–Verlag

## 5  Parameters

1:     A(LDA,$*$) – REAL (KIND=nag_wp) arrayInput/Output
Note: the second dimension of the array A must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
On entry: the upper triangle of the $n$ by $n$ positive definite symmetric matrix $A$. The elements of the array below the diagonal need not be set.
On exit: the elements of the array below the diagonal are overwritten; the upper triangle of ${\mathbf{A}}$ is unchanged.
2:     LDA – INTEGERInput
On entry: the first dimension of the array A as declared in the (sub)program from which F04ASF is called.
Constraint: ${\mathbf{LDA}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
3:     B($\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$) – REAL (KIND=nag_wp) arrayInput
Note: the dimension of the array B must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
On entry: the right-hand side vector $b$.
4:     N – INTEGERInput
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{N}}\ge 0$.
5:     C($\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$) – REAL (KIND=nag_wp) arrayOutput
On exit: the solution vector $x$.
6:     WK1($\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$) – REAL (KIND=nag_wp) arrayWorkspace
7:     WK2($\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$) – REAL (KIND=nag_wp) arrayWorkspace
8:     IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to $0$, $-1\text{​ or ​}1$. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value $-1\text{​ or ​}1$ is recommended. If the output of error messages is undesirable, then the value $1$ is recommended. Otherwise, if you are not familiar with this parameter, the recommended value is $0$. When the value $-\mathbf{1}\text{​ or ​}\mathbf{1}$ is used it is essential to test the value of IFAIL on exit.
On exit: ${\mathbf{IFAIL}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see Section 6).

## 6  Error Indicators and Warnings

If on entry ${\mathbf{IFAIL}}={\mathbf{0}}$ or $-{\mathbf{1}}$, explanatory error messages are output on the current error message unit (as defined by X04AAF).
Errors or warnings detected by the routine:
${\mathbf{IFAIL}}=1$
The matrix $A$ is not positive definite, possibly due to rounding errors.
${\mathbf{IFAIL}}=2$
Iterative refinement fails to improve the solution, i.e., the matrix $A$ is too ill-conditioned.
${\mathbf{IFAIL}}=3$
 On entry, ${\mathbf{N}}<0$, or ${\mathbf{LDA}}<\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.

## 7  Accuracy

The computed solutions should be correct to full machine accuracy. For a detailed error analysis see page 39 of Wilkinson and Reinsch (1971).

The time taken by F04ASF is approximately proportional to ${n}^{3}$.
The routine must not be called with the same name for parameters B and C.

## 9  Example

This example solves the set of linear equations $Ax=b$ where
 $A= 5 7 6 5 7 10 8 7 6 8 10 9 5 7 9 10 and b= 23 32 33 31 .$

### 9.1  Program Text

Program Text (f04asfe.f90)

### 9.2  Program Data

Program Data (f04asfe.d)

### 9.3  Program Results

Program Results (f04asfe.r)