New software for large dense symmetric generalized eigenvalue problems using secondary storage
From MaRDI portal
(Redirected from Publication:1104043)
The authors develop software for the out-of-core solution of the symmetric generalized eigenproblem. Because of its block nature, this software is more efficient on vector computers than a related in-core algorithm. If the number of required eigenpairs is large, the new software is more efficient than the earlier algorithms based on the Lanczos algorithm.
Recommendations
- Solution of large, dense symmetric generalized eigenvalue problems using secondary storage
- The solution of large dense generalized eigenvalue problems on the Cray X-MP/24 with SSD
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- Efficient solution of symmetric/Hermitian eigenvalue problems on parallel arrays of vector processors
- A new numerical procedure for symmetric eigen value problems
Cites work
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- An extended set of FORTRAN basic linear algebra subprograms
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Matrix eigensystem routines. EISPACK guide extension
- Solution of large, dense symmetric generalized eigenvalue problems using secondary storage
- The solution of large dense generalized eigenvalue problems on the Cray X-MP/24 with SSD
Cited in
(3)- Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
- Solution of large, dense symmetric generalized eigenvalue problems using secondary storage
- Automatic code selection for the dense symmetric generalized eigenvalue problem using ATMathCoreLib
This page was built for publication: New software for large dense symmetric generalized eigenvalue problems using secondary storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104043)