# NAG Library Routine Document

## 1Purpose

f07cpf (zgtsvx) uses the $LU$ factorization to compute the solution to a complex system of linear equations
 $AX=B , ATX=B or AHX=B ,$
where $A$ is a tridiagonal matrix of order $n$ and $X$ and $B$ are $n$ by $r$ matrices. Error bounds on the solution and a condition estimate are also provided.

## 2Specification

Fortran Interface
 Subroutine f07cpf ( fact, n, nrhs, dl, d, du, dlf, df, duf, du2, ipiv, b, ldb, x, ldx, ferr, berr, work, info)
 Integer, Intent (In) :: n, nrhs, ldb, ldx Integer, Intent (Inout) :: ipiv(*) Integer, Intent (Out) :: info Real (Kind=nag_wp), Intent (Out) :: rcond, ferr(nrhs), berr(nrhs), rwork(n) Complex (Kind=nag_wp), Intent (In) :: dl(*), d(*), du(*), b(ldb,*) Complex (Kind=nag_wp), Intent (Inout) :: dlf(*), df(*), duf(*), du2(*), x(ldx,*) Complex (Kind=nag_wp), Intent (Out) :: work(2*n) Character (1), Intent (In) :: fact, trans
#include nagmk26.h
 void f07cpf_ (const char *fact, const char *trans, const Integer *n, const Integer *nrhs, const Complex dl[], const Complex d[], const Complex du[], Complex dlf[], Complex df[], Complex duf[], Complex du2[], Integer ipiv[], const Complex b[], const Integer *ldb, Complex x[], const Integer *ldx, double *rcond, double ferr[], double berr[], Complex work[], double rwork[], Integer *info, const Charlen length_fact, const Charlen length_trans)
The routine may be called by its LAPACK name zgtsvx.

## 3Description

f07cpf (zgtsvx) performs the following steps:
 1 If ${\mathbf{fact}}=\text{'N'}$, the $LU$ decomposition is used to factor the matrix $A$ as $A=LU$, where $L$ is a product of permutation and unit lower bidiagonal matrices and $U$ is upper triangular with nonzeros in only the main diagonal and first two superdiagonals. 2 If some ${u}_{ii}=0$, so that $U$ is exactly singular, then the routine returns with ${\mathbf{info}}=i$. Otherwise, the factored form of $A$ is used to estimate the condition number of the matrix $A$. If the reciprocal of the condition number is less than machine precision, ${\mathbf{info}}=\mathbf{n}+{\mathbf{1}}$ is returned as a warning, but the routine still goes on to solve for $X$ and compute error bounds as described below. 3 The system of equations is solved for $X$ using the factored form of $A$. 4 Iterative refinement is applied to improve the computed solution matrix and to calculate error bounds and backward error estimates for it.

## 4References

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 http://www.netlib.org/lapack/lug
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
Higham N J (2002) Accuracy and Stability of Numerical Algorithms (2nd Edition) SIAM, Philadelphia

## 5Arguments

1:     $\mathbf{fact}$ – Character(1)Input
On entry: specifies whether or not the factorized form of the matrix $A$ has been supplied.
${\mathbf{fact}}=\text{'F'}$
dlf, df, duf, du2 and ipiv contain the factorized form of the matrix $A$. dlf, df, duf, du2 and ipiv will not be modified.
${\mathbf{fact}}=\text{'N'}$
The matrix $A$ will be copied to dlf, df and duf and factorized.
Constraint: ${\mathbf{fact}}=\text{'F'}$ or $\text{'N'}$.
2:     $\mathbf{trans}$ – Character(1)Input
On entry: specifies the form of the system of equations.
${\mathbf{trans}}=\text{'N'}$
$AX=B$ (No transpose).
${\mathbf{trans}}=\text{'T'}$
${A}^{\mathrm{T}}X=B$ (Transpose).
${\mathbf{trans}}=\text{'C'}$
${A}^{\mathrm{H}}X=B$ (Conjugate transpose).
Constraint: ${\mathbf{trans}}=\text{'N'}$, $\text{'T'}$ or $\text{'C'}$.
3:     $\mathbf{n}$ – IntegerInput
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
4:     $\mathbf{nrhs}$ – IntegerInput
On entry: $r$, the number of right-hand sides, i.e., the number of columns of the matrix $B$.
Constraint: ${\mathbf{nrhs}}\ge 0$.
5:     $\mathbf{dl}\left(*\right)$ – Complex (Kind=nag_wp) arrayInput
Note: the dimension of the array dl must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}-1\right)$.
On entry: the $\left(n-1\right)$ subdiagonal elements of $A$.
6:     $\mathbf{d}\left(*\right)$ – Complex (Kind=nag_wp) arrayInput
Note: the dimension of the array d must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
On entry: the $n$ diagonal elements of $A$.
7:     $\mathbf{du}\left(*\right)$ – Complex (Kind=nag_wp) arrayInput
Note: the dimension of the array du must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}-1\right)$.
On entry: the $\left(n-1\right)$ superdiagonal elements of $A$.
8:     $\mathbf{dlf}\left(*\right)$ – Complex (Kind=nag_wp) arrayInput/Output
Note: the dimension of the array dlf must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}-1\right)$.
On entry: if ${\mathbf{fact}}=\text{'F'}$, dlf contains the $\left(n-1\right)$ multipliers that define the matrix $L$ from the $LU$ factorization of $A$.
On exit: if ${\mathbf{fact}}=\text{'N'}$, dlf contains the $\left(n-1\right)$ multipliers that define the matrix $L$ from the $LU$ factorization of $A$.
9:     $\mathbf{df}\left(*\right)$ – Complex (Kind=nag_wp) arrayInput/Output
Note: the dimension of the array df must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
On entry: if ${\mathbf{fact}}=\text{'F'}$, df contains the $n$ diagonal elements of the upper triangular matrix $U$ from the $LU$ factorization of $A$.
On exit: if ${\mathbf{fact}}=\text{'N'}$, df contains the $n$ diagonal elements of the upper triangular matrix $U$ from the $LU$ factorization of $A$.
10:   $\mathbf{duf}\left(*\right)$ – Complex (Kind=nag_wp) arrayInput/Output
Note: the dimension of the array duf must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}-1\right)$.
On entry: if ${\mathbf{fact}}=\text{'F'}$, duf contains the $\left(n-1\right)$ elements of the first superdiagonal of $U$.
On exit: if ${\mathbf{fact}}=\text{'N'}$, duf contains the $\left(n-1\right)$ elements of the first superdiagonal of $U$.
11:   $\mathbf{du2}\left(*\right)$ – Complex (Kind=nag_wp) arrayInput/Output
Note: the dimension of the array du2 must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}-2\right)$.
On entry: if ${\mathbf{fact}}=\text{'F'}$, du2 contains the ($n-2$) elements of the second superdiagonal of $U$.
On exit: if ${\mathbf{fact}}=\text{'N'}$, du2 contains the ($n-2$) elements of the second superdiagonal of $U$.
12:   $\mathbf{ipiv}\left(*\right)$ – Integer arrayInput/Output
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: if ${\mathbf{fact}}=\text{'F'}$, ipiv contains the pivot indices from the $LU$ factorization of $A$.
On exit: if ${\mathbf{fact}}=\text{'N'}$, ipiv contains the pivot indices from the $LU$ factorization of $A$; row $i$ of the matrix was interchanged with row ${\mathbf{ipiv}}\left(i\right)$. ${\mathbf{ipiv}}\left(i\right)$ will always be either $i$ or $i+1$; ${\mathbf{ipiv}}\left(i\right)=i$ indicates a row interchange was not required.
13:   $\mathbf{b}\left({\mathbf{ldb}},*\right)$ – Complex (Kind=nag_wp) arrayInput
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$ by $r$ right-hand side matrix $B$.
14:   $\mathbf{ldb}$ – IntegerInput
On entry: the first dimension of the array b as declared in the (sub)program from which f07cpf (zgtsvx) is called.
Constraint: ${\mathbf{ldb}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
15:   $\mathbf{x}\left({\mathbf{ldx}},*\right)$ – Complex (Kind=nag_wp) arrayOutput
Note: the second dimension of the array x must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{nrhs}}\right)$.
On exit: if ${\mathbf{info}}={\mathbf{0}}$ or $\mathbf{n}+{\mathbf{1}}$, the $n$ by $r$ solution matrix $X$.
16:   $\mathbf{ldx}$ – IntegerInput
On entry: the first dimension of the array x as declared in the (sub)program from which f07cpf (zgtsvx) is called.
Constraint: ${\mathbf{ldx}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
17:   $\mathbf{rcond}$ – Real (Kind=nag_wp)Output
On exit: the estimate of the reciprocal condition number of the matrix $A$. If ${\mathbf{rcond}}=0.0$, the matrix may be exactly singular. This condition is indicated by ${\mathbf{info}}>{\mathbf{0}} \text{and} {\mathbf{info}}\le \mathbf{n}$. Otherwise, if rcond is less than the machine precision, the matrix is singular to working precision. This condition is indicated by ${\mathbf{info}}=\mathbf{n}+{\mathbf{1}}$.
18:   $\mathbf{ferr}\left({\mathbf{nrhs}}\right)$ – Real (Kind=nag_wp) arrayOutput
On exit: if ${\mathbf{info}}={\mathbf{0}}$ or $\mathbf{n}+{\mathbf{1}}$, an estimate of the forward error bound for each computed solution vector, such that ${‖{\stackrel{^}{x}}_{j}-{x}_{j}‖}_{\infty }/{‖{x}_{j}‖}_{\infty }\le {\mathbf{ferr}}\left(j\right)$ where ${\stackrel{^}{x}}_{j}$ is the $j$th column of the computed solution returned in the array x and ${x}_{j}$ is the corresponding column of the exact solution $X$. The estimate is as reliable as the estimate for rcond, and is almost always a slight overestimate of the true error.
19:   $\mathbf{berr}\left({\mathbf{nrhs}}\right)$ – Real (Kind=nag_wp) arrayOutput
On exit: if ${\mathbf{info}}={\mathbf{0}}$ or $\mathbf{n}+{\mathbf{1}}$, an estimate of the component-wise relative backward error of each computed solution vector ${\stackrel{^}{x}}_{j}$ (i.e., the smallest relative change in any element of $A$ or $B$ that makes ${\stackrel{^}{x}}_{j}$ an exact solution).
20:   $\mathbf{work}\left(2×{\mathbf{n}}\right)$ – Complex (Kind=nag_wp) arrayWorkspace
21:   $\mathbf{rwork}\left({\mathbf{n}}\right)$ – Real (Kind=nag_wp) arrayWorkspace
22:   $\mathbf{info}$ – IntegerOutput
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.
${\mathbf{info}}>0 \text{and} {\mathbf{info}}<{\mathbf{n}}$
Element $〈\mathit{\text{value}}〉$ of the diagonal is exactly zero. The factorization has not been completed, but the factor $U$ is exactly singular, so the solution and error bounds could not be computed. ${\mathbf{rcond}}=0.0$ is returned.
${\mathbf{info}}>0 \text{and} {\mathbf{info}}={\mathbf{n}}$
Element $〈\mathit{\text{value}}〉$ of the diagonal is exactly zero. The factorization has been completed, but the factor $U$ is exactly singular, so the solution and error bounds could not be computed. ${\mathbf{rcond}}=0.0$ is returned.
${\mathbf{info}}={\mathbf{n}}+1$
$U$ is nonsingular, but rcond is less than machine precision, meaning that the matrix is singular to working precision. Nevertheless, the solution and error bounds are computed because there are a number of situations where the computed solution can be more accurate than the value of rcond would suggest.

## 7Accuracy

For each right-hand side vector $b$, the computed solution $\stackrel{^}{x}$ is the exact solution of a perturbed system of equations $\left(A+E\right)\stackrel{^}{x}=b$, where
 $E ≤ c n ε L U ,$
$c\left(n\right)$ is a modest linear function of $n$, and $\epsilon$ is the machine precision. See Section 9.3 of Higham (2002) for further details.
If $x$ is the true solution, then the computed solution $\stackrel{^}{x}$ satisfies a forward error bound of the form
 $x-x^∞ x^∞ ≤ wc condA,x^,b$
where $\mathrm{cond}\left(A,\stackrel{^}{x},b\right)={‖\left|{A}^{-1}\right|\left(\left|A\right|\left|\stackrel{^}{x}\right|+\left|b\right|\right)‖}_{\infty }/{‖\stackrel{^}{x}‖}_{\infty }\le \mathrm{cond}\left(A\right)={‖\left|{A}^{-1}\right|\left|A\right|‖}_{\infty }\le {\kappa }_{\infty }\left(A\right)$. If $\stackrel{^}{x}$ is the $j$th column of $X$, then ${w}_{c}$ is returned in ${\mathbf{berr}}\left(j\right)$ and a bound on ${‖x-\stackrel{^}{x}‖}_{\infty }/{‖\stackrel{^}{x}‖}_{\infty }$ is returned in ${\mathbf{ferr}}\left(j\right)$. See Section 4.4 of Anderson et al. (1999) for further details.

## 8Parallelism and Performance

f07cpf (zgtsvx) is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f07cpf (zgtsvx) 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 total number of floating-point operations required to solve the equations $AX=B$ is proportional to $nr$.
The condition number estimation typically requires between four and five solves and never more than eleven solves, following the factorization. The solution is then refined, and the errors estimated, using iterative refinement.
In practice the condition number estimator is very reliable, but it can underestimate the true condition number; see Section 15.3 of Higham (2002) for further details.
The real analogue of this routine is f07cbf (dgtsvx).

## 10Example

This example solves the equations
 $AX=B ,$
where $A$ is the tridiagonal matrix
 $A = -1.3+1.3i 2.0-1.0i 0.0i+0.0 0.0i+0.0 0.0i+0.0 1.0-2.0i -1.3+1.3i 2.0+1.0i 0.0i+0.0 0.0i+0.0 0.0i+0.0 1.0+1.0i -1.3+3.3i -1.0+1.0i 0.0i+0.0 0.0i+0.0 0.0i+0.0 2.0-3.0i -0.3+4.3i 1.0-1.0i 0.0i+0.0 0.0i+0.0 0.0i+0.0 1.0+1.0i -3.3+1.3i$
and
 $B = 2.4-05.0i 2.7+06.9i 3.4+18.2i -6.9-05.3i -14.7+09.7i -6.0-00.6i 31.9-07.7i -3.9+09.3i -1.0+01.6i -3.0+12.2i .$
Estimates for the backward errors, forward errors and condition number are also output.

### 10.1Program Text

Program Text (f07cpfe.f90)

### 10.2Program Data

Program Data (f07cpfe.d)

### 10.3Program Results

Program Results (f07cpfe.r)

© The Numerical Algorithms Group Ltd, Oxford, UK. 2017