f04bff computes the solution to a real system of linear equations , where is an symmetric positive definite band matrix of band width , and and are matrices. An estimate of the condition number of and an error bound for the computed solution are also returned.
The routine may be called by the names f04bff or nagf_linsys_real_posdef_band_solve.
The Cholesky factorization is used to factor as , if , or , if , where is an upper triangular band matrix with superdiagonals, and is a lower triangular band matrix with subdiagonals. The factored form of is then used to solve the system of equations .
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
Higham N J (2002) Accuracy and Stability of Numerical Algorithms (2nd Edition) SIAM, Philadelphia
1: – Character(1)Input
On entry: if , the upper triangle of the matrix is stored.
If , the lower triangle of the matrix is stored.
2: – IntegerInput
On entry: the number of linear equations , i.e., the order of the matrix .
3: – IntegerInput
On entry: the number of superdiagonals (and the number of subdiagonals) of the band matrix .
4: – IntegerInput
On entry: the number of right-hand sides , i.e., the number of columns of the matrix .
5: – Real (Kind=nag_wp) arrayInput/Output
Note: the second dimension of the array ab
must be at least
On entry: the symmetric band matrix . The upper or lower triangular part of the symmetric matrix is stored in the first rows of the array. The th column of is stored in the th column of the array ab as follows:
The matrix is stored in rows to , more precisely,
if , the elements of the upper triangle of within the band must be stored with element in ;
if , the elements of the lower triangle of within the band must be stored with element in
On exit: if or , the factor or from the Cholesky factorization or , in the same storage format as .
6: – IntegerInput
On entry: the first dimension of the array ab as declared in the (sub)program from which f04bff is called.
7: – Real (Kind=nag_wp) arrayInput/Output
Note: the second dimension of the array b
must be at least
On entry: the matrix of right-hand sides .
On exit: if or , the solution matrix .
8: – IntegerInput
On entry: the first dimension of the array b as declared in the (sub)program from which f04bff is called.
9: – Real (Kind=nag_wp)Output
On exit: if or , an estimate of the reciprocal of the condition number of the matrix , computed as .
10: – Real (Kind=nag_wp)Output
On exit: if or , an estimate of the forward error bound for a computed solution , such that , where is a column of the computed solution returned in the array b and is the corresponding column of the exact solution . If rcond is less than machine precision, errbnd is returned as unity.
11: – IntegerInput/Output
On entry: ifail must be set to , or to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of means that an error message is printed while a value of means that it is not.
If halting is not appropriate, the value or is recommended. If message printing is undesirable, then the value is recommended. Otherwise, the value is recommended. When the value or is used it is essential to test the value of ifail on exit.
On exit: unless the routine detects an error or a warning has been flagged (see Section 6).
6Error Indicators and Warnings
If on entry or , explanatory error messages are output on the current error message unit (as defined by x04aaf).
Errors or warnings detected by the routine:
The principal minor of order of the matrix is not positive definite. The factorization has not been completed and the solution could not be computed.
A solution has been computed, but rcond is less than machine precision so that the matrix is numerically singular.
On entry, uplo not one of 'U' or 'u' or 'L' or 'l': .
On entry, .
On entry, .
On entry, .
On entry, and .
On entry, and .
An unexpected error has been triggered by this routine. Please
See Section 7 in the Introduction to the NAG Library FL Interface for further information.
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.
Dynamic memory allocation failed.
The integer allocatable memory required is n, and the real allocatable memory required is . Allocation failed before the solution could be computed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.
The computed solution for a single right-hand side, , satisfies an equation of the form
and is the machine precision. An approximate error bound for the computed solution is given by
where , the condition number of with respect to the solution of the linear equations. f04bff uses the approximation to estimate errbnd. 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.
f04bff is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f04bff 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 band storage scheme for the array ab is illustrated by the following example, when , , and :
Array elements marked need not be set and are not referenced by the routine.
Assuming that , the total number of floating-point operations required to solve the equations is approximately for the factorization and 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.