The FEAST solver package is a free high-performance numerical library for solving the standard or generalized eigenvalue problem, and obtaining all the eigenvalues and eigenvectors within a given search interval.
www.ecs.umass.edu/~polizzi/feast/
Implements Jacobi-Davidson iterative method to identify a given number of eigenvalues near a target value. ... the maximum number of steps taken in the inner iteration (iterative linear solver) (default: 200).
pysparse.sourceforge.net/jdsym.html
A Scalable Eigenvalue Solver for Symmetric Tridiagonal Matrices (1994) [11 citations — 9 self] ... 1 Parallel bisection for finding eigenvalues on vector and SIMD architectures – Conroy, Podrazik - 1992...
citeseer.ist.psu.edu/327836.html
Computes a few eigenvalues and eigenvectors of a nonsymmetric matrix. ... AHBEIGS: will find a few eigenvalues and eigenvectors for either the standard eigenvalue problem A*x = lambda*x or the generalized eigenvalue problem A*x = lambda*B*x.
www.mathworks.com/matlabcentral/fileexchange/8339-augme... www.mathworks.com/matlabcentral/fileexchange/8339-augmented-householder-eigenvalue-solver
It is shown in [245] that in this case, the LU algorithm is advantageous for the calculation of eigenvalues compared to the commonly used QR algorithm which transforms the matrix into an upper HESSENBERG matrix [246]. This is also done by the CEPHES solver. ... Matrix elements Symmetry Eigenvalues Eigenvectors Solver Reference...
www.iue.tuwien.ac.at/phd/gehring/node81.html
The basic Lanczos parallel algorithm consists of a distributed matrix-vector multiply. The matrix is sparse where each atom The block size depends on the repective physical model. ... In the matrix-vector multiply each CPU has to communicate intrermediate results to several other CPU's for the next iteration step.
cobweb.ecn.purdue.edu/~gekco/parallel/3d_lanczos.html
A projected matrix pencil with eigenvalues of interest are derived by solution of systems of linear equations. A parallel implementation and the estimation of an integral path using the algebraic sub-structuring method ... HomeAn Eigenvalue Solver Using Contour Integration for Linear/Nonlinear Eigenvalue Problem...
cse.berkeley.edu/seminars/eigenvalue-solver-using-conto... cse.berkeley.edu/seminars/eigenvalue-solver-using-contour-integration-linearnonlinear-eigenvalue-problems
This page contains a routine that numerically finds the eigenvalues and eigenvectors of a 4 X 4 Real Matrix. The algorithm is from the EISPACK collection of subroutines.
www.akiti.ca/Eig4Solv.html
If you have all the data ready, simply enter it, click the Solve button, and it will calculate the eigenvalues of [A] and the associated eigenvectors. Note that the a values are assumed to be real; however, the solutions may be complex.
www3.telus.net/thothworks/Eig2Solv.html
We use the results of this analysis to parallelize a Lanczos eigenvalue solver subroutine for real symmetric matrices [3]. We are interested in applications ...
www.springerlink.com/index/28863t18n405v794.pdf