PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_sparse_real_symm_precon_ssor_solve (f11jd)
Purpose
nag_sparse_real_symm_precon_ssor_solve (f11jd) 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.
Syntax
[
x,
ifail] = f11jd(
a,
irow,
icol,
rdiag,
omega,
check,
y, 'n',
n, 'nz',
nz)
[
x,
ifail] = nag_sparse_real_symm_precon_ssor_solve(
a,
irow,
icol,
rdiag,
omega,
check,
y, 'n',
n, 'nz',
nz)
Description
nag_sparse_real_symm_precon_ssor_solve (f11jd) 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
Symmetric coordinate storage (SCS) format 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
nag_sparse_real_symm_precon_ssor_solve (f11jd) will be to carry out the preconditioning step required in the application of
nag_sparse_real_symm_basic_solver (f11ge) to sparse linear systems. For an illustration of this use of
nag_sparse_real_symm_precon_ssor_solve (f11jd) see the example program given in
Example.
nag_sparse_real_symm_precon_ssor_solve (f11jd) is also used for this purpose by the Black Box function
nag_sparse_real_symm_solve_jacssor (f11je).
References
Young D (1971) Iterative Solution of Large Linear Systems Academic Press, New York
Parameters
Compulsory Input Parameters
- 1:
– double array
-
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 function
nag_sparse_real_symm_sort (f11zb) may be used to order the elements in this way.
- 2:
– int64int32nag_int array
- 3:
– int64int32nag_int array
-
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
nag_sparse_real_symm_sort (f11zb)):
- and , for ;
- or and , for .
- 4:
– double array
-
The elements of the diagonal matrix , where is the diagonal part of .
- 5:
– double scalar
-
The relaxation parameter .
Constraint:
.
- 6:
– string (length ≥ 1)
-
Specifies whether or not the input data should be checked.
- Checks are carried out on the values of n, nz, irow, icol and omega.
- None of these checks are carried out.
Constraint:
or .
- 7:
– double array
-
The right-hand side vector .
Optional Input Parameters
- 1:
– int64int32nag_int scalar
-
Default:
the dimension of the arrays
rdiag,
y. (An error is raised if these dimensions are not equal.)
, the order of the matrix .
Constraint:
.
- 2:
– int64int32nag_int scalar
-
Default:
the dimension of the arrays
a,
irow,
icol. (An error is raised if these dimensions are not equal.)
The number of nonzero elements in the lower triangular part of .
Constraint:
.
Output Parameters
- 1:
– double array
-
The solution vector .
- 2:
– int64int32nag_int scalar
unless the function detects an error (see
Error Indicators and Warnings).
Error Indicators and Warnings
Errors or warnings detected by the function:
-
-
On entry, | or . |
-
-
On entry, | , |
or | , |
or | , |
or | omega lies outside the interval , |
-
-
On entry, the arrays
irow and
icol fail to satisfy the following constraints:
- and , for ;
- or and , for .
Therefore a nonzero element has been supplied which does not lie in the lower triangular part of
, is out of order, or has duplicate row and column indices. Call
nag_sparse_real_symm_sort (f11zb) to reorder and sum or remove duplicates.
-
An unexpected error has been triggered by this routine. Please
contact
NAG.
-
Your licence key may have expired or may not have been installed correctly.
-
Dynamic memory allocation failed.
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.
Further Comments
Timing
The time taken for a call to
nag_sparse_real_symm_precon_ssor_solve (f11jd) is proportional to
nz.
Use of check
It is expected that a common use of
nag_sparse_real_symm_precon_ssor_solve (f11jd) will be to carry out the preconditioning step required in the application of
nag_sparse_real_symm_basic_solver (f11ge) to sparse symmetric linear systems. In this situation
nag_sparse_real_symm_precon_ssor_solve (f11jd) 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.
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 function
nag_sparse_real_symm_basic_solver (f11ge), 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 nag_sparse_real_symm_matvec (f11xe).
- If , a solution of the preconditioning equation is required. This is achieved by a call to nag_sparse_real_symm_precon_ssor_solve (f11jd).
- If , nag_sparse_real_symm_basic_solver (f11ge) has completed its tasks. Either the iteration has terminated, or an error condition has arisen.
For further details see the function document for
nag_sparse_real_symm_basic_solver (f11ge).
Open in the MATLAB editor:
f11jd_example
function f11jd_example
fprintf('f11jd example results\n\n');
n = int64(7);
nz = int64(16);
a = zeros(nz, 1);
irow = zeros(nz, 1, 'int64');
icol = irow;
a = [4; 1; 5; 2; 2; 3;-1; 1; 4; 1;-2; 3; 2;-1;-2; 5];
irow(1:nz) = [1; 2; 2; 3; 4; 4; 5; 5; 5; 6; 6; 6; 7; 7; 7; 7];
icol(1:nz) = [1; 1; 2; 3; 2; 4; 1; 4; 5; 2; 5; 6; 1; 2; 3; 7];
b = [15; 18; -8; 21; 11; 10; 29];
method = 'CG';
precon = 'P';
tol = 1e-6;
maxitn = int64(100);
anorm = 0;
sigmax = 0;
maxits = int64(10);
monit = int64(0);
[lwreq, work, ifail] = ...
f11gd( ...
method, precon, n, tol, maxitn, anorm, sigmax, ...
maxits, monit, 'sigcmp', 'N', 'norm_p', 'I');
iwork = zeros(n+1, 1, 'int64');
rdiag = zeros(n, 1);
for i=1:nz
if irow(i) == icol(i)
iwork(irow(i)) = iwork(irow(i)) + 1;
if a(i) ~= 0
rdiag(irow(i)) = 1/a(i);
else
error('Matrix has a zero diagonal element');
end
end
end
for i=1:n
if iwork(i) == 0
error('Matrix has a missing diagonal elemen');
elseif iwork(i) > 2
error('Matrix has a multiple diagonal element');
end
end
irevcm = int64(0);
x = zeros(n, 1);
wgt = zeros(n, 1);
omega = 1;
check = 'C';
while irevcm ~= 4
[irevcm, x, b, work, ifail] = f11ge( ...
irevcm, x, b, wgt, work);
if (irevcm == 1)
[b, ifail] = f11xe( ...
a, irow, icol, 'N', x);
elseif (irevcm == 2)
[b, ifail] = f11jd( ...
a, irow, icol, rdiag, omega, check, x);
end
end
[itn, stplhs, stprhs, anorm, sigmax, its, sigerr, ifail] = ...
f11gf(work);
fprintf('Converged in %d iterations\n', itn);
fprintf('Final residual norm = %14.4e\n\n', stplhs);
disp('Solution');
disp(x);
f11jd example results
Converged in 6 iterations
Final residual norm = 7.1054e-15
Solution
1.0000
2.0000
3.0000
4.0000
5.0000
6.0000
7.0000
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015