NAG FL Interface
f11drf (complex_gen_precon_ssor_solve)
1
Purpose
f11drf solves a system of linear equations involving the preconditioning matrix corresponding to SSOR applied to a complex sparse non-Hermitian matrix, represented in coordinate storage format.
2
Specification
Fortran Interface
Subroutine f11drf ( |
trans, n, nnz, a, irow, icol, rdiag, omega, check, y, x, iwork, ifail) |
Integer, Intent (In) |
:: |
n, nnz, irow(nnz), icol(nnz) |
Integer, Intent (Inout) |
:: |
ifail |
Integer, Intent (Out) |
:: |
iwork(2*n+1) |
Real (Kind=nag_wp), Intent (In) |
:: |
omega |
Complex (Kind=nag_wp), Intent (In) |
:: |
a(nnz), rdiag(n), y(n) |
Complex (Kind=nag_wp), Intent (Out) |
:: |
x(n) |
Character (1), Intent (In) |
:: |
trans, check |
|
C Header Interface
#include <nag.h>
void |
f11drf_ (const char *trans, const Integer *n, const Integer *nnz, const Complex a[], const Integer irow[], const Integer icol[], const Complex rdiag[], const double *omega, const char *check, const Complex y[], Complex x[], Integer iwork[], Integer *ifail, const Charlen length_trans, const Charlen length_check) |
|
C++ Header Interface
#include <nag.h> extern "C" {
void |
f11drf_ (const char *trans, const Integer &n, const Integer &nnz, const Complex a[], const Integer irow[], const Integer icol[], const Complex rdiag[], const double &omega, const char *check, const Complex y[], Complex x[], Integer iwork[], Integer &ifail, const Charlen length_trans, const Charlen length_check) |
}
|
The routine may be called by the names f11drf or nagf_sparse_complex_gen_precon_ssor_solve.
3
Description
f11drf solves a system of linear equations
according to the value of the argument
trans, where the matrix
corresponds to symmetric successive-over-relaxation (SSOR)
Young (1971) applied to a linear system
, where
is a complex sparse non-Hermitian matrix stored in coordinate storage (CS) format (see
Section 2.1.1 in the
F11 Chapter Introduction).
In the definition of given above is the diagonal part of , is the strictly lower triangular part of , is the strictly upper triangular part of , and is a user-defined relaxation parameter.
It is envisaged that a common use of
f11drf will be to carry out the preconditioning step required in the application of
f11bsf to sparse linear systems. For an illustration of this use of
f11drf see the example program given in
Section 10.
f11drf is also used for this purpose by the Black Box routine
f11dsf.
4
References
Young D (1971) Iterative Solution of Large Linear Systems Academic Press, New York
5
Arguments
-
1:
– Character(1)
Input
-
On entry: specifies whether or not the matrix
is transposed.
- is solved.
- is solved.
Constraint:
or .
-
2:
– Integer
Input
-
On entry: , the order of the matrix .
Constraint:
.
-
3:
– Integer
Input
-
On entry: the number of nonzero elements in the matrix .
Constraint:
.
-
4:
– Complex (Kind=nag_wp) array
Input
-
On entry: the nonzero elements in the matrix
, ordered by increasing row index, and by increasing column index within each row. Multiple entries for the same row and column indices are not permitted. The routine
f11znf may be used to order the elements in this way.
-
5:
– Integer array
Input
-
6:
– Integer array
Input
-
On entry: the row and column indices of the nonzero elements supplied in
a.
Constraints:
irow and
icol must satisfy the following constraints (which may be imposed by a call to
f11znf):
- and , for ;
- either or both and , for .
-
7:
– Complex (Kind=nag_wp) array
Input
-
On entry: the elements of the diagonal matrix , where is the diagonal part of .
-
8:
– Real (Kind=nag_wp)
Input
-
On entry: the relaxation parameter .
Constraint:
.
-
9:
– Character(1)
Input
-
On entry: specifies whether or not the CS representation of the matrix
should be checked.
- Checks are carried on the values of n, nnz, irow, icol and omega.
- None of these checks are carried out.
Constraint:
or .
-
10:
– Complex (Kind=nag_wp) array
Input
-
On entry: the right-hand side vector .
-
11:
– Complex (Kind=nag_wp) array
Output
-
On exit: the solution vector .
-
12:
– Integer array
Workspace
-
-
13:
– Integer
Input/Output
-
On entry:
ifail must be set to
,
. If you are unfamiliar with this argument you should refer to
Section 4 in the Introduction to the NAG Library FL Interface 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 argument, 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:
-
On entry, or : .
On entry, or : .
-
On entry, .
Constraint: .
On entry, .
Constraint: .
On entry, and .
Constraint: .
On entry, .
Constraint:
-
On entry, is out of order: .
On entry, , and .
Constraint: and .
On entry, , and .
Constraint: and .
On entry, the location () is a duplicate: .
A nonzero element has been supplied which does not lie in the matrix
, is out of order, or has duplicate row and column indices. Consider calling
f11znf to reorder and sum or remove duplicates.
-
The matrix has no diagonal entry in row .
The SSOR preconditioner is not appropriate for this problem.
An unexpected error has been triggered by this routine. Please
contact
NAG.
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.
See
Section 9 in the Introduction to the NAG Library FL Interface for further information.
7
Accuracy
If
the computed solution
is the exact solution of a perturbed system of equations
, where
is a modest linear function of
, and
is the
machine precision. An equivalent result holds when
.
8
Parallelism and Performance
f11drf is not threaded in any implementation.
The time taken for a call to
f11drf is proportional to
nnz.
It is expected that a common use of
f11drf will be to carry out the preconditioning step required in the application of
f11bsf to sparse linear systems. In this situation
f11drf is likely to be called many times with the same matrix
. In the interests of both reliability and efficiency, you are recommended to set
for the first of such calls, and
for all subsequent calls.
10
Example
This example solves a complex sparse linear system of equations
using RGMRES with SSOR preconditioning.
The RGMRES algorithm itself is implemented by the reverse communication routine
f11bsf, which returns repeatedly to the calling program with various values of the argument
irevcm. This argument indicates the action to be taken by the calling program.
- If , a matrix-vector product is required. This is implemented by a call to f11xnf.
- If , a conjugate transposed matrix-vector product is required in the estimation of the norm of . This is implemented by a call to f11xnf.
- If , a solution of the preconditioning equation is required. This is achieved by a call to f11drf.
- If , f11bsf has completed its tasks. Either the iteration has terminated, or an error condition has arisen.
For further details see the routine document for
f11bsf.
10.1
Program Text
10.2
Program Data
10.3
Program Results