$$A={U}^{\mathrm{T}}U\text{\hspace{1em} or \hspace{1em}}A=L{L}^{\mathrm{T}}$$
to compute the solution to a real system of linear equations
$$AX=B\text{,}$$
where $A$ is an $n\times n$ symmetric positive definite band matrix of bandwidth $(2{k}_{d}+1)$ and $X$ and $B$ are $n\times r$ matrices. Error bounds on the solution and a condition estimate are also provided.
Whether or not the system will be equilibrated depends on the scaling of the matrix $A$, but if equilibration is used, $A$ is overwritten by ${D}_{S}A{D}_{S}$ and $B\times {D}_{S}B$.
2.If ${\mathbf{fact}}=\text{'N'}$ or $\text{'E'}$, the Cholesky decomposition is used to factor the matrix $A$ (after equilibration if ${\mathbf{fact}}=\text{'E'}$) as $A={U}^{\mathrm{T}}U$ if ${\mathbf{uplo}}=\text{'U'}$ or $A=L{L}^{\mathrm{T}}$ if ${\mathbf{uplo}}=\text{'L'}$, where $U$ is an upper triangular matrix and $L$ is a lower triangular matrix.
3.If the leading $i\times i$ principal minor of $A$ is not positive definite, 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.
4.The system of equations is solved for $X$ using the factored form of $A$.
5.Iterative refinement is applied to improve the computed solution matrix and to calculate error bounds and backward error estimates for it.
6.If equilibration was used, the matrix $X$ is premultiplied by ${D}_{S}$ so that it solves the original system before equilibration.
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 https://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$ is supplied on entry, and if not, whether the matrix $A$ should be equilibrated before it is factorized.
${\mathbf{fact}}=\text{'F'}$
afb contains the factorized form of $A$. If ${\mathbf{equed}}=\text{'Y'}$, the matrix $A$ has been equilibrated with scaling factors given by s. ab and afb will not be modified.
${\mathbf{fact}}=\text{'N'}$
The matrix $A$ will be copied to afb and factorized.
${\mathbf{fact}}=\text{'E'}$
The matrix $A$ will be equilibrated if necessary, then copied to afb and factorized.
Constraint:
${\mathbf{fact}}=\text{'F'}$, $\text{'N'}$ or $\text{'E'}$.
2: $\mathbf{uplo}$ – Character(1)Input
On entry: if ${\mathbf{uplo}}=\text{'U'}$, the upper triangle of $A$ is stored.
If ${\mathbf{uplo}}=\text{'L'}$, the lower triangle of $A$ is stored.
Constraint:
${\mathbf{uplo}}=\text{'U'}$ or $\text{'L'}$.
3: $\mathbf{n}$ – IntegerInput
On entry: $n$, the number of linear equations, i.e., the order of the matrix $A$.
Constraint:
${\mathbf{n}}\ge 0$.
4: $\mathbf{kd}$ – IntegerInput
On entry: ${k}_{d}$, the number of superdiagonals of the matrix $A$ if ${\mathbf{uplo}}=\text{'U'}$, or the number of subdiagonals if ${\mathbf{uplo}}=\text{'L'}$.
Constraint:
${\mathbf{kd}}\ge 0$.
5: $\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$.
6: $\mathbf{ab}({\mathbf{ldab}},*)$ – Real (Kind=nag_wp) arrayInput/Output
Note: the second dimension of the array ab
must be at least
$\mathrm{max}\phantom{\rule{0.125em}{0ex}}(1,{\mathbf{n}})$.
On entry: the upper or lower triangle of the symmetric band matrix $A$, except if ${\mathbf{fact}}=\text{'F'}$ and ${\mathbf{equed}}=\text{'Y'}$, in which case ab must contain the equilibrated matrix ${D}_{S}A{D}_{S}$.
The matrix is stored in rows $1$ to ${k}_{d}+1$, more precisely,
if ${\mathbf{uplo}}=\text{'U'}$, the elements of the upper triangle of $A$ within the band must be stored with element ${A}_{ij}$ in ${\mathbf{ab}}({k}_{d}+1+i-j,j)\text{ for}\mathrm{max}\phantom{\rule{0.125em}{0ex}}(1,j-{k}_{d})\le i\le j$;
if ${\mathbf{uplo}}=\text{'L'}$, the elements of the lower triangle of $A$ within the band must be stored with element ${A}_{ij}$ in ${\mathbf{ab}}(1+i-j,j)\text{ for}j\le i\le \mathrm{min}\phantom{\rule{0.125em}{0ex}}(n,j+{k}_{d})\text{.}$
On exit: if ${\mathbf{fact}}=\text{'E'}$ and ${\mathbf{equed}}=\text{'Y'}$, ab is overwritten by ${D}_{S}A{D}_{S}$.
7: $\mathbf{ldab}$ – IntegerInput
On entry: the first dimension of the array ab as declared in the (sub)program from which f07hbf is called.
Constraint:
${\mathbf{ldab}}\ge {\mathbf{kd}}+1$.
8: $\mathbf{afb}({\mathbf{ldafb}},*)$ – Real (Kind=nag_wp) arrayInput/Output
Note: the second dimension of the array afb
must be at least
$\mathrm{max}\phantom{\rule{0.125em}{0ex}}(1,{\mathbf{n}})$.
On entry: if ${\mathbf{fact}}=\text{'F'}$, afb contains the triangular factor $U$ or $L$ from the Cholesky factorization $A={U}^{\mathrm{T}}U$ or $A=L{L}^{\mathrm{T}}$ of the band matrix $A$, in the same storage format as $A$. If ${\mathbf{equed}}=\text{'Y'}$, afb is the factorized form of the equilibrated matrix $A$.
On exit: if ${\mathbf{fact}}=\text{'N'}$, afb returns the triangular factor $U$ or $L$ from the Cholesky factorization $A={U}^{\mathrm{T}}U$ or $A=L{L}^{\mathrm{T}}$.
If ${\mathbf{fact}}=\text{'E'}$, afb returns the triangular factor $U$ or $L$ from the Cholesky factorization $A={U}^{\mathrm{T}}U$ or $A=L{L}^{\mathrm{T}}$ of the equilibrated matrix $A$ (see the description of ab for the form of the equilibrated matrix).
9: $\mathbf{ldafb}$ – IntegerInput
On entry: the first dimension of the array afb as declared in the (sub)program from which f07hbf is called.
On entry: if ${\mathbf{fact}}=\text{'N'}$ or $\text{'E'}$, equed need not be set.
If ${\mathbf{fact}}=\text{'F'}$, equed must specify the form of the equilibration that was performed as follows:
if ${\mathbf{equed}}=\text{'N'}$, no equilibration;
if ${\mathbf{equed}}=\text{'Y'}$, equilibration was performed, i.e., $A$ has been replaced by ${D}_{S}A{D}_{S}$.
On exit: if ${\mathbf{fact}}=\text{'F'}$, equed is unchanged from entry.
Otherwise, if no constraints are violated, equed specifies the form of the equilibration that was performed as specified above.
Constraint:
if ${\mathbf{fact}}=\text{'F'}$, ${\mathbf{equed}}=\text{'N'}$ or $\text{'Y'}$.
11: $\mathbf{s}\left(*\right)$ – Real (Kind=nag_wp) arrayInput/Output
Note: the dimension of the array s
must be at least
$\mathrm{max}\phantom{\rule{0.125em}{0ex}}(1,{\mathbf{n}})$.
On entry: if ${\mathbf{fact}}=\text{'N'}$ or $\text{'E'}$, s need not be set.
If ${\mathbf{fact}}=\text{'F'}$ and ${\mathbf{equed}}=\text{'Y'}$, s must contain the scale factors, ${D}_{S}$, for $A$; each element of s must be positive.
On exit: if ${\mathbf{fact}}=\text{'F'}$, s is unchanged from entry.
Otherwise, if no constraints are violated and ${\mathbf{equed}}=\text{'Y'}$, s contains the scale factors, ${D}_{S}$, for $A$; each element of s is positive.
12: $\mathbf{b}({\mathbf{ldb}},*)$ – Real (Kind=nag_wp) arrayInput/Output
Note: the second dimension of the array b
must be at least
$\mathrm{max}\phantom{\rule{0.125em}{0ex}}(1,{\mathbf{nrhs}})$.
On entry: the $n\times r$ right-hand side matrix $B$.
On exit: if ${\mathbf{equed}}=\text{'N'}$, b is not modified.
If ${\mathbf{equed}}=\text{'Y'}$, b is overwritten by ${D}_{S}B$.
13: $\mathbf{ldb}$ – IntegerInput
On entry: the first dimension of the array b as declared in the (sub)program from which f07hbf is called.
14: $\mathbf{x}({\mathbf{ldx}},*)$ – Real (Kind=nag_wp) arrayOutput
Note: the second dimension of the array x
must be at least
$\mathrm{max}\phantom{\rule{0.125em}{0ex}}(1,{\mathbf{nrhs}})$.
On exit: if ${\mathbf{info}}={\mathbf{0}}$ or ${\mathbf{n}+{\mathbf{1}}}$, the $n\times r$ solution matrix $X$ to the original system of equations. Note that the arrays $A$ and $B$ are modified on exit if ${\mathbf{equed}}=\text{'Y'}$, and the solution to the equilibrated system is ${D}_{S}^{-1}X$.
15: $\mathbf{ldx}$ – IntegerInput
On entry: the first dimension of the array x as declared in the (sub)program from which f07hbf is called.
On exit: if no constraints are violated, an estimate of the reciprocal condition number of the matrix $A$ (after equilibration if that is performed), computed as ${\mathbf{rcond}}=1.0/\left({\Vert A\Vert}_{1}{\Vert {A}^{-1}\Vert}_{1}\right)$.
17: $\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 ${\Vert {\hat{x}}_{j}-{x}_{j}\Vert}_{\infty}/{\Vert {x}_{j}\Vert}_{\infty}\le {\mathbf{ferr}}\left(j\right)$ where ${\hat{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.
18: $\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 ${\hat{x}}_{j}$ (i.e., the smallest relative change in any element of $A$ or $B$ that makes ${\hat{x}}_{j}$ an exact solution).
19: $\mathbf{work}\left(3\times {\mathbf{n}}\right)$ – Real (Kind=nag_wp) arrayWorkspace
The leading minor of order $\u27e8\mathit{\text{value}}\u27e9$ of $A$ is not positive definite, so the factorization could not be completed, and the solution has not been computed. ${\mathbf{rcond}}=0.0$ is returned.
${\mathbf{info}}={\mathbf{n}}+1$
$U$ (or $L$) 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 $x$ is the exact solution of a perturbed system of equations $(A+E)x=b$, where
if ${\mathbf{uplo}}=\text{'U'}$, $\left|E\right|\le c\left(n\right)\epsilon \left|{U}^{\mathrm{T}}\right|\left|U\right|$;
if ${\mathbf{uplo}}=\text{'L'}$,$\left|E\right|\le c\left(n\right)\epsilon \left|L\right|\left|{L}^{\mathrm{T}}\right|$,
$c\left(n\right)$ is a modest linear function of $n$, and $\epsilon $ is the machine precision. See Section 10.1 of Higham (2002) for further details.
If $\hat{x}$ is the true solution, then the computed solution $x$ satisfies a forward error bound of the form
where
$\mathrm{cond}(A,\hat{x},b)={\Vert \left|{A}^{-1}\right|(\left|A\right|\left|\hat{x}\right|+\left|b\right|)\Vert}_{\infty}/{\Vert \hat{x}\Vert}_{\infty}\le \mathrm{cond}\left(A\right)={\Vert \left|{A}^{-1}\right|\left|A\right|\Vert}_{\infty}\le {\kappa}_{\infty}\left(A\right)$.
If $\hat{x}$ is the $j$th column of $X$, then ${w}_{c}$ is returned in ${\mathbf{berr}}\left(j\right)$ and a bound on ${\Vert x-\hat{x}\Vert}_{\infty}/{\Vert \hat{x}\Vert}_{\infty}$ is returned in ${\mathbf{ferr}}\left(j\right)$. See Section 4.4 of Anderson et al. (1999) for further details.
8Parallelism and Performance
Background information to multithreading can be found in the Multithreading documentation.
f07hbf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f07hbf 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
When $n\gg k$, the factorization of $A$ requires approximately $n{(k+1)}^{2}$ floating-point operations, where $k$ is the number of superdiagonals.
For each right-hand side, computation of the backward error involves a minimum of $8nk$ floating-point operations. Each step of iterative refinement involves an additional $12nk$ operations. At most five steps of iterative refinement are performed, but usually only one or two steps are required. Estimating the forward error involves solving a number of systems of equations of the form $Ax=b$; the number is usually $4$ or $5$ and never more than $11$. Each solution involves approximately $4nk$ operations.
Error estimates for the solutions, information on equilibration and an estimate of the reciprocal of the condition number of the scaled matrix $A$ are also output.