NAG Library Routine Document
F04CHF
1 Purpose
F04CHF computes the solution to a complex system of linear equations , where is an by Hermitian matrix and and are by matrices. An estimate of the condition number of and an error bound for the computed solution are also returned.
2 Specification
SUBROUTINE F04CHF ( |
UPLO, N, NRHS, A, LDA, IPIV, B, LDB, RCOND, ERRBND, IFAIL) |
INTEGER |
N, NRHS, LDA, IPIV(N), LDB, IFAIL |
REAL (KIND=nag_wp) |
RCOND, ERRBND |
COMPLEX (KIND=nag_wp) |
A(LDA,*), B(LDB,*) |
CHARACTER(1) |
UPLO |
|
3 Description
The diagonal pivoting method is used to factor as , if , or , if , where (or ) is a product of permutation and unit upper (lower) triangular matrices, and is Hermitian and block diagonal with by and by diagonal blocks. The factored form of is then used to solve the system of equations .
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 Parameters
- 1: – CHARACTER(1)Input
-
On entry: if
, the upper triangle of the matrix
is stored.
If , the lower triangle of the matrix is stored.
Constraint:
or .
- 2: – INTEGERInput
-
On entry: the number of linear equations , i.e., the order of the matrix .
Constraint:
.
- 3: – INTEGERInput
-
On entry: the number of right-hand sides , i.e., the number of columns of the matrix .
Constraint:
.
- 4: – COMPLEX (KIND=nag_wp) arrayInput/Output
-
Note: the second dimension of the array
A
must be at least
.
On entry: the
by
Hermitian matrix
.
If
, the leading
N by
N upper triangular part of the array
A contains the upper triangular part of the matrix
, and the strictly lower triangular part of
A is not referenced.
If
, the leading
N by
N lower triangular part of the array
A contains the lower triangular part of the matrix
, and the strictly upper triangular part of
A is not referenced.
On exit: if
, the block diagonal matrix
and the multipliers used to obtain the factor
or
from the factorization
or
as computed by
F07MRF (ZHETRF).
- 5: – INTEGERInput
-
On entry: the first dimension of the array
A as declared in the (sub)program from which F04CHF is called.
Constraint:
.
- 6: – INTEGER arrayOutput
-
On exit: if
, details of the interchanges and the block structure of
, as determined by
F07MRF (ZHETRF).
- If , then rows and columns and were interchanged, and is a by diagonal block;
- if and , then rows and columns and were interchanged and is a by diagonal block;
- if and , then rows and columns and were interchanged and is a by diagonal block.
- 7: – COMPLEX (KIND=nag_wp) arrayInput/Output
-
Note: the second dimension of the array
B
must be at least
.
On entry: the by matrix of right-hand sides .
On exit: if or , the by solution matrix .
- 8: – INTEGERInput
-
On entry: the first dimension of the array
B as declared in the (sub)program from which F04CHF is called.
Constraint:
.
- 9: – REAL (KIND=nag_wp)Output
-
On exit: if no constraints are violated, 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, then
ERRBND is returned as unity.
- 11: – INTEGERInput/Output
-
On entry:
IFAIL must be set to
,
. If you are unfamiliar with this parameter you should refer to
Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value
is recommended. If the output of error messages is undesirable, then the value
is recommended. Otherwise, if you are not familiar with this parameter, the recommended value is
.
When the value 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).
6 Error 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:
-
If , the th argument had an illegal value.
-
If , is exactly zero. The factorization has been completed, but the block diagonal matrix is exactly singular, so the solution could not be computed.
-
RCOND is less than
machine precision, so that the matrix
is numerically singular. A solution to the equations
has nevertheless been computed.
An unexpected error has been triggered by this routine. Please
contact
NAG.
See
Section 3.8 in the Essential Introduction for further information.
Your licence key may have expired or may not have been installed correctly.
See
Section 3.7 in the Essential Introduction for further information.
Dynamic memory allocation failed.
See
Section 3.6 in the Essential Introduction for further information.
7 Accuracy
The computed solution for a single right-hand side,
, satisfies an equation of the form
where
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. F04CHF uses the approximation
to estimate
ERRBND. See Section 4.4 of
Anderson et al. (1999) for further details.
8 Parallelism and Performance
F04CHF is not threaded by NAG in any implementation.
F04CHF 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 real allocatable memory required is
N, and the
complex
allocatable memory required is
, where
LWORK is the optimum workspace required by
F07MNF (ZHESV). If this failure occurs it may be possible to solve the equations by calling the packed storage version of F04CHF,
F04CJF, or by calling
F07MNF (ZHESV) directly with less than the optimum workspace (see
Chapter F07).
The total number of floating-point operations required to solve the equations is proportional to . 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.
Routine
F04DHF is for complex symmetric matrices, and the real analogue of F04CHF is
F04BHF.
10 Example
This example solves the equations
where
is the Hermitian indefinite matrix
and
An estimate of the condition number of and an approximate error bound for the computed solutions are also printed.
10.1 Program Text
Program Text (f04chfe.f90)
10.2 Program Data
Program Data (f04chfe.d)
10.3 Program Results
Program Results (f04chfe.r)