Solution of large, dense symmetric generalized eigenvalue problems using secondary storage

DOI10.1145/44128.44130MaRDI QIDQ3793623zbMATH OpenOpenAlexWikidataFDO

Authors Roger. G. Grimes, Horst Simon

Publication date 1988

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toms/1988-14/

zbMATH Keywords

block Cholesky methodblock Householder reductionInverse iterationlarge, dense symmetric eigenproblemsout-of-core algorithmssupercomputersvector computers

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• New software for 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
• Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices
• The Lanczos algorithm for the generalized symmetric eigenproblem on shared-memory architectures
• Efficient solution of symmetric/Hermitian eigenvalue problems on parallel arrays of vector processors

Cited in

(5)

• New software for large dense symmetric generalized eigenvalue problems using secondary storage
• Solution of large eigenvalue problems in electronic structure calculations
• scientific article; zbMATH DE number 1497149 (Why is no real title available?)
• Algorithms for the Generalized NTRU Equations and their Storage Analysis
• Tridiagonalization of band symmetric matrices for vector computers

Describes a project that uses

Uses Software

• EISPACK

This page was built for publication: Solution of 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 Q3793623)