NAG Library Routine Document

Integer, Intent (In)	::	n, kl, ku, nrhs, ldab, ldb
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	ipiv(n)
Real (Kind=nag_wp), Intent (Inout)	::	ab(ldab,), b(ldb,)
Real (Kind=nag_wp), Intent (Out)	::	rcond, errbnd

C Header Interface

#include <nagmk26.h>

void	f04bbf_ (const Integer n, const Integer kl, const Integer ku, const Integer nrhs, double ab[], const Integer ldab, Integer ipiv[], double b[], const Integer ldb, double rcond, double errbnd, Integer *ifail)

3

Description

The

L U

decomposition with partial pivoting and row interchanges is used to factor

A

A = P L U

, where

P

is a permutation matrix,

L

is the product of permutation matrices and unit lower triangular matrices with

k_{l}

subdiagonals, and

U

is upper triangular with

(k_{l} + k_{u})

superdiagonals. The factored form of

A

is then used to solve the system of equations

A X = 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

Higham N J (2002) Accuracy and Stability of Numerical Algorithms (2nd Edition) SIAM, Philadelphia

5

Arguments

1: $n$ – IntegerInput

On entry: the number of linear equations

n

, i.e., the order of the matrix

A

Constraint:

n \geq 0

2: $kl$ – IntegerInput

On entry: the number of subdiagonals

k_{l}

, within the band of

A

Constraint:

kl \geq 0

3: $ku$ – IntegerInput

On entry: the number of superdiagonals

k_{u}

, within the band of

A

Constraint:

ku \geq 0

4: $nrhs$ – IntegerInput

On entry: the number of right-hand sides

r

, i.e., the number of columns of the matrix

B

Constraint:

nrhs \geq 0

5: $ab (ldab *)$ – Real (Kind=nag_wp) arrayInput/Output

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

\max (1, n)

On entry: the

n

n

matrix

A

The matrix is stored in rows

k_{l} + 1

2 k_{l} + k_{u} + 1

; the first

k_{l}

rows need not be set, more precisely, the element

A_{i j}

must be stored in

ab (k_{l} + k_{u} + 1 + i - j, j) = A_{i j} for ​ \max (1, j - k_{u}) \leq i \leq \min (n, j + k_{l}) .

See Section 9 for further details.

On exit: if

ifail \geq 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

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

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 f04bbf is called.

Constraint:

ldab \geq 2 \times kl + ku + 1

7: $ipiv (n)$ – Integer arrayOutput

On exit: if

ifail \geq 0

, the pivot indices that define the permutation matrix

P

; at the

i

th step row

i

of the matrix was interchanged with row

ipiv (i)

ipiv (i) = i

indicates a row interchange was not required.

8: $b (ldb *)$ – Real (Kind=nag_wp) arrayInput/Output

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

\max (1, nrhs)

On entry: the

n

r

matrix of right-hand sides

B

On exit: if

ifail = 0

n + 1

, the

n

r

solution matrix

X

9: $ldb$ – IntegerInput

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

Constraint:

ldb \geq \max (1, n)

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

On exit: if no constraints are violated, an estimate of the reciprocal of the condition number of the matrix

A

, computed as

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

11: $errbnd$ – Real (Kind=nag_wp)Output

On exit: if

ifail = 0

n + 1

, an estimate of the forward error bound for a computed solution

\hat{x}

, such that

{‖\hat{x} - x‖}_{1} / {‖x‖}_{1} \leq errbnd

, where

\hat{x}

is a column of the computed solution returned in the array b and

x

is the corresponding column of the exact solution

X

. If rcond is less than machine precision, errbnd is returned as unity.

12: $ifail$ – IntegerInput/Output

On entry: ifail must be set to

0

- 1 or 1

. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.

For environments where it might be inappropriate to halt program execution when an error is detected, the value

- 1 or 1

is recommended. If the output of error messages is undesirable, then the value

1

is recommended. Otherwise, if you are not familiar with this argument, the recommended value is

0

. When the value $- 1 or 1$ is used it is essential to test the value of ifail on exit.

On exit:

ifail = 0

unless the routine detects an error or a warning has been flagged (see Section 6).

6

Error Indicators and Warnings

If on entry

ifail = 0

- 1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

$ifail > 0 and ifail \leq n$: Diagonal element $〈value〉$ of the upper triangular factor is zero. The factorization has been completed, but the solution could not be computed.

$ifail = n + 1$: A solution has been computed, but rcond is less than machine precision so that the matrix $A$ is numerically singular.

$ifail = - 1$: On entry, $n = 〈value〉$ .
Constraint: $n \geq 0$ .

$ifail = - 2$: On entry, $kl = 〈value〉$ .
Constraint: $kl \geq 0$ .

$ifail = - 3$: On entry, $ku = 〈value〉$ .
Constraint: $ku \geq 0$ .

$ifail = - 4$: On entry, $nrhs = 〈value〉$ .
Constraint: $nrhs \geq 0$ .

$ifail = - 6$: On entry, $ldab = 〈value〉$ , $kl = 〈value〉$ and $ku = 〈value〉$ .
Constraint: $ldab \geq 2 \times kl + ku + 1$ .

$ifail = - 9$: On entry, $ldb = 〈value〉$ and $n = 〈value〉$ .
Constraint: $ldb \geq \max (1, n)$ .

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 999$: Dynamic memory allocation failed.
The integer allocatable memory required is n, and the real allocatable memory required is $3 \times n$ . In this case the factorization and the solution $X$ have been computed, but rcond and errbnd have not been computed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

7

Accuracy

The computed solution for a single right-hand side,

\hat{x}

, satisfies an equation of the form

(A + E) \hat{x} = b,

where

{‖E‖}_{1} = O (ε) {‖A‖}_{1}

and

ε

is the machine precision. An approximate error bound for the computed solution is given by

\frac{{‖\hat{x} - x‖}_{1}}{{‖x‖}_{1}} \leq κ (A) \frac{{‖E‖}_{1}}{{‖A‖}_{1}},

where

κ (A) = {‖A^{- 1}‖}_{1} {‖A‖}_{1}

, the condition number of

A

with respect to the solution of the linear equations. f04bbf uses the approximation

{‖E‖}_{1} = ε {‖A‖}_{1}

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

8

Parallelism and Performance

f04bbf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

f04bbf 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

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:

\begin{matrix} * & * & * & + & + & + \\ * & * & a_{13} & a_{24} & a_{35} & a_{46} \\ * & a_{12} & a_{23} & a_{34} & a_{45} & a_{56} \\ a_{11} & a_{22} & a_{33} & a_{44} & a_{55} & a_{66} \\ a_{21} & a_{32} & a_{43} & a_{54} & a_{65} & * \end{matrix}

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

A X = B

depends upon the pivoting required, but if

n ≫ k_{l} + k_{u}

then it is approximately bounded by

O (n k_{l} (k_{l} + k_{u}))

for the factorization and

O (n (2 k_{l} + k_{u}) r)

for the solution following the factorization. The condition number estimation typically requires between four and five solves and never more than eleven solves, following the factorization.

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 complex analogue of f04bbf is f04cbf.

10

Example

This example solves the equations

A X = B,

where

A

is the band matrix

A = (\begin{matrix} - 0.23 & 2.54 & - 3.66 & 0 \\ - 6.98 & 2.46 & - 2.73 & - 2.13 \\ 0 & 2.56 & 2.46 & 4.07 \\ 0 & 0 & - 4.78 & - 3.82 \end{matrix}) and B = (\begin{matrix} 4.42 & - 36.01 \\ 27.13 & - 31.67 \\ - 6.14 & - 1.16 \\ 10.50 & - 25.82 \end{matrix}) .

An estimate of the condition number of

A

and an approximate error bound for the computed solutions are also printed.

NAG Library Routine Document

f04bbf (real_band_solve)

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

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