HCL_IRArnoldi_d implements the implicitly restarted Arnoldi algorithm for solving the (generalized) eigenvalue problem
virtual ostream& | Write (ostream &) const Prints description of the object |
Methods
| |||||||||||||||||
Input Parameters | |||||||||||||||||
Output Parameters
|
HCL_IRArnoldi_d implements the implicitly restarted Arnoldi algorithm for solving the (generalized) eigenvalue problem. The algorithm computes approximations to a few eigenpairs of of a linear operator. Optionally, this can be done with respect to the semi-inner product defined by a positive semi-definite linear operator B. This is an adaptation of the algorithm inplemented in ARPACK.
References:
R.B. Lehoucq, D.C. Sorensen \& C. Yang, "ARPACK Users Guide"
A - Linear operator.
x - Vector to start Arnoldi iteration. This is changed by
the function, and does not have a meaningful value on return.
OP - Linear operator Inv[A-sigmar*I].
sigmar - Real shift to apply.
x - Vector to start Arnoldi iteration. This is changed by
the function, and does not have a meaningful value on return.
OP - Linear operator Inv[M]*A.
x - Vector to start Arnoldi iteration. This is changed by
the function, and does not have a meaningful value on return.
eigr - Returns the real part of the ith eigenvalue.
eigi - Returns the imaginary part of the ith eigenvalue.
eigr - Returns the real part of the ith eigenvalue.
eigr - Returns the real part of the ith eigenvalue.
eigi - Returns the imaginary part of the ith eigenvalue.
vr - Returns the real part of the ith eigenvector.
vi - Returns the imaginary part of the ith eigenvector.
eigr - Returns the real part of the ith eigenvalue.
vr - Returns the real part of the ith eigenvector.
Default = 0
0 - Success
Default = 2*nev + 2
"SM" - Smallest magnitude
"LM" - Largest magnitude
"SR" - Smallest real part
"LR" - Largest real part
"SI" - Smallest imaginary part
"LI" - Largest imaginary part
Default = "LM"
Default = machine-epsilon
Default = 100
Default = 1
Default = 1
0 - No output
1 - One-line summary output
2 - Detailed header and footer with timing information
3 - Per-iteration statistics
1 - Too many restart iterations taken
2 - Initial vector is zero
3 - LAPACK Eig failed (shouldn't happen)
4 - Algorithm stalled-out with an invariant subspace
6 - No shifts available for shifted QR algorithm (shouldn't happen)
7 - Computing the Schur vectors failed
8 - Computing the eigenvectors failed
alphabetic index hierarchy of classes
this page has been generated automatically by doc++
(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de