# NAG FL Interfacef07aef (dgetrs)

## ▸▿ Contents

Settings help

FL Name Style:

FL Specification Language:

## 1Purpose

f07aef solves a real system of linear equations with multiple right-hand sides,
 $AX=B or ATX=B ,$
where $A$ has been factorized by f07adf.

## 2Specification

Fortran Interface
 Subroutine f07aef ( n, nrhs, a, lda, ipiv, b, ldb, info)
 Integer, Intent (In) :: n, nrhs, lda, ipiv(*), ldb Integer, Intent (Out) :: info Real (Kind=nag_wp), Intent (In) :: a(lda,*) Real (Kind=nag_wp), Intent (Inout) :: b(ldb,*) Character (1), Intent (In) :: trans
C Header Interface
#include <nag.h>
 void f07aef_ (const char *trans, const Integer *n, const Integer *nrhs, const double a[], const Integer *lda, const Integer ipiv[], double b[], const Integer *ldb, Integer *info, const Charlen length_trans)
The routine may be called by the names f07aef, nagf_lapacklin_dgetrs or its LAPACK name dgetrs.

## 3Description

f07aef is used to solve a real system of linear equations $AX=B$ or ${A}^{\mathrm{T}}X=B$, the routine must be preceded by a call to f07adf which computes the $LU$ factorization of $A$ as $A=PLU$. The solution is computed by forward and backward substitution.
If ${\mathbf{trans}}=\text{'N'}$, the solution is computed by solving $PLY=B$ and then $UX=Y$.
If ${\mathbf{trans}}=\text{'T'}$ or $\text{'C'}$, the solution is computed by solving ${U}^{\mathrm{T}}Y=B$ and then ${L}^{\mathrm{T}}{P}^{\mathrm{T}}X=Y$.

## 4References

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

## 5Arguments

1: $\mathbf{trans}$Character(1) Input
On entry: indicates the form of the equations.
${\mathbf{trans}}=\text{'N'}$
$AX=B$ is solved for $X$.
${\mathbf{trans}}=\text{'T'}$ or $\text{'C'}$
${A}^{\mathrm{T}}X=B$ is solved for $X$.
Constraint: ${\mathbf{trans}}=\text{'N'}$, $\text{'T'}$ or $\text{'C'}$.
2: $\mathbf{n}$Integer Input
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
3: $\mathbf{nrhs}$Integer Input
On entry: $r$, the number of right-hand sides.
Constraint: ${\mathbf{nrhs}}\ge 0$.
4: $\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 $LU$ factorization of $A$, as returned by f07adf.
5: $\mathbf{lda}$Integer Input
On entry: the first dimension of the array a as declared in the (sub)program from which f07aef is called.
Constraint: ${\mathbf{lda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
6: $\mathbf{ipiv}\left(*\right)$Integer array Input
Note: the dimension of the array ipiv must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
On entry: the pivot indices, as returned by f07adf.
7: $\mathbf{b}\left({\mathbf{ldb}},*\right)$Real (Kind=nag_wp) array Input/Output
Note: the second dimension of the array b must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{nrhs}}\right)$.
On entry: the $n×r$ right-hand side matrix $B$.
On exit: the $n×r$ solution matrix $X$.
8: $\mathbf{ldb}$Integer Input
On entry: the first dimension of the array b as declared in the (sub)program from which f07aef is called.
Constraint: ${\mathbf{ldb}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
9: $\mathbf{info}$Integer Output
On exit: ${\mathbf{info}}=0$ unless the routine detects an error (see Section 6).

## 6Error Indicators and Warnings

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

## 7Accuracy

For each right-hand side vector $b$, the computed solution $x$ is the exact solution of a perturbed system of equations $\left(A+E\right)x=b$, where
 $|E|≤c(n)εP|L||U| ,$
$c\left(n\right)$ is a modest linear function of $n$, and $\epsilon$ is the machine precision.
If $\stackrel{^}{x}$ is the true solution, then the computed solution $x$ satisfies a forward error bound of the form
 $‖x-x^‖∞ ‖x‖∞ ≤c(n)cond(A,x)ε$
where $\mathrm{cond}\left(A,x\right)={‖|{A}^{-1}||A||x|‖}_{\infty }/{‖x‖}_{\infty }\le \mathrm{cond}\left(A\right)={‖|{A}^{-1}||A|‖}_{\infty }\le {\kappa }_{\infty }\left(A\right)$.
Note that $\mathrm{cond}\left(A,x\right)$ can be much smaller than $\mathrm{cond}\left(A\right)$, and $\mathrm{cond}\left({A}^{\mathrm{T}}\right)$ can be much larger (or smaller) than $\mathrm{cond}\left(A\right)$.
Forward and backward error bounds can be computed by calling f07ahf, and an estimate for ${\kappa }_{\infty }\left(A\right)$ can be obtained by calling f07agf with ${\mathbf{norm}}=\text{'I'}$.

## 8Parallelism and Performance

Background information to multithreading can be found in the Multithreading documentation.
f07aef is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f07aef 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.

## 9Further Comments

The total number of floating-point operations is approximately $2{n}^{2}r$.
This routine may be followed by a call to f07ahf to refine the solution and return an error estimate.
The complex analogue of this routine is f07asf.

## 10Example

This example solves the system of equations $AX=B$, where
 $A= ( 1.80 2.88 2.05 -0.89 5.25 -2.95 -0.95 -3.80 1.58 -2.69 -2.90 -1.04 -1.11 -0.66 -0.59 0.80 ) and B= ( 9.52 18.47 24.35 2.25 0.77 -13.28 -6.22 -6.21 ) .$
Here $A$ is nonsymmetric and must first be factorized by f07adf.

### 10.1Program Text

Program Text (f07aefe.f90)

### 10.2Program Data

Program Data (f07aefe.d)

### 10.3Program Results

Program Results (f07aefe.r)