F07 Chapter Contents
F07 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentF07BNF (ZGBSV)

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

F07BNF (ZGBSV) computes the solution to a complex system of linear equations
 $AX=B ,$
where $A$ is an $n$ by $n$ band matrix, with ${k}_{l}$ subdiagonals and ${k}_{u}$ superdiagonals, and $X$ and $B$ are $n$ by $r$ matrices.

## 2  Specification

 SUBROUTINE F07BNF ( N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, INFO)
 INTEGER N, KL, KU, NRHS, LDAB, IPIV(N), LDB, INFO COMPLEX (KIND=nag_wp) AB(LDAB,*), B(LDB,*)
The routine may be called by its LAPACK name zgbsv.

## 3  Description

F07BNF (ZGBSV) uses the $LU$ decomposition with partial pivoting and row interchanges to factor $A$ as $A=PLU$, where $P$ is a permutation matrix, $L$ is a product of permutation and unit lower triangular matrices with ${k}_{l}$ subdiagonals, and $U$ is upper triangular with $\left({k}_{l}+{k}_{u}\right)$ superdiagonals. The factored form of $A$ is then used to solve the system of equations $AX=B$.

## 4  References

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

## 5  Parameters

1:     N – INTEGERInput
On entry: $n$, the number of linear equations, i.e., the order of the matrix $A$.
Constraint: ${\mathbf{N}}\ge 0$.
2:     KL – INTEGERInput
On entry: ${k}_{l}$, the number of subdiagonals within the band of the matrix $A$.
Constraint: ${\mathbf{KL}}\ge 0$.
3:     KU – INTEGERInput
On entry: ${k}_{u}$, the number of superdiagonals within the band of the matrix $A$.
Constraint: ${\mathbf{KU}}\ge 0$.
4:     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:     AB(LDAB,$*$) – COMPLEX (KIND=nag_wp) arrayInput/Output
Note: the second dimension of the array AB must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
On entry: the $n$ by $n$ coefficient matrix $A$.
The matrix is stored in rows ${k}_{l}+1$ to $2{k}_{l}+{k}_{u}+1$; the first ${k}_{l}$ rows need not be set, more precisely, the element ${A}_{ij}$ must be stored in
 $ABkl+ku+1+i-jj=Aij for ​max1,j-ku≤i≤minn,j+kl.$
See Section 8 for further details.
On exit: if ${\mathbf{INFO}}\ge {\mathbf{0}}$, AB is overwritten by details of the factorization.
The upper triangular band matrix $U$, with ${k}_{l}+{k}_{u}$ superdiagonals, is stored in rows $1$ to ${k}_{l}+{k}_{u}+1$ of the array, and the multipliers used to form the matrix $L$ are stored in rows ${k}_{l}+{k}_{u}+2$ to $2{k}_{l}+{k}_{u}+1$.
6:     LDAB – INTEGERInput
On entry: the first dimension of the array AB as declared in the (sub)program from which F07BNF (ZGBSV) is called.
Constraint: ${\mathbf{LDAB}}\ge 2×{\mathbf{KL}}+{\mathbf{KU}}+1$.
7:     IPIV(N) – INTEGER arrayOutput
On exit: if no constraints are violated, the pivot indices that define the permutation matrix $P$; at the $i$th step row $i$ of the matrix was interchanged with row ${\mathbf{IPIV}}\left(i\right)$. ${\mathbf{IPIV}}\left(i\right)=i$ indicates a row interchange was not required.
8:     B(LDB,$*$) – COMPLEX (KIND=nag_wp) arrayInput/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$ by $r$ right-hand side matrix $B$.
On exit: if ${\mathbf{INFO}}={\mathbf{0}}$, the $n$ by $r$ solution matrix $X$.
9:     LDB – INTEGERInput
On entry: the first dimension of the array B as declared in the (sub)program from which F07BNF (ZGBSV) is called.
Constraint: ${\mathbf{LDB}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
10:   INFO – INTEGEROutput
On exit: ${\mathbf{INFO}}=0$ unless the routine detects an error (see Section 6).

## 6  Error Indicators and Warnings

Errors or warnings detected by the routine:
${\mathbf{INFO}}<0$
If ${\mathbf{INFO}}=-i$, the $i$th argument had an illegal value. An explanatory message is output, and execution of the program is terminated.
${\mathbf{INFO}}>0$
If ${\mathbf{INFO}}=i$, ${u}_{ii}$ is exactly zero. The factorization has been completed, but the factor $U$ is exactly singular, so the solution could not be computed.

## 7  Accuracy

The computed solution for a single right-hand side, $\stackrel{^}{x}$, satisfies an equation of the form
 $A+E x^ = b ,$
where
 $E1 = Oε A1$
and $\epsilon$ is the machine precision. An approximate error bound for the computed solution is given by
 $x^-x 1 x1 ≤ κA E1 A1 ,$
where $\kappa \left(A\right)={‖{A}^{-1}‖}_{1}{‖A‖}_{1}$, the condition number of $A$ with respect to the solution of the linear equations. See Section 4.4 of Anderson et al. (1999) for further details.
Following the use of F07BNF (ZGBSV), F07BUF (ZGBCON) can be used to estimate the condition number of $A$ and F07BVF (ZGBRFS) can be used to obtain approximate error bounds. Alternatives to F07BNF (ZGBSV), which return condition and error estimates directly are F04CBF and F07BPF (ZGBSVX).

## 8  Further Comments

The band storage scheme for the array AB is illustrated by the following example, when $n=6$, ${k}_{l}=1$, and ${k}_{u}=2$. Storage of the band matrix $A$ in the array AB:
 $* * * + + + * * a13 a24 a35 a46 * a12 a23 a34 a45 a56 a11 a22 a33 a44 a55 a66 a21 a32 a43 a54 a65 *$
Array elements marked $*$ need not be set and are not referenced by the routine. Array elements marked $+$ need not be set, but are defined on exit from the routine and contain the elements ${u}_{14}$, ${u}_{25}$ and ${u}_{36}$.
The total number of floating point operations required to solve the equations $AX=B$ depends upon the pivoting required, but if $n\gg {k}_{l}+{k}_{u}$ then it is approximately bounded by $\mathit{O}\left(n{k}_{l}\left({k}_{l}+{k}_{u}\right)\right)$ for the factorization and $\mathit{O}\left(n\left(2{k}_{l}+{k}_{u}\right)r\right)$ for the solution following the factorization.
The real analogue of this routine is F07BAF (DGBSV).

## 9  Example

This example solves the equations
 $Ax=b ,$
where $A$ is the band matrix
 $A = -1.65+2.26i -2.05-0.85i 0.97-2.84i 0.00i+0.00 6.30i -1.48-1.75i -3.99+4.01i 0.59-0.48i 0.00i+0.00 -0.77+2.83i -1.06+1.94i 3.33-1.04i 0.00i+0.00 0.00i+0.00 4.48-1.09i -0.46-1.72i and b = -1.06+21.50i -22.72-53.90i 28.24-38.60i -34.56+16.73i .$
Details of the $LU$ factorization of $A$ are also output.

### 9.1  Program Text

Program Text (f07bnfe.f90)

### 9.2  Program Data

Program Data (f07bnfe.d)

### 9.3  Program Results

Program Results (f07bnfe.r)