A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures

DOI10.1137/S1064827598336951zbMath0939.65058OpenAlexW2083154122MaRDI QIDQ4702362

Françoise Tisseur, Jack J. Dongarra

Publication date: 24 November 1999

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1064827598336951

zbMATH Keywords

parallel algorithmtridiagonal matrixrank-one modificationsymmetric eigenvalue problemScaLAPACKdivide and conquer algorithmdistributed memory architecture

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items (11)

New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem ⋮ Solution of the \(k\)-th eigenvalue problem in large-scale electronic structure calculations ⋮ GPU-acceleration of the ELPA2 distributed eigensolver for dense symmetric and Hermitian eigenproblems ⋮ Inter-layer synchronization of periodic solutions in two coupled rings with time delay ⋮ Circumscribed ellipsoid algorithm for fixed-point problems ⋮ Numerical simulation of quantum effects in high-k gate dielectric MOS structures using quantum mechanical models ⋮ A parallel/recursive algorithm ⋮ An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures ⋮ Parallel Diagonalization Performance on High-Performance Computers ⋮ Eigenvalue computation in the 20th century ⋮ Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems

Uses Software

• ATLAS
• LAPACK
• ScaLAPACK

This page was built for publication: A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures