Toward a High Performance Tile Divide and Conquer Algorithm for the Dense Symmetric Eigenvalue Problem

DOI10.1137/110823699zbMath1261.65038OpenAlexW2039599184MaRDI QIDQ4908665

Hatem Ltaief, A. Haidar, Jack J. Dongarra

Publication date: 6 March 2013

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

Full work available at URL: http://hdl.handle.net/10754/555650

zbMATH Keywords

performancealgorithmnumerical examplesdynamic schedulingdivide and conquertile algorithmssymmetric eigenvalue solver

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)

Related Items (3)

Fast Computation of Spectral Projectors of Banded Matrices ⋮ An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths ⋮ A High Performance QDWH-SVD Solver Using Hardware Accelerators

Uses Software

• LAPACK
• MKL
• SBR Toolbox
• PLASMA
• Algorithm 880

This page was built for publication: Toward a High Performance Tile Divide and Conquer Algorithm for the Dense Symmetric Eigenvalue Problem