The design and implementation of the MRRR algorithm
From MaRDI portal
Publication:3549194
DOI10.1145/1186785.1186788zbMath1230.65046OpenAlexW2007244665WikidataQ56335058 ScholiaQ56335058MaRDI QIDQ3549194
Christof Vömel, Inderjit S. Dhillon, Beresford N. Parlett
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/1186785.1186788
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)
Related Items
The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale, Twisted factorization of a banded matrix, Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem, Fast Computation of Spectral Projectors of Banded Matrices, Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations, Localization in Matrix Computations: Theory and Applications, Look-ahead in the two-sided reduction to compact band forms for symmetric eigenvalue problems and the SVD, Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications, On tridiagonal matrices unitarily equivalent to normal matrices, A note on generating finer‐grain parallelism in a representation tree, Restructuring the Tridiagonal and Bidiagonal QR Algorithms for Performance, A spectral scheme for Kohn-Sham density functional theory of clusters, Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices, High-performance sampling of generic determinantal point processes, Subsampling Algorithms for Semidefinite Programming, Computing the Bidiagonal SVD Through an Associated Tridiagonal Eigenproblem
Uses Software
