Integer, Intent (In)	::	n, kd, nrhs, ldab, ldafb, ldb, ldx
Integer, Intent (Out)	::	iwork(n), info
Real (Kind=nag_wp), Intent (Inout)	::	ab(ldab,), afb(ldafb,), s(), b(ldb,), x(ldx,*)
Real (Kind=nag_wp), Intent (Out)	::	rcond, ferr(nrhs), berr(nrhs), work(3*n)
Character (1), Intent (In)	::	fact, uplo
Character (1), Intent (InOut)	::	equed

C Header Interface

#include <nag.h>

void

f07hbf_ (const char *fact, const char *uplo, const Integer *n, const Integer *kd, const Integer *nrhs, double ab[], const Integer *ldab, double afb[], const Integer *ldafb, char *equed, double s[], double b[], const Integer *ldb, double x[], const Integer *ldx, double *rcond, double ferr[], double berr[], double work[], Integer iwork[], Integer *info, const Charlen length_fact, const Charlen length_uplo, const Charlen length_equed)

The routine may be called by the names f07hbf, nagf_lapacklin_dpbsvx or its LAPACK name dpbsvx.

3 Description

f07hbf performs the following steps:

1.If $fact ='E'$ , real diagonal scaling factors, $D_{S}$ , are computed to equilibrate the system:
$(D_{S} A D_{S}) (D_{S}^{- 1} X) = D_{S} B .$
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$ by $D_{S} B$ .
2.If $fact ='N'$ or $'E'$ , the Cholesky decomposition is used to factor the matrix $A$ (after equilibration if $fact ='E'$ ) as $A = U^{T} U$ if $uplo ='U'$ or $A = L L^{T}$ if $uplo ='L'$ , where $U$ is an upper triangular matrix and $L$ is a lower triangular matrix.
3.If the leading $i$ by $i$ principal minor of $A$ is not positive definite, then the routine returns with $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, $info = n + 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.

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 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

5 Arguments

1: $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.

$fact ='F'$: afb contains the factorized form of $A$ . If $equed ='Y'$ , the matrix $A$ has been equilibrated with scaling factors given by s. ab and afb will not be modified.
$fact ='N'$: The matrix $A$ will be copied to afb and factorized.
$fact ='E'$: The matrix $A$ will be equilibrated if necessary, then copied to afb and factorized.

Constraint:

fact ='F'

'N'

'E'

2: $uplo$ – Character(1) Input

On entry: if

uplo ='U'

, the upper triangle of

A

is stored.

uplo ='L'

, the lower triangle of

A

is stored.

Constraint:

uplo ='U'

'L'

3: $n$ – Integer Input

On entry:

n

, the number of linear equations, i.e., the order of the matrix

A

Constraint:

n \geq 0

4: $kd$ – Integer Input

On entry:

k_{d}

, the number of superdiagonals of the matrix

A

uplo ='U'

, or the number of subdiagonals if

uplo ='L'

Constraint:

kd \geq 0

5: $nrhs$ – Integer Input

On entry:

r

, the number of right-hand sides, i.e., the number of columns of the matrix

B

Constraint:

nrhs \geq 0

6: $ab (ldab *)$ – Real (Kind=nag_wp) array Input/Output

Note: the second dimension of the array ab must be at least

\max (1, n)

On entry: the upper or lower triangle of the symmetric band matrix

A

, except if

fact ='F'

and

equed ='Y'

, in which case ab must contain the equilibrated matrix

D_{S} A D_{S}

The matrix is stored in rows

1

k_{d} + 1

, more precisely,

if $uplo ='U'$ , the elements of the upper triangle of $A$ within the band must be stored with element $A_{i j}$ in $ab (k_{d} + 1 + i - j, j) for \max (1, j - k_{d}) \leq i \leq j$ ;
if $uplo ='L'$ , the elements of the lower triangle of $A$ within the band must be stored with element $A_{i j}$ in $ab (1 + i - j, j) for j \leq i \leq \min (n, j + k_{d}) .$

On exit: if

fact ='E'

and

equed ='Y'

, ab is overwritten by

D_{S} A D_{S}

7: $ldab$ – Integer Input

On entry: the first dimension of the array ab as declared in the (sub)program from which f07hbf is called.

Constraint:

ldab \geq kd + 1

8: $afb (ldafb *)$ – Real (Kind=nag_wp) array Input/Output

Note: the second dimension of the array afb must be at least

\max (1, n)

On entry: if

fact ='F'

, afb contains the triangular factor

U

L

from the Cholesky factorization

A = U^{T} U

A = L L^{T}

of the band matrix

A

, in the same storage format as

A

. If

equed ='Y'

, afb is the factorized form of the equilibrated matrix

A

On exit: if

fact ='N'

, afb returns the triangular factor

U

L

from the Cholesky factorization

A = U^{T} U

A = L L^{T}

fact ='E'

, afb returns the triangular factor

U

L

from the Cholesky factorization

A = U^{T} U

A = L L^{T}

of the equilibrated matrix

A

(see the description of ab for the form of the equilibrated matrix).

9: $ldafb$ – Integer Input

On entry: the first dimension of the array afb as declared in the (sub)program from which f07hbf is called.

Constraint:

ldafb \geq kd + 1

10: $equed$ – Character(1) Input/Output

On entry: if

fact ='N'

'E'

, equed need not be set.

fact ='F'

, equed must specify the form of the equilibration that was performed as follows:

if $equed ='N'$ , no equilibration;
if $equed ='Y'$ , equilibration was performed, i.e., $A$ has been replaced by $D_{S} A D_{S}$ .

On exit: if

fact ='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

fact ='F'

equed ='N'

'Y'

11: $s (*)$ – Real (Kind=nag_wp) array Input/Output

Note: the dimension of the array s must be at least

\max (1, n)

On entry: if

fact ='N'

'E'

, s need not be set.

fact ='F'

and

equed ='Y'

, s must contain the scale factors,

D_{S}

, for

A

; each element of s must be positive.

On exit: if

fact ='F'

, s is unchanged from entry.

Otherwise, if no constraints are violated and

equed ='Y'

, s contains the scale factors,

D_{S}

, for

A

; each element of s is positive.

12: $b (ldb *)$ – Real (Kind=nag_wp) array Input/Output

Note: the second dimension of the array b must be at least

\max (1, nrhs)

On entry: the

n

r

right-hand side matrix

B

On exit: if

equed ='N'

, b is not modified.

equed ='Y'

, b is overwritten by

D_{S} B

13: $ldb$ – Integer Input

On entry: the first dimension of the array b as declared in the (sub)program from which f07hbf is called.

Constraint:

ldb \geq \max (1, n)

14: $x (ldx *)$ – Real (Kind=nag_wp) array Output

Note: the second dimension of the array x must be at least

\max (1, nrhs)

On exit: if

info = 0

n + 1

, the

n

r

solution matrix

X

to the original system of equations. Note that the arrays

A

and

B

are modified on exit if

equed ='Y'

, and the solution to the equilibrated system is

D_{S}^{- 1} X

15: $ldx$ – Integer Input

On entry: the first dimension of the array x as declared in the (sub)program from which f07hbf is called.

Constraint:

ldx \geq \max (1, n)

16: $rcond$ – Real (Kind=nag_wp) Output

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

rcond = 1.0 / ({‖A‖}_{1} {‖A^{- 1}‖}_{1})

17: $ferr (nrhs)$ – Real (Kind=nag_wp) array Output

On exit: if

info = 0

n + 1

, an estimate of the forward error bound for each computed solution vector, such that

{‖{\hat{x}}_{j} - x_{j}‖}_{\infty} / {‖x_{j}‖}_{\infty} \leq ferr (j)

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: $berr (nrhs)$ – Real (Kind=nag_wp) array Output

On exit: if

info = 0

n + 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

B

that makes

{\hat{x}}_{j}

an exact solution).

19: $work (3 \times n)$ – Real (Kind=nag_wp) array Workspace

20: $iwork (n)$ – Integer array Workspace

21: $info$ – Integer Output

On exit:

info = 0

unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

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

$info > 0 and info \leq n$: The leading minor of order $〈value〉$ of $A$ is not positive definite, so the factorization could not be completed, and the solution has not been computed. $rcond = 0.0$ is returned.

$info = 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.

7 Accuracy

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 $uplo ='U'$ , $|E| \leq c (n) ε |U^{T}| |U|$ ;
if $uplo ='L'$ , $|E| \leq c (n) ε |L| |L^{T}|$ ,

c (n)

is a modest linear function of

n

, and

ε

is the machine precision. See Section 10.1 of Higham (2002) for further details.

\hat{x}

is the true solution, then the computed solution

x

satisfies a forward error bound of the form

\frac{{‖x - \hat{x}‖}_{\infty}}{{‖\hat{x}‖}_{\infty}} \leq w_{c} cond (A, \hat{x}, b)

where

cond (A, \hat{x}, b) = {‖|A^{- 1}| (|A| |\hat{x}| + |b|)‖}_{\infty} / {‖\hat{x}‖}_{\infty} \leq cond (A) = {‖|A^{- 1}| |A|‖}_{\infty} \leq κ_{\infty} (A)

. If

\hat{x}

is the

j

th column of

X

, then

w_{c}

is returned in

berr (j)

and a bound on

{‖x - \hat{x}‖}_{\infty} / {‖\hat{x}‖}_{\infty}

is returned in

ferr (j)

. See Section 4.4 of Anderson et al. (1999) for further details.

8 Parallelism and Performance

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.

9 Further Comments

When

n ≫ 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

8 n k

floating-point operations. Each step of iterative refinement involves an additional

12 n k

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

A x = b

; the number is usually

4

5

and never more than

11

. Each solution involves approximately

4 n k

operations.

The complex analogue of this routine is f07hpf.

10 Example

This example solves the equations

A X = B,

where

A

is the symmetric positive definite band matrix

A = (\begin{array}{r} 5.49 & 2.68 & 0 & 0 \\ 2.68 & 5.63 & - 2.39 & 0 \\ 0 & - 2.39 & 2.60 & - 2.22 \\ 0 & 0 & - 2.22 & 5.17 \end{array})

and

B = (\begin{matrix} 22.09 & 5.10 \\ 9.31 & 30.81 \\ - 5.24 & - 25.82 \\ 11.83 & 22.90 \end{matrix}) .

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.

f07hb: FL CL CPP AD

NAG FL Interfacef07hbf (dpbsvx)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
f07hbf (dpbsvx)