NAG Library Function Document

nag_complex_sparse_eigensystem_sol (f12aqc)

Note: this function uses optional arguments to define choices in the problem specification. If you wish to use default settings for all of the optional arguments, then the option setting function nag_complex_sparse_eigensystem_option (f12arc) need not be called. If, however, you wish to reset some or all of the settings please refer to Section 11 in nag_complex_sparse_eigensystem_option (f12arc) for a detailed description of the specification of the optional arguments.

+− Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

+− 10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1 Purpose

nag_complex_sparse_eigensystem_sol (f12aqc) is a post-processing function in a suite of functions consisting of nag_complex_sparse_eigensystem_init (f12anc), nag_complex_sparse_eigensystem_iter (f12apc), nag_complex_sparse_eigensystem_sol (f12aqc), nag_complex_sparse_eigensystem_option (f12arc) and nag_complex_sparse_eigensystem_monit (f12asc), that must be called following a final exit from nag_complex_sparse_eigensystem_sol (f12aqc).

2 Specification

#include <nag.h>

#include <nagf12.h>

void	nag_complex_sparse_eigensystem_sol (Integer nconv, Complex d[], Complex z[], Complex sigma, const Complex resid[], Complex v[], Complex comm[], Integer icomm[], NagError fail)

3 Description

The suite of functions is designed to calculate some of the eigenvalues,

λ

, (and optionally the corresponding eigenvectors,

x

) of a standard eigenvalue problem

A x = λ x

, or of a generalized eigenvalue problem

A x = λ B x

of order

n

, where

n

is large and the coefficient matrices

A

and

B

are sparse, complex and nonsymmetric. The suite can also be used to find selected eigenvalues/eigenvectors of smaller scale dense, complex and nonsymmetric problems.

Following a call to nag_complex_sparse_eigensystem_iter (f12apc), nag_complex_sparse_eigensystem_sol (f12aqc) returns the converged approximations to eigenvalues and (optionally) the corresponding approximate eigenvectors and/or an orthonormal basis for the associated approximate invariant subspace. The eigenvalues (and eigenvectors) are selected from those of a standard or generalized eigenvalue problem defined by complex nonsymmetric matrices. There is negligible additional cost to obtain eigenvectors; an orthonormal basis is always computed, but there is an additional storage cost if both are requested.

nag_complex_sparse_eigensystem_sol (f12aqc) is based on the function zneupd from the ARPACK package, which uses the Implicitly Restarted Arnoldi iteration method. The method is described in Lehoucq and Sorensen (1996) and Lehoucq (2001) while its use within the ARPACK software is described in great detail in Lehoucq et al. (1998). An evaluation of software for computing eigenvalues of sparse nonsymmetric matrices is provided in Lehoucq and Scott (1996). This suite of functions offers the same functionality as the ARPACK software for complex nonsymmetric problems, but the interface design is quite different in order to make the option setting clearer and to simplify some of the interfaces.

nag_complex_sparse_eigensystem_sol (f12aqc) is a post-processing function that must be called following a successful final exit from nag_complex_sparse_eigensystem_iter (f12apc). nag_complex_sparse_eigensystem_sol (f12aqc) uses data returned from nag_complex_sparse_eigensystem_iter (f12apc) and options set either by default or explicitly by calling nag_complex_sparse_eigensystem_option (f12arc), to return the converged approximations to selected eigenvalues and (optionally):

–	the corresponding approximate eigenvectors;
–	an orthonormal basis for the associated approximate invariant subspace;
–	both.

4 References

Lehoucq R B (2001) Implicitly restarted Arnoldi methods and subspace iteration SIAM Journal on Matrix Analysis and Applications 23 551–562

Lehoucq R B and Scott J A (1996) An evaluation of software for computing eigenvalues of sparse nonsymmetric matrices Preprint MCS-P547-1195 Argonne National Laboratory

Lehoucq R B and Sorensen D C (1996) Deflation techniques for an implicitly restarted Arnoldi iteration SIAM Journal on Matrix Analysis and Applications 17 789–821

Lehoucq R B, Sorensen D C and Yang C (1998) ARPACK Users' Guide: Solution of Large-scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods SIAM, Philidelphia

5 Arguments

1: nconv – Integer *Output: On exit: the number of converged eigenvalues as found by nag_complex_sparse_eigensystem_option (f12arc).
2: d[ $\dim$ ] – ComplexOutput: Note: the dimension, dim, of the array d must be at least $ncv$ (see nag_complex_sparse_eigensystem_init (f12anc)).
On exit: the first nconv locations of the array d contain the converged approximate eigenvalues.
3: z[ $n \times ncv$ ] – ComplexOutput: On exit: if the default option $Vectors ='RITZ'$ (see nag_real_sparse_eigensystem_option (f12adc)) has been selected then z contains the final set of eigenvectors corresponding to the eigenvalues held in d. The complex eigenvector associated with an eigenvalue is stored in the corresponding array section of z.
4: sigma – ComplexInput: On entry: if one of the $Shifted Inverse$ (see nag_complex_sparse_eigensystem_option (f12arc)) modes has been selected then sigma contains the shift used; otherwise sigma is not referenced.
5: resid[ $\dim$ ] – const ComplexInput: Note: the dimension, dim, of the array resid must be at least $n$ (see nag_complex_sparse_eigensystem_init (f12anc)).
On entry: must not be modified following a call to nag_complex_sparse_eigensystem_iter (f12apc) since it contains data required by nag_complex_sparse_eigensystem_sol (f12aqc).
6: v[ $n \times ncv$ ] – ComplexInput/Output: The $i$ th element of the $j$ th basis vector is stored in location $v [n \times (j - 1) + i - 1]$ , for $i = 1, 2, \dots, n$ and $j = 1, 2, \dots, ncv$ .

On entry: the ncv sections of v, of length $n$ , contain the Arnoldi basis vectors for $OP$ as constructed by nag_complex_sparse_eigensystem_iter (f12apc).

On exit: if the option $Vectors ='SCHUR'$ or $'RITZ'$ has been set and a separate array z has been passed (i.e., z does not equal v), then the first nconv sections of v, of length $n$ , will contain approximate Schur vectors that span the desired invariant subspace.
7: comm[ $\dim$ ] – ComplexCommunication Array: Note: the dimension, dim, of the array comm must be at least $\max (1, lcomm)$ (see nag_complex_sparse_eigensystem_init (f12anc)).
On initial entry: must remain unchanged from the prior call to nag_complex_sparse_eigensystem_init (f12anc).

On exit: contains data on the current state of the solution.
8: icomm[ $\dim$ ] – IntegerCommunication Array: Note: the dimension, dim, of the array icomm must be at least $\max (1, licomm)$ (see nag_complex_sparse_eigensystem_init (f12anc)).
On initial entry: must remain unchanged from the prior call to nag_complex_sparse_eigensystem_init (f12anc).

On exit: contains data on the current state of the solution.
9: fail – NagError *Input/Output: The NAG error argument (see Section 3.6 in the Essential Introduction).

6 Error Indicators and Warnings

NE_ALLOC_FAIL: Dynamic memory allocation failed.
NE_BAD_PARAM: On entry, argument $⟨value⟩$ had an illegal value.
NE_INTERNAL_EIGVEC_FAIL: In calculating eigenvectors, an internal call returned with an error. The function returned with $fail . code = ⟨value⟩$ . Please contact NAG.
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_INVALID_OPTION: On entry, $Vectors = Select$ , but this is not yet implemented.
NE_RITZ_COUNT: Got a different count of the number of converged Ritz values than the value passed to it through the argument icomm: number counted $= ⟨value⟩$ , number expected $= ⟨value⟩$ . This usually indicates that a communication array has been altered or has become corrupted between calls to nag_complex_sparse_eigensystem_iter (f12apc) and nag_complex_sparse_eigensystem_sol (f12aqc).
NE_SCHUR_EIG_FAIL: During calculation of a Schur form, there was a failure to compute $⟨value⟩$ eigenvalues in a total of $⟨value⟩$ iterations.
NE_SCHUR_REORDER: The computed Schur form could not be reordered by an internal call. This function returned with $fail . code = ⟨value⟩$ . Please contact NAG.
NE_ZERO_EIGS_FOUND: The number of eigenvalues found to sufficient accuracy, as communicated through the argument icomm, is zero. You should experiment with different values of nev and ncv, or select a different computational mode or increase the maximum number of iterations prior to calling nag_complex_sparse_eigensystem_iter (f12apc).

7 Accuracy

The relative accuracy of a Ritz value,

λ

, is considered acceptable if its Ritz estimate

\leq Tolerance \times |λ|

. The default

Tolerance

used is the machine precision given by nag_machine_precision (X02AJC).

8 Parallelism and Performance

nag_complex_sparse_eigensystem_sol (f12aqc) is not threaded by NAG in any implementation.

nag_complex_sparse_eigensystem_sol (f12aqc) makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

None.

10 Example

This example solves

A x = λ B x

in regular-invert mode, where

A

and

B

are derived from the standard central difference discretization of the one-dimensional convection-diffusion operator

\frac{d^{2} u}{d x^{2}} + ρ \frac{d u}{d x}

[0, 1]

, with zero Dirichlet boundary conditions.

NAG Library Function Documentnag_complex_sparse_eigensystem_sol (f12aqc)