naginterfaces.library.sparse.real_​symm_​basic_​solver

naginterfaces.library.sparse.real_symm_basic_solver(irevcm, u, v, wgt, comm)

real_symm_basic_solver is an iterative solver for a symmetric system of simultaneous linear equations; real_symm_basic_solver is the second in a suite of three functions, where the first function, real_symm_basic_setup(), must be called prior to real_symm_basic_solver to set up the suite, and the third function in the suite, real_symm_basic_diag(), can be used to return additional information about the computation.

These three functions are suitable for the solution of large sparse symmetric systems of equations.

For full information please refer to the NAG Library document for f11ge

https://support.nag.com/numeric/nl/nagdoc_30.3/flhtml/f11/f11gef.html

Parameters

irevcmint

On initial entry: $irevcm=0$, otherwise an error condition will be raised.

On intermediate entry: must either be unchanged from its previous exit value, or can have one of the following values.

$irevcm=5$

Tidy termination: the computation will terminate at the end of the current iteration. Further reverse communication exits may occur depending on when the termination request is issued. real_symm_basic_solver will then return with the termination code $irevcm=4$. Note that before calling real_symm_basic_solver with $irevcm=5$ the calling program must have performed the tasks required by the value of $irevcm$ returned by the previous call to real_symm_basic_solver, otherwise subsequently returned values may be invalid.

$irevcm=6$

Immediate termination: real_symm_basic_solver will return immediately with termination code $irevcm=4$ and with any useful information available. This includes the last iterate of the solution and, for conjugate gradient only, the last iterate of the residual vector. The residual vector is generally not available when the Lanczos method (SYMMLQ) is used. real_symm_basic_solver will then return with the termination code $irevcm=4$.

Immediate termination may be useful, for example, when errors are detected during matrix-vector multiplication or during the solution of the preconditioning equation.

Changing $irevcm$ to any other value between calls will result in an error.

ufloat, ndarray, shape $\left(\text{n}\right)$, modified in place

On initial entry: an initial estimate, $x_0$, of the solution of the system of equations $Ax=b$.

On intermediate entry: must remain unchanged.

On intermediate exit: the returned value of $irevcm$ determines the contents of $u$ in the following way.

If $irevcm=1$ or $2$, $u$ holds the vector $u$ on which the operation specified by $irevcm$ is to be carried out.

If $irevcm=3$, $u$ holds the current iterate of the solution vector.

On final exit: if $errno$ = 3 or -i, the array $u$ is unchanged from the initial entry to real_symm_basic_solver. If $errno$ = 1, the array $u$ is unchanged from the last entry to real_symm_basic_solver. Otherwise, $u$ holds the last iterate of the solution of the system of equations, for all returned values of $\text{errno}$.

vfloat, ndarray, shape $\left(\text{n}\right)$, modified in place

On initial entry: the right-hand side $b$ of the system of equations $Ax=b$.

On intermediate entry: the returned value of $irevcm$ determines the contents of $v$ in the following way.

If $irevcm=1$ or $2$, $v$ must store the vector $v$, the result of the operation specified by the value of $irevcm$ returned by the previous call to real_symm_basic_solver.

If $irevcm=3$, $v$ must remain unchanged.

On intermediate exit: if $irevcm=3$, $v$ holds the current iterate of the residual vector. Note that this is an approximation to the true residual vector. Otherwise, it does not contain any useful information.

On final exit: if $errno$ = 3 or -i, the array $v$ is unchanged from the last entry to real_symm_basic_solver. If $errno$ = 1, the array $v$ is unchanged from the initial entry to real_symm_basic_solver. If the function exits successfully or $errno$ = 2, the array $v$ contains the true residual vector of the system of equations (see also Exceptions). Otherwise, $v$ stores the last iterate of the residual vector unless the Lanczos method (SYMMLQ) was used and $errno$ >= 5, in which case $v$ is set to $0.0$.

wgtfloat, array-like, shape $\left(\text{n}\right)$

The user-supplied weights, if these are to be used in the computation of the vector norms in the termination criterion (see Notes for real_symm_basic_setup and Parameters for real_symm_basic_setup).

Weights are NOT used in the MINRES algorithm.

commdict, communication object, modified in place

Communication structure.

This argument must have been initialized by a prior call to real_symm_basic_setup().

Returns

irevcmint

On intermediate exit: has the following meanings.

$irevcm=1$

The calling program must compute the matrix-vector product $v=Au$, where $u$ and $v$ are stored in $u$ and $v$, respectively.

$irevcm=2$

The calling program must solve the preconditioning equation $Mv=u$, where $u$ and $v$ are stored in $u$ and $v$, respectively.

$irevcm=3$

Monitoring step: the solution and residual at the current iteration are returned in the arrays $u$ and $v$, respectively. No action by the calling program is required. To return additional information real_symm_basic_diag() can be called at this step.

On final exit: if $irevcm=4$, real_symm_basic_solver has completed its tasks. The value of $\text{errno}$ determines whether the iteration has been successfully completed, errors have been detected or the calling program has requested termination.

Raises

NagValueError

(errno $-1$)

On intermediate re-entry, $irevcm=⟨value⟩$.

Constraint: either $irevcm$ must be unchanged from its previous exit value or $irevcm=5$ or $6$.

(errno $-1$)

On initial entry, $irevcm=⟨value⟩$.

Constraint: $irevcm=0$.

(errno $3$)

Either real_symm_basic_setup() was not called before calling this function or it has returned an error.

(errno $6$)

The preconditioner appears not to be positive definite. The computation cannot continue.

(errno $9$)

The matrix of the coefficients $A$ appears to be singular. The computation cannot continue.

(errno $10$)

The weights in array $wgt$ are all zero.

Warns

NagAlgorithmicWarning

(errno $1$)

real_symm_basic_solver has already completed its tasks. You need to set a new problem.

(errno $2$)

The required accuracy could not be obtained. However, a reasonable accuracy may have been achieved.

(errno $2$)

User-requested termination: the required accuracy could not be obtained. However, a reasonable accuracy may have been achieved.

(errno $4$)

User-requested tidy termination. The solution has not converged after $⟨value⟩$ iterations.

(errno $5$)

The solution has not converged after $⟨value⟩$ iterations.

(errno $7$)

The matrix of the coefficients $A$ appears not to be positive definite. The computation cannot continue.

(errno $8$)

User-requested immediate termination.

Notes

real_symm_basic_solver solves the symmetric system of linear simultaneous equations $Ax=b$ using the preconditioned conjugate gradient method (see Hestenes and Stiefel (1952), Golub and Van Loan (1996), Barrett et al. (1994) and Dias da Cunha and Hopkins (1994)), a preconditioned Lanczos method based upon the algorithm SYMMLQ (see Paige and Saunders (1975) and Barrett et al. (1994)), or the MINRES algorithm (see Paige and Saunders (1975)).

For a general description of the methods employed you are referred to Notes for real_symm_basic_setup.

real_symm_basic_solver can solve the system after the first function in the suite, real_symm_basic_setup(), has been called to initialize the computation and specify the method of solution. The third function in the suite, real_symm_basic_diag(), can be used to return additional information generated by the computation during monitoring steps and after real_symm_basic_solver has completed its tasks.

real_symm_basic_solver uses reverse communication, i.e., real_symm_basic_solver returns repeatedly to the calling program with the argument $irevcm$ (see Parameters) set to specified values which require the calling program to carry out a specific task: either to compute the matrix-vector product $v=Au$; to solve the preconditioning equation $Mv=u$; to notify the completion of the computation; or, to allow the calling program to monitor the solution. Through the argument $irevcm$ the calling program can cause immediate or tidy termination of the execution. On final exit, the last iterates of the solution and of the residual vectors of the original system of equations are returned.

Reverse communication has the following advantages.

1. Maximum flexibility in the representation and storage of sparse matrices: all matrix operations are performed outside the solver function, thereby avoiding the need for a complicated interface with enough flexibility to cope with all types of storage schemes and sparsity patterns. This applies also to preconditioners.

2. Enhanced user interaction: you can closely monitor the solution and tidy or immediate termination can be requested. This is useful, for example, when alternative termination criteria are to be employed or in case of failure of the external functions used to perform matrix operations.

References

Barrett, R, Berry, M, Chan, T F, Demmel, J, Donato, J, Dongarra, J, Eijkhout, V, Pozo, R, Romine, C and Van der Vorst, H, 1994, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia

Dias da Cunha, R and Hopkins, T, 1994, PIM 1.1 — the parallel iterative method package for systems of linear equations user’s guide — Fortran 77 version, Technical Report, Computing Laboratory, University of Kent at Canterbury, Kent, UK

Golub, G H and Van Loan, C F, 1996, Matrix Computations, (3rd Edition), Johns Hopkins University Press, Baltimore

Hestenes, M and Stiefel, E, 1952, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Stand. (49), 409–436

Higham, N J, 1988, FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation, ACM Trans. Math. Software (14), 381–396

Paige, C C and Saunders, M A, 1975, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal. (12), 617–629