Spectra
1.0.1
Header-only C++ Library for Large Scale Eigenvalue Problems
|
#include <Spectra/GenEigsSolver.h>
Public Member Functions | |
GenEigsSolver (OpType &op, Index nev, Index ncv) | |
Public Member Functions inherited from Spectra::GenEigsBase< DenseGenMatProd< double >, IdentityBOp > | |
void | init (const Scalar *init_resid) |
void | init () |
Index | compute (SortRule selection=SortRule::LargestMagn, Index maxit=1000, Scalar tol=1e-10, SortRule sorting=SortRule::LargestMagn) |
CompInfo | info () const |
Index | num_iterations () const |
Index | num_operations () const |
ComplexVector | eigenvalues () const |
ComplexMatrix | eigenvectors (Index nvec) const |
ComplexMatrix | eigenvectors () const |
This class implements the eigen solver for general real matrices, i.e., to solve \(Ax=\lambda x\) for a possibly non-symmetric \(A\) matrix.
Most of the background information documented in the SymEigsSolver class also applies to the GenEigsSolver class here, except that the eigenvalues and eigenvectors of a general matrix can now be complex-valued.
OpType | The name of the matrix operation class. Users could either use the wrapper classes such as DenseGenMatProd and SparseGenMatProd, or define their own that implements the type definition Scalar and all the public member functions as in DenseGenMatProd. |
An example that illustrates the usage of GenEigsSolver is give below:
And also an example for sparse matrices:
Definition at line 119 of file GenEigsSolver.h.
|
inline |
Constructor to create a solver object.
op | The matrix operation object that implements the matrix-vector multiplication operation of \(A\): calculating \(Av\) for any vector \(v\). Users could either create the object from the wrapper class such as DenseGenMatProd, or define their own that implements all the public members as in DenseGenMatProd. |
nev | Number of eigenvalues requested. This should satisfy \(1\le nev \le n-2\), where \(n\) is the size of matrix. |
ncv | Parameter that controls the convergence speed of the algorithm. Typically a larger ncv means faster convergence, but it may also result in greater memory use and more matrix operations in each iteration. This parameter must satisfy \(nev+2 \le ncv \le n\), and is advised to take \(ncv \ge 2\cdot nev + 1\). |
Definition at line 142 of file GenEigsSolver.h.