NAG CL Interface
f07mvc (zherfs)
1
Purpose
f07mvc returns error bounds for the solution of a complex Hermitian indefinite system of linear equations with multiple right-hand sides, . It improves the solution by iterative refinement, in order to reduce the backward error as much as possible.
2
Specification
void |
f07mvc (Nag_OrderType order,
Nag_UploType uplo,
Integer n,
Integer nrhs,
const Complex a[],
Integer pda,
const Complex af[],
Integer pdaf,
const Integer ipiv[],
const Complex b[],
Integer pdb,
Complex x[],
Integer pdx,
double ferr[],
double berr[],
NagError *fail) |
|
The function may be called by the names: f07mvc, nag_lapacklin_zherfs or nag_zherfs.
3
Description
f07mvc returns the backward errors and estimated bounds on the forward errors for the solution of a complex Hermitian indefinite system of linear equations with multiple right-hand sides . The function handles each right-hand side vector (stored as a column of the matrix ) independently, so we describe the function of f07mvc in terms of a single right-hand side and solution .
Given a computed solution
, the function computes the
component-wise backward error
. This is the size of the smallest relative perturbation in each element of
and
such that
is the exact solution of a perturbed system
Then the function estimates a bound for the
component-wise forward error in the computed solution, defined by:
where
is the true solution.
For details of the method, see the
F07 Chapter Introduction.
4
References
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
5
Arguments
-
1:
– Nag_OrderType
Input
-
On entry: the
order argument specifies the two-dimensional storage scheme being used, i.e., row-major ordering or column-major ordering. C language defined storage is specified by
. See
Section 3.1.3 in the Introduction to the NAG Library CL Interface for a more detailed explanation of the use of this argument.
Constraint:
or .
-
2:
– Nag_UploType
Input
-
On entry: specifies whether the upper or lower triangular part of
is stored and how
is to be factorized.
- The upper triangular part of is stored and is factorized as , where is upper triangular.
- The lower triangular part of is stored and is factorized as , where is lower triangular.
Constraint:
or .
-
3:
– Integer
Input
-
On entry: , the order of the matrix .
Constraint:
.
-
4:
– Integer
Input
-
On entry: , the number of right-hand sides.
Constraint:
.
-
5:
– const Complex
Input
-
Note: the dimension,
dim, of the array
a
must be at least
.
On entry: the
by
original Hermitian matrix
as supplied to
f07mrc.
-
6:
– Integer
Input
On entry: the stride separating row or column elements (depending on the value of
order) of the matrix in the array
a.
Constraint:
.
-
7:
– const Complex
Input
-
Note: the dimension,
dim, of the array
af
must be at least
.
On entry: details of the factorization of
, as returned by
f07mrc.
-
8:
– Integer
Input
On entry: the stride separating row or column elements (depending on the value of
order) of the matrix in the array
af.
Constraint:
.
-
9:
– const Integer
Input
-
Note: the dimension,
dim, of the array
ipiv
must be at least
.
On entry: details of the interchanges and the block structure of
, as returned by
f07mrc.
-
10:
– const Complex
Input
-
Note: the dimension,
dim, of the array
b
must be at least
- when
;
- when
.
The
th element of the matrix
is stored in
- when ;
- when .
On entry: the by right-hand side matrix .
-
11:
– Integer
Input
-
On entry: the stride separating row or column elements (depending on the value of
order) in the array
b.
Constraints:
- if ,
;
- if , .
-
12:
– Complex
Input/Output
-
Note: the dimension,
dim, of the array
x
must be at least
- when
;
- when
.
The
th element of the matrix
is stored in
- when ;
- when .
On entry: the
by
solution matrix
, as returned by
f07msc.
On exit: the improved solution matrix .
-
13:
– Integer
Input
-
On entry: the stride separating row or column elements (depending on the value of
order) in the array
x.
Constraints:
- if ,
;
- if , .
-
14:
– double
Output
-
On exit: contains an estimated error bound for the th solution vector, that is, the th column of , for .
-
15:
– double
Output
-
On exit: contains the component-wise backward error bound for the th solution vector, that is, the th column of , for .
-
16:
– NagError *
Input/Output
-
The NAG error argument (see
Section 7 in the Introduction to the NAG Library CL Interface).
6
Error Indicators and Warnings
- NE_ALLOC_FAIL
-
Dynamic memory allocation failed.
See
Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
- NE_BAD_PARAM
-
On entry, argument had an illegal value.
- NE_INT
-
On entry, .
Constraint: .
On entry, .
Constraint: .
On entry, .
Constraint: .
On entry, .
Constraint: .
On entry, .
Constraint: .
On entry, .
Constraint: .
- NE_INT_2
-
On entry, and .
Constraint: .
On entry, and .
Constraint: .
On entry, and .
Constraint: .
On entry, and .
Constraint: .
On entry, and .
Constraint: .
On entry, and .
Constraint: .
- NE_INTERNAL_ERROR
-
An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact
NAG for assistance.
See
Section 7.5 in the Introduction to the NAG Library CL Interface for further information.
- NE_NO_LICENCE
-
Your licence key may have expired or may not have been installed correctly.
See
Section 8 in the Introduction to the NAG Library CL Interface for further information.
7
Accuracy
The bounds returned in
ferr are not rigorous, because they are estimated, not computed exactly; but in practice they almost always overestimate the actual error.
8
Parallelism and Performance
f07mvc is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f07mvc 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 function. Please also consult the
Users' Note for your implementation for any additional implementation-specific information.
For each right-hand side, computation of the backward error involves a minimum of real floating-point operations. Each step of iterative refinement involves an additional real 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 linear equations of the form ; the number is usually and never more than . Each solution involves approximately real operations.
The real analogue of this function is
f07mhc.
10
Example
This example solves the system of equations
using iterative refinement and to compute the forward and backward error bounds, where
and
Here
is Hermitian indefinite and must first be factorized by
f07mrc.
10.1
Program Text
10.2
Program Data
10.3
Program Results