PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_sparseig_complex_band_solve (f12au)
Purpose
nag_sparseig_complex_band_solve (f12au) is the main solver function in a suite of functions consisting of
nag_sparseig_complex_option (f12ar),
nag_sparseig_complex_band_init (f12at) and
nag_sparseig_complex_band_solve (f12au). It must be called following an initial call to
nag_sparseig_complex_band_init (f12at) and following any calls to
nag_sparseig_complex_option (f12ar).
nag_sparseig_complex_band_solve (f12au) returns approximations to selected eigenvalues, and (optionally) the corresponding eigenvectors, of a standard or generalized eigenvalue problem defined by complex banded non-Hermitian matrices. The banded matrix must be stored using the LAPACK
storage format for complex banded non-Hermitian matrices.
Syntax
[
nconv,
d,
z,
resid,
v,
comm,
icomm,
ifail] = f12au(
kl,
ku,
ab,
mb,
sigma,
resid,
comm,
icomm)
[
nconv,
d,
z,
resid,
v,
comm,
icomm,
ifail] = nag_sparseig_complex_band_solve(
kl,
ku,
ab,
mb,
sigma,
resid,
comm,
icomm)
Description
The suite of functions is designed to calculate some of the eigenvalues, , (and optionally the corresponding eigenvectors, ) of a standard eigenvalue problem , or of a generalized eigenvalue problem of order , where is large and the coefficient matrices and are banded, complex and non-Hermitian.
Following a call to the initialization function
nag_sparseig_complex_band_init (f12at),
nag_sparseig_complex_band_solve (f12au) returns the converged approximations to eigenvalues and (optionally) the corresponding approximate eigenvectors and/or a unitary 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 banded non-Hermitian matrices. There is negligible additional computational cost to obtain eigenvectors; a unitary basis is always computed, but there is an additional storage cost if both are requested.
The banded matrices
and
must be stored using the LAPACK column ordered storage format for banded non-Hermitian matrices; please refer to
Band storage in the F07 Chapter Introduction for details on this storage format.
nag_sparseig_complex_band_solve (f12au) is based on the banded driver functions
znbdr1 to
znbdr4 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 non-Hermitian matrices is provided in
Lehoucq and Scott (1996). This suite of functions offers the same functionality as the ARPACK banded driver software for complex non-Hermitian problems, but the interface design is quite different in order to make the option setting clearer and to combine the different drivers into a general purpose function.
nag_sparseig_complex_band_solve (f12au), is a general purpose function that must be called following initialization by
nag_sparseig_complex_band_init (f12at).
nag_sparseig_complex_band_solve (f12au) uses options, set either by default or explicitly by calling
nag_sparseig_complex_option (f12ar), to return the converged approximations to selected eigenvalues and (optionally):
– |
the corresponding approximate eigenvectors; |
– |
a unitary basis for the associated approximate invariant subspace; |
– |
both. |
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
Parameters
Note: in the following description
n,
nev and
ncv appears. In every case they should be interpretted as the value associated with the identically named argument in a prior call to
nag_sparseig_complex_band_init (f12at).
Compulsory Input Parameters
- 1:
– int64int32nag_int scalar
-
The number of subdiagonals of the matrices and .
Constraint:
.
- 2:
– int64int32nag_int scalar
-
The number of superdiagonals of the matrices and .
Constraint:
.
- 3:
– complex array
-
The first dimension of the array
ab must be at least
.
The second dimension of the array
ab must be at least
.
Must contain the matrix
in LAPACK banded storage format for non-Hermitian matrices (see
Band storage in the F07 Chapter Introduction).
- 4:
– complex array
-
The first dimension of the array
mb must be at least
.
The second dimension of the array
mb must be at least
.
Must contain the matrix
in LAPACK banded storage format for non-Hermitian matrices (see
Band storage in the F07 Chapter Introduction).
- 5:
– complex scalar
-
If the
Shifted Inverse mode (see
nag_sparseig_complex_option (f12ar)) has been selected then
sigma must contain the shift used; otherwise
sigma is not referenced.
Shift and Invert Spectral Transformations in the F12 Chapter Introduction describes the use of shift and invert transformations.
- 6:
– complex array
-
Need not be set unless the option
Initial Residual has been set in a prior call to
nag_sparseig_complex_option (f12ar) in which case
resid must contain an initial residual vector.
- 7:
– complex array
- 8:
– int64int32nag_int array
Optional Input Parameters
None.
Output Parameters
- 1:
– int64int32nag_int scalar
-
The number of converged eigenvalues.
- 2:
– complex array
-
The first
nconv locations of the array
d contain the converged approximate eigenvalues.
- 3:
– complex array
-
The first dimension,
, of the array
z will be
- if the default option has been selected, ;
- if the option has been selected, .
The second dimension of the array
z will be
.
If the default option
(see
nag_sparseig_complex_option (f12ar)) has been selected then
z contains the final set of eigenvectors corresponding to the eigenvalues held in
d, otherwise
z is not referenced. The complex eigenvector associated with an eigenvalue
is stored in the corresponding array section of
z, namely
, for
and
.
- 4:
– complex array
-
Contains the final residual vector. This can be used as the starting residual to improve convergence on the solution of a closely related eigenproblem. This has no relation to the error residual or .
- 5:
– complex array
-
The first dimension of the array
v will be
.
The second dimension of the array
v will be
.
If the option
or
(see
nag_sparseig_complex_option (f12ar)) has been set and a separate array
z has been passed (i.e.,
z does not equal
v), then the first
nconv columns of
v will contain approximate Schur vectors that span the desired invariant subspace.
The
th Schur vector is stored in the
th column of
v.
- 6:
– complex array
Communication array, used to store information between calls to nag_sparseig_complex_band_solve (f12au).
- 7:
– int64int32nag_int array
Communication array, used to store information between calls to nag_sparseig_complex_band_solve (f12au).
- 8:
– 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:
-
-
Constraint: .
-
-
Constraint: .
-
-
Constraint: .
-
-
The maximum number of iterations
, the option
Iteration Limit has been set.
-
-
The options
Generalized and
Regular are incompatible.
-
-
The option
Initial Residual was selected but the starting vector held in
resid is zero.
-
-
Either the initialization function has not been called prior to the first call of this function or a communication array has become corrupted.
-
-
Constraint: .
-
-
On entry, , but this is not yet implemented.
-
-
The number of eigenvalues found to sufficient accuracy is zero.
-
-
Could not build an Arnoldi factorization.
-
-
Error in internal call to compute eigenvalues and corresponding error bounds of the current upper Hessenberg matrix. Please contact
NAG.
-
-
During calculation of a Schur form, there was a failure to compute a number of eigenvalues Please contact
NAG.
-
-
The computed Schur form could not be reordered by an internal call. Please contact
NAG.
-
-
Error in internal call to compute eigenvectors. Please contact
NAG.
-
-
Failure during internal factorization of real banded matrix. Please contact
NAG.
-
-
Failure during internal solution of real banded matrix. Please contact
NAG.
-
-
Failure during internal factorization of complex banded matrix. Please contact
NAG.
-
-
Failure during internal solution of complex banded matrix. Please contact
NAG.
-
-
The maximum number of iterations has been reached.
-
-
No shifts could be applied during a cycle of the implicitly restarted Arnoldi iteration.
-
-
Overflow occurred during transformation of Ritz values to those of the original problem.
-
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 relative accuracy of a Ritz value,
, is considered acceptable if its Ritz estimate
. The default
Tolerance used is the
machine precision given by
nag_machine_precision (x02aj).
Further Comments
None.
Example
This example constructs the matrices and using LAPACK band storage format and solves in shifted inverse mode using the complex shift .
Open in the MATLAB editor:
f12au_example
function f12au_example
fprintf('f12au example results\n\n');
nx = int64(10);
n = nx*nx;
nev = int64(4);
ncv = int64(10);
sigma = 0.4 + 0.6i;
kl = nx;
ku = nx;
ab = zeros(2*kl+ku+1,n);
mb = zeros(2*kl+ku+1,n);
idiag = kl + ku + 1;
ab(idiag,1:n) = 4;
mb(idiag,1:n) = ab(idiag,1);
isup = kl + ku;
isub = kl + ku + 2;
rho = 100;
h = 1/double(nx+1);
for i=1:nx
lo = (i-1)*nx;
for j=lo+1:lo+nx-1
ab(isub,j+1) = -1 + 0.5*h*rho;
ab(isup,j) = -1 - 0.5*h*rho;
end
end
mb(isub,2:n) = 1;
mb(isup,1:n-1) = 1;
isup = kl + 1;
isub = 2*kl + ku + 1;
for i = 1:nx - 1
lo = (i-1)*nx;
for j = lo + 1:lo + nx
ab(isup,nx+j) = -1;
ab(isub,j) = -1;
end
end
resid = complex(zeros(100,1));
[icomm, comm, ifail] = f12at( ...
n, nev, ncv);
[icomm, comm, ifail] = f12ar( ...
'SHIFTED INVERSE', icomm, comm);
[icomm, comm, ifail] = f12ar( ...
'GENERALIZED', icomm, comm);
[nconv, d, z, resid, v, comm, icomm, ifail] = ...
f12au( ...
kl, ku, complex(ab), complex(mb), sigma, resid, comm, icomm);
fprintf('\nRitz values closest to sigma:\n');
disp(d);
f12au example results
Ritz values closest to sigma:
0.3610 + 0.7223i
0.4598 + 0.7199i
0.2868 + 0.7241i
0.2410 + 0.7257i
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015