Cache efficient bidiagonalization using BLAS 2.5 operators
DOI10.1145/1356052.1356055zbMATH Open1190.65056OpenAlexW2164326463WikidataQ113310617 ScholiaQ113310617MaRDI QIDQ3549233FDOQ3549233
Authors: Karen Marmol, G. W. Howell, James Demmel, Charles T. Fulton, S. Hammarling
Publication date: 21 December 2008
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1356052.1356055
Recommendations
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Analysis of algorithms and problem complexity (68Q25)
Cited In (7)
- BLIS: a framework for rapidly instantiating BLAS functionality
- Reliable generation of high-performance matrix algebra
- Increasing the performance of the Jacobi-Davidson method by blocking
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Restructuring the tridiagonal and bidiagonal QR algorithms for performance
- Cache optimization of a non-orthogonal joint diagonalization method
- The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
Uses Software
This page was built for publication: Cache efficient bidiagonalization using BLAS 2.5 operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549233)