NAG Library Routine Document
f11jdf (real_symm_precon_ssor_solve)
1
Purpose
f11jdf solves a system of linear equations involving the preconditioning matrix corresponding to SSOR applied to a real sparse symmetric matrix, represented in symmetric coordinate storage format.
2
Specification
Fortran Interface
Subroutine f11jdf ( |
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(n+1) | Real (Kind=nag_wp), Intent (In) | :: | a(nnz), rdiag(n), omega, y(n) | Real (Kind=nag_wp), Intent (Out) | :: | x(n) | Character (1), Intent (In) | :: | check |
|
C Header Interface
#include <nagmk26.h>
void |
f11jdf_ (const Integer *n, const Integer *nnz, const double a[], const Integer irow[], const Integer icol[], const double rdiag[], const double *omega, const char *check, const double y[], double x[], Integer iwork[], Integer *ifail, const Charlen length_check) |
|
3
Description
f11jdf solves a system of equations
involving the preconditioning matrix
corresponding to symmetric successive-over-relaxation (SSOR) (see
Young (1971)) on a linear system
, where
is a sparse symmetric matrix stored in symmetric coordinate storage (SCS) format (see
Section 2.1.2 in the F11 Chapter Introduction).
In the definition of given above is the diagonal part of , is the strictly lower triangular part of , and is a user-defined relaxation parameter.
It is envisaged that a common use of
f11jdf will be to carry out the preconditioning step required in the application of
f11gef to sparse linear systems. For an illustration of this use of
f11jdf see the example program given in
Section 10.1.
f11jdf is also used for this purpose by the Black Box routine
f11jef.
4
References
Young D (1971) Iterative Solution of Large Linear Systems Academic Press, New York
5
Arguments
- 1: – IntegerInput
-
On entry: , the order of the matrix .
Constraint:
.
- 2: – IntegerInput
-
On entry: the number of nonzero elements in the lower triangular part of .
Constraint:
.
- 3: – Real (Kind=nag_wp) arrayInput
-
On entry: the nonzero elements in the lower triangular part of 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
f11zbf may be used to order the elements in this way.
- 4: – Integer arrayInput
- 5: – Integer arrayInput
-
On entry: the row and column indices of the nonzero elements supplied in array
a.
Constraints:
irow and
icol must satisfy these constraints (which may be imposed by a call to
f11zbf):
- and , for ;
- or and , for .
- 6: – Real (Kind=nag_wp) arrayInput
-
On entry: the elements of the diagonal matrix , where is the diagonal part of .
- 7: – Real (Kind=nag_wp)Input
-
On entry: the relaxation parameter .
Constraint:
.
- 8: – Character(1)Input
-
On entry: specifies whether or not the input data should be checked.
- Checks are carried out on the values of n, nnz, irow, icol and omega.
- None of these checks are carried out.
Constraint:
or .
- 9: – Real (Kind=nag_wp) arrayInput
-
On entry: the right-hand side vector .
- 10: – Real (Kind=nag_wp) arrayOutput
-
On exit: the solution vector .
- 11: – Integer arrayWorkspace
-
- 12: – IntegerInput/Output
-
On entry:
ifail must be set to
,
. 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
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, .
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: .
Consider calling
f11zbf to reorder and sum or remove duplicates.
-
The matrix has no diagonal entry in row .
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.
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.
Dynamic memory allocation failed.
See
Section 3.7 in How to Use the NAG Library and its Documentation for further information.
7
Accuracy
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.
8
Parallelism and Performance
f11jdf is not threaded in any implementation.
The time taken for a call to
f11jdf is proportional to
nnz.
It is expected that a common use of
f11jdf will be to carry out the preconditioning step required in the application of
f11gef to sparse symmetric linear systems. In this situation
f11jdf 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 to set
for all subsequent calls.
10
Example
This example solves a sparse symmetric linear system of equations
using the conjugate-gradient (CG) method with SSOR preconditioning.
The CG algorithm itself is implemented by the reverse communication routine
f11gef, 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 f11xef.
- If , a solution of the preconditioning equation is required. This is achieved by a call to f11jdf.
- If , f11gef has completed its tasks. Either the iteration has terminated, or an error condition has arisen.
For further details see the routine document for
f11gef.
10.1
Program Text
Program Text (f11jdfe.f90)
10.2
Program Data
Program Data (f11jdfe.d)
10.3
Program Results
Program Results (f11jdfe.r)