A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP

DOI10.1016/S0167-8191(05)80156-5MaRDI QIDQ1179256zbMATH OpenFDO

Authors Giorgio Pini

Publication date 26 June 1992

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8191(05)80156-5

zbMATH Keywords

eigenpairsfinite element matricesparallel algorithmsparse symmetric matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Parallel numerical computation (65Y05)

Review text

The author presents a parallel algorithm to calculate only the leftmost \(p\) eigenpairs of finite element matrices with very large dimensions. It is shown that the vectorized algorithm achieves an average speed up 3.34 with respect to the best scalar code. The parallel version improves this average speed up by factors 1.72, 2.24, 2.63 with two, three and four processors, respectively. The result suggests that the proposed method ranks among the most efficient parallel algorithms.

Recommendations

• Parallel evaluation of leftmost eigenpairs of large unsymmetric matrices
• A comparison of two parallel algorithms for the symmetric eigenproblem
• scientific article; zbMATH DE number 1526541
• A Parallel Inertia Method for Finding Eigenvalues on Vector and SIMD Architectures

Cited in

(7)

• A partitioned shift-without-invert algorithm to improve parallel eigensolution efficiency in real-space electronic transport
• A parallel algorithm for solving a partial eigenvalue problem for block-diagonal bordered matrices
• Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems
• Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
• Parallel evaluation of leftmost eigenpairs of large unsymmetric matrices
• LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING
• A parallel algorithm for computing partial spectral factorizations of matrix pencils via Chebyshev approximation

This page was built for publication: A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP

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