HCL_IRArnoldi_d implements the implicitly restarted Arnoldi algorithm for solving the (generalized) eigenvalue problem
![]() | Input Parameters | ||||||||||||||||
![]() | Methods
| ||||||||||||||||
![]() | 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 prouct 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"
Default = 2
0 - Success
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