A massively parallel dense symmetric eigensolver with communication splitting multicasting algorithm

DOI10.1007/978-3-642-19328-6_15MaRDI QIDQ3081354zbMATH OpenOpenAlexFDO

Authors Takahiro Katagiri, Shoji Itoh

Publication date 8 March 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19328-6_15

zbMATH Keywords

numerical algorithms for CS\&Eparallel and distributed computing

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• An efficient implementation of parallel eigenvalue computation for massively parallel processing
• Efficient solution of symmetric/Hermitian eigenvalue problems on parallel arrays of vector processors
• A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations
• Toward an Efficient Parallel Eigensolver for Dense Symmetric Matrices
• A parallel algorithm for computing eigenvalues of very large real symmetric matrices on message passing architectures

Cites work

• An efficient implementation of parallel eigenvalue computation for massively parallel processing
• Block reduction of matrices to condensed forms for eigenvalue computations

Cited in

(2)

• A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations
• An efficient implementation of parallel eigenvalue computation for massively parallel processing

This page was built for publication: A massively parallel dense symmetric eigensolver with communication splitting multicasting algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3081354)