High-performance bidiagonal reduction using tile algorithms on homogeneous multicore architectures

DOI10.1145/2450153.2450154zbMath1295.65145OpenAlexW2057204994WikidataQ113310342 ScholiaQ113310342MaRDI QIDQ3189674

Piotr Luszczek, Hatem Ltaief, Jack J. Dongarra

Publication date: 12 September 2014

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

Full work available at URL: https://doi.org/10.1145/2450153.2450154

zbMATH Keywords

dynamic schedulingtwo-stage approachhigh performance kernelsbulge chasingbidiagional reductiondata translation layertile algorithms

Mathematics Subject Classification ID

Related Items (4)

The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale ⋮ Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations ⋮ A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks ⋮ A High Performance QDWH-SVD Solver Using Hardware Accelerators

Uses Software

• LAPACK
• ScaLAPACK
• BLAS
• MKL
• SBR Toolbox

This page was built for publication: High-performance bidiagonal reduction using tile algorithms on homogeneous multicore architectures