# NAG CL Interfacef11dec (real_​gen_​solve_​jacssor)

Settings help

CL Name Style:

## 1Purpose

f11dec solves a real sparse nonsymmetric system of linear equations, represented in coordinate storage format, using a restarted generalized minimal residual (RGMRES), conjugate gradient squared (CGS), or stabilized bi-conjugate gradient (Bi-CGSTAB) method, without preconditioning, with Jacobi, or with SSOR preconditioning.

## 2Specification

 #include
 void f11dec (Nag_SparseNsym_Method method, Nag_SparseNsym_PrecType precon, Integer n, Integer nnz, const double a[], const Integer irow[], const Integer icol[], double omega, const double b[], Integer m, double tol, Integer maxitn, double x[], double *rnorm, Integer *itn, Nag_Sparse_Comm *comm, NagError *fail)
The function may be called by the names: f11dec, nag_sparse_real_gen_solve_jacssor or nag_sparse_nsym_sol.

## 3Description

f11dec solves a real sparse nonsymmetric system of linear equations:
 $Ax = b ,$
using an RGMRES (see Saad and Schultz (1986)), CGS (see Sonneveld (1989)), or Bi-CGSTAB$\left(\ell \right)$ method (see Van der Vorst (1989), Sleijpen and Fokkema (1993)).
The function allows the following choices for the preconditioner:
• no preconditioning;
• Jacobi preconditioning (see Young (1971));
• symmetric successive-over-relaxation (SSOR) preconditioning (see Young (1971)).
For incomplete $LU$ (ILU) preconditioning see f11dcc.
The matrix $A$ is represented in coordinate storage (CS) format (see the F11 Chapter Introduction) in the arrays a, irow and icol. The array a holds the nonzero entries in the matrix, while irow and icol hold the corresponding row and column indices.
Saad Y and Schultz M (1986) GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems SIAM J. Sci. Statist. Comput. 7 856–869
Sleijpen G L G and Fokkema D R (1993) BiCGSTAB$\left(\ell \right)$ for linear equations involving matrices with complex spectrum ETNA 1 11–32
Sonneveld P (1989) CGS, a fast Lanczos-type solver for nonsymmetric linear systems SIAM J. Sci. Statist. Comput. 10 36–52
Van der Vorst H (1989) Bi-CGSTAB, a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems SIAM J. Sci. Statist. Comput. 13 631–644
Young D (1971) Iterative Solution of Large Linear Systems Academic Press, New York

## 5Arguments

1: $\mathbf{method}$Nag_SparseNsym_Method Input
On entry: specifies the iterative method to be used.
${\mathbf{method}}=\mathrm{Nag_SparseNsym_RGMRES}$
The restarted generalized minimum residual method is used.
${\mathbf{method}}=\mathrm{Nag_SparseNsym_CGS}$
The conjugate gradient squared method is used.
${\mathbf{method}}=\mathrm{Nag_SparseNsym_BiCGSTAB}$
The bi-conjugate gradient stabilised $\left(\ell \right)$ method is used.
Constraint: ${\mathbf{method}}=\mathrm{Nag_SparseNsym_RGMRES}$, $\mathrm{Nag_SparseNsym_CGS}$ or $\mathrm{Nag_SparseNsym_BiCGSTAB}$.
2: $\mathbf{precon}$Nag_SparseNsym_PrecType Input
On entry: specifies the type of preconditioning to be used.
${\mathbf{precon}}=\mathrm{Nag_SparseNsym_NoPrec}$
No preconditioning.
${\mathbf{precon}}=\mathrm{Nag_SparseNsym_SSORPrec}$
Symmetric successive-over-relaxation.
${\mathbf{precon}}=\mathrm{Nag_SparseNsym_JacPrec}$
Jacobi.
Constraint: ${\mathbf{precon}}=\mathrm{Nag_SparseNsym_NoPrec}$, $\mathrm{Nag_SparseNsym_SSORPrec}$ or $\mathrm{Nag_SparseNsym_JacPrec}$.
3: $\mathbf{n}$Integer Input
On entry: the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 1$.
4: $\mathbf{nnz}$Integer Input
On entry: the number of nonzero elements in the matrix $A$.
Constraint: $1\le {\mathbf{nnz}}\le {{\mathbf{n}}}^{2}$.
5: $\mathbf{a}\left[{\mathbf{nnz}}\right]$const double Input
On entry: the nonzero elements of the matrix $A$, 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 f11zac may be used to order the elements in this way.
6: $\mathbf{irow}\left[{\mathbf{nnz}}\right]$const Integer Input
7: $\mathbf{icol}\left[{\mathbf{nnz}}\right]$const Integer 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 f11zac):;
• $1\le {\mathbf{irow}}\left[\mathit{i}\right]\le {\mathbf{n}}$ and $1\le {\mathbf{icol}}\left[\mathit{i}\right]\le {\mathbf{n}}$, for $\mathit{i}=0,1,\dots ,{\mathbf{nnz}}-1$;
• ${\mathbf{irow}}\left[\mathit{i}-1\right]<{\mathbf{irow}}\left[\mathit{i}\right]$ or ${\mathbf{irow}}\left[\mathit{i}-1\right]={\mathbf{irow}}\left[\mathit{i}\right]$ and ${\mathbf{icol}}\left[\mathit{i}-1\right]<{\mathbf{icol}}\left[\mathit{i}\right]$, for $\mathit{i}=1,2,\dots ,{\mathbf{nnz}}-1$.
8: $\mathbf{omega}$double Input
On entry: if ${\mathbf{precon}}=\mathrm{Nag_SparseNsym_SSORPrec}$, omega is the relaxation argument $\omega$ to be used in the SSOR method. Otherwise omega need not be initialized and is not referenced.
Constraint: $0.0<{\mathbf{omega}}<2.0$.
9: $\mathbf{b}\left[{\mathbf{n}}\right]$const double Input
On entry: the right-hand side vector $b$.
10: $\mathbf{m}$Integer Input
On entry: if ${\mathbf{method}}=\mathrm{Nag_SparseNsym_RGMRES}$, m is the dimension of the restart subspace.
If ${\mathbf{method}}=\mathrm{Nag_SparseNsym_BiCGSTAB}$, m is the order $\ell$ of the polynomial Bi-CGSTAB method; otherwise m is not referenced.
Constraints:
• if ${\mathbf{method}}=\mathrm{Nag_SparseNsym_RGMRES}$, $0<{\mathbf{m}}\le \mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{n}},50\right)$;
• if ${\mathbf{method}}=\mathrm{Nag_SparseNsym_BiCGSTAB}$, $0<{\mathbf{m}}\le \mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{n}},10\right)$.
11: $\mathbf{tol}$double Input
On entry: the required tolerance. Let ${x}_{k}$ denote the approximate solution at iteration $k$, and ${r}_{k}$ the corresponding residual. The algorithm is considered to have converged at iteration $k$ if:
 $‖ r k ‖ ∞ ≤ τ × ( ‖b‖ ∞ + ‖A‖ ∞ ‖ x k ‖ ∞ ) .$
If ${\mathbf{tol}}\le 0.0$, $\tau =\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(\sqrt{\epsilon },\sqrt{{\mathbf{n}}},\epsilon \right)$ is used, where $\epsilon$ is the machine precision. Otherwise $\tau =\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{tol}},10\epsilon ,,,\sqrt{{\mathbf{n}}},\epsilon \right)$ is used.
Constraint: ${\mathbf{tol}}<1.0$.
12: $\mathbf{maxitn}$Integer Input
On entry: the maximum number of iterations allowed.
Constraint: ${\mathbf{maxitn}}\ge 1$.
13: $\mathbf{x}\left[{\mathbf{n}}\right]$double Input/Output
On entry: an initial approximation to the solution vector $x$.
On exit: an improved approximation to the solution vector $x$.
14: $\mathbf{rnorm}$double * Output
On exit: the final value of the residual norm ${‖{r}_{k}‖}_{\infty }$, where $k$ is the output value of itn.
15: $\mathbf{itn}$Integer * Output
On exit: the number of iterations carried out.
16: $\mathbf{comm}$Nag_Sparse_Comm * Input/Output
On entry/exit: a pointer to a structure of type Nag_Sparse_Comm whose members are used by the iterative solver.
17: $\mathbf{fail}$NagError * Input/Output
The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).

## 6Error Indicators and Warnings

NE_ACC_LIMIT
The required accuracy could not be obtained. However, a reasonable accuracy has been obtained and further iterations cannot improve the result.
You should check the output value of rnorm for acceptability. This error code usually implies that your problem has been fully and satisfactorily solved to within or close to the accuracy available on your system. Further iterations are unlikely to improve on this situation.
NE_ALLOC_FAIL
Dynamic memory allocation failed.
On entry, argument method had an illegal value.
On entry, argument precon had an illegal value.
NE_INT_2
On entry, ${\mathbf{m}}=⟨\mathit{\text{value}}⟩$, $\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{n}},10\right)=⟨\mathit{\text{value}}⟩$.
Constraint: $0<{\mathbf{m}}\le \mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{n}},10\right)$ when ${\mathbf{method}}=\mathrm{Nag_SparseNsym_BiCGSTAB}$.
On entry, ${\mathbf{m}}=⟨\mathit{\text{value}}⟩$, $\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{n}},50\right)=⟨\mathit{\text{value}}⟩$.
Constraint: $0<{\mathbf{m}}\le \mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{n}},50\right)$ when ${\mathbf{method}}=\mathrm{Nag_SparseNsym_RGMRES}$.
On entry, ${\mathbf{nnz}}=⟨\mathit{\text{value}}⟩$, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: $1\le {\mathbf{nnz}}\le {{\mathbf{n}}}^{2}$.
NE_INT_ARG_LT
On entry, ${\mathbf{maxitn}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{maxitn}}\ge 1$.
On entry, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{n}}\ge 1$.
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.
NE_NONSYMM_MATRIX_DUP
A nonzero matrix element has been supplied which does not lie within the matrix $A$, is out of order or has duplicate row and column indices, i.e., one or more of the following constraints has been violated:
• $1\le {\mathbf{irow}}\left[\mathit{i}\right]\le {\mathbf{n}}$ and $1\le {\mathbf{icol}}\left[\mathit{i}\right]\le {\mathbf{n}}$, for $\mathit{i}=0,1,\dots ,{\mathbf{nnz}}-1$.
• ${\mathbf{irow}}\left[i-1\right]<{\mathbf{irow}}\left[i\right]$, or
• ${\mathbf{irow}}\left[\mathit{i}-1\right]={\mathbf{irow}}\left[\mathit{i}\right]$ and ${\mathbf{icol}}\left[\mathit{i}-1\right]<{\mathbf{icol}}\left[\mathit{i}\right]$, for $\mathit{i}=1,2,\dots ,{\mathbf{nnz}}-1$.
Call f11zac to reorder and sum or remove duplicates.
NE_NOT_REQ_ACC
The required accuracy has not been obtained in maxitn iterations.
NE_REAL
On entry, ${\mathbf{omega}}=⟨\mathit{\text{value}}⟩$.
Constraint: $0.0<{\mathbf{omega}}<2.0$ when ${\mathbf{precon}}=\mathrm{Nag_SparseNsym_SSORPrec}$.
NE_REAL_ARG_GE
On entry, tol must not be greater than or equal to 1: ${\mathbf{tol}}=⟨\mathit{\text{value}}⟩$.
NE_ZERO_DIAGONAL_ELEM
On entry, the matrix a has a zero diagonal element. Jacobi and SSOR preconditioners are not appropriate for this problem.

## 7Accuracy

On successful termination, the final residual ${r}_{k}={b-Ax}_{k}$, where $k={\mathbf{itn}}$, satisfies the termination criterion
 $‖ r k ‖ ∞ ≤ τ × ( ‖b‖ ∞ + ‖A‖ ∞ ‖ x k ‖ ∞ ) .$
The value of the final residual norm is returned in rnorm.

## 8Parallelism and Performance

f11dec is not threaded in any implementation.

The time taken by f11dec for each iteration is roughly proportional to nnz.
The number of iterations required to achieve a prescribed accuracy cannot be easily determined a priori, as it can depend dramatically on the conditioning and spectrum of the preconditioned matrix of the coefficients $\overline{A}={M}^{-1}A$.

## 10Example

This example program solves a sparse nonsymmetric system of equations using the RGMRES method, with SSOR preconditioning.

### 10.1Program Text

Program Text (f11dece.c)

### 10.2Program Data

Program Data (f11dece.d)

### 10.3Program Results

Program Results (f11dece.r)