# NAG FL Interfacef04atf (withdraw_​real_​square_​solve_​1rhs)

Note: this routine is deprecated and will be withdrawn at Mark 28. Replaced by f07abf.

## ▸▿ Contents

Settings help

FL Name Style:

FL Specification Language:

## 1Purpose

f04atf calculates the accurate solution of a set of real linear equations with a single right-hand side, using an $LU$ factorization with partial pivoting, and iterative refinement.

## 2Specification

Fortran Interface
 Subroutine f04atf ( a, lda, b, n, c, aa, ldaa, wks1, wks2,
 Integer, Intent (In) :: lda, n, ldaa Integer, Intent (Inout) :: ifail Real (Kind=nag_wp), Intent (In) :: a(lda,*), b(*) Real (Kind=nag_wp), Intent (Inout) :: aa(ldaa,n) Real (Kind=nag_wp), Intent (Out) :: c(n), wks1(n), wks2(n)
#include <nag.h>
 void f04atf_ (const double a[], const Integer *lda, const double b[], const Integer *n, double c[], double aa[], const Integer *ldaa, double wks1[], double wks2[], Integer *ifail)
The routine may be called by the names f04atf or nagf_linsys_withdraw_real_square_solve_1rhs.

## 3Description

Given a set of real linear equations, $Ax=b$, the routine first computes an $LU$ factorization of $A$ with partial pivoting, $PA=LU$, where $P$ is a permutation matrix, $L$ is lower triangular and $U$ is unit upper triangular. An approximation to $x$ is found by forward and backward substitution in $Ly=Pb$ and $Ux=y$. The residual vector $r=b-Ax$ is then calculated using additional precision, and a correction $d$ to $x$ is found by solving $LUd=r$. $x$ is replaced by $x+d$, and this iterative refinement of the solution is repeated until full machine accuracy is obtained.
Wilkinson J H and Reinsch C (1971) Handbook for Automatic Computation II, Linear Algebra Springer–Verlag

## 5Arguments

1: $\mathbf{a}\left({\mathbf{lda}},*\right)$Real (Kind=nag_wp) array Input
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 $n×n$ matrix $A$.
2: $\mathbf{lda}$Integer Input
On entry: the first dimension of the array a as declared in the (sub)program from which f04atf is called.
Constraint: ${\mathbf{lda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
3: $\mathbf{b}\left(*\right)$Real (Kind=nag_wp) array Input
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: $\mathbf{n}$Integer Input
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
5: $\mathbf{c}\left({\mathbf{n}}\right)$Real (Kind=nag_wp) array Output
On exit: the solution vector $x$.
6: $\mathbf{aa}\left({\mathbf{ldaa}},{\mathbf{n}}\right)$Real (Kind=nag_wp) array Output
Note: the second dimension of the array aa must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
On exit: the triangular factors $L$ and $U$, except that the unit diagonal elements of $U$ are not stored.
7: $\mathbf{ldaa}$Integer Input
On entry: the first dimension of the array aa as declared in the (sub)program from which f04atf is called.
Constraint: ${\mathbf{ldaa}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
8: $\mathbf{wks1}\left({\mathbf{n}}\right)$Real (Kind=nag_wp) array Workspace
9: $\mathbf{wks2}\left({\mathbf{n}}\right)$Real (Kind=nag_wp) array Workspace
10: $\mathbf{ifail}$Integer Input/Output
On entry: ifail must be set to $0$, $-1$ or $1$ to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of $0$ causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of $-1$ means that an error message is printed while a value of $1$ means that it is not.
If halting is not appropriate, the value $-1$ or $1$ is recommended. If message printing is undesirable, then the value $1$ is recommended. Otherwise, the value $0$ is recommended. When the value $-\mathbf{1}$ 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).

## 6Error Indicators and Warnings

If on entry ${\mathbf{ifail}}=0$ or $-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$
Matrix $A$ is approximately singular.
${\mathbf{ifail}}=2$
The matrix $A$ is too ill-conditioned.
${\mathbf{ifail}}=3$
On entry, ${\mathbf{ldaa}}=⟨\mathit{\text{value}}⟩$ and ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{ldaa}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
On entry, ${\mathbf{lda}}=⟨\mathit{\text{value}}⟩$ and ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{lda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
On entry, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{n}}\ge 0$.
${\mathbf{ifail}}=-99$
See Section 7 in the Introduction to the NAG Library FL Interface for further information.
${\mathbf{ifail}}=-399$
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.
${\mathbf{ifail}}=-999$
Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

## 7Accuracy

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

## 8Parallelism and Performance

f04atf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f04atf 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.

The time taken by f04atf is approximately proportional to ${n}^{3}$.
The routine must not be called with the same name for arguments b and c.

## 10Example

This example solves the set of linear equations $Ax=b$ where
 $A=( 33 16 72 -24 -10 -57 -8 -4 -17 ) and b=( -359 281 85 ) .$

### 10.1Program Text

Program Text (f04atfe.f90)

### 10.2Program Data

Program Data (f04atfe.d)

### 10.3Program Results

Program Results (f04atfe.r)