Interfaces for the NAG Mark 29.2 sparseig Chapter.
sparseig - Large Scale Eigenproblems
This module provides functions for computing some eigenvalues and eigenvectors of large-scale (sparse) standard and generalized eigenvalue problems. It provides functions for:
solution of symmetric eigenvalue problems;
solution of nonsymmetric eigenvalue problems;
solution of generalized symmetric-definite eigenvalue problems;
solution of generalized nonsymmetric eigenvalue problems;
solution of polynomial eigenvalue problems;
partial singular value decomposition.
Functions are provided for both real and complex data.
The functions in this module whose names do not contain substring ‘_feast_’ have all been derived from the ARPACK software suite (see Lehoucq et al. (1998)), a collection of Fortran 77 functions designed to solve large scale eigenvalue problems. The interfaces provided in this module have been chosen to combine ease of use with the flexibility of the original ARPACK software. The underlying iterative methods and algorithms remain essentially the same as those in ARPACK and are described fully in Lehoucq et al. (1998).
The algorithms used in the ARPACK functions are based upon an algorithmic variant of the Arnoldi process called the Implicitly Restarted Arnoldi Method. For symmetric matrices, this reduces to a variant of the Lanczos process called the Implicitly Restarted Lanczos Method. These variants may be viewed as a synthesis of the Arnoldi/Lanczos process with the Implicitly Shifted technique that is suitable for large scale problems. For many standard problems, a matrix factorization is not required. Only the action of the matrix on a vector is needed.
The ARPACK functions can be used to find the eigenvalues with the largest and/or smallest magnitudes, real part or imaginary part.
The functions in this module whose names contain substring ‘_feast_’ have been derived from the FEAST software suite (see Polizzi (2009)). FEAST is a general purpose eigensolver for standard, generalized and polynomial eigenvalue problems. It is suitable for both sparse and dense matrices, and functions are available for real, complex, symmetric, Hermitian and non-Hermitian eigenvalue problems. The FEAST algorithm requires you to specify a particular region of interest in the complex plane within which eigenvalues are sought. The algorithm then performs a numerical quadrature computation, involving solving linear systems along a complex contour around the region of interest.
This subpackage contains examples for the
sparseigmodule. See also the Examples subsection.
Standard or generalized eigenvalue problems for complex matrices
Standard or generalized eigenvalue problems for real nonsymmetric matrices
Standard or generalized eigenvalue problems for real symmetric matrices
NAG FEAST suite
For full information please refer to the NAG Library document
Nonsymmetric Polynomial Eigenvalue Problem.
>>> main() naginterfaces.library.sparseig.feast_poly_gen_solve Python Example Results. Nonsymmetric Polynomial Eigenvalue Problem. Eigenvalues: [-1.01154017+0.74243953j -0.97330836+0.60663851j] Right eigenvectors: [[-0.27867645-0.55398883j 0.64961648+0.07275759j] [ 0.15963493-0.05141476j -0.0367055 +0.19246955j] [ 0.20169124+0.24677364j -0.02640785+0.10024232j] [-0.022247 -0.02329904j 0.04061443-0.01888747j]] Left eigenvectors: [[-0.00184768-0.01019648j -0.03812357+0.02278326j] [ 0.01537005-0.00110981j -0.02825777-0.04867545j] [-0.7176863 -0.28399747j -0.5525527 +0.4415414j ] [-0.01783012+0.00584953j -0.01808489+0.04505064j]]