Restructuring the Tridiagonal and Bidiagonal QR Algorithms for Performance
From MaRDI portal
Publication:5177205
DOI10.1145/2535371zbMath1322.65051OpenAlexW2002051125WikidataQ113310318 ScholiaQ113310318MaRDI QIDQ5177205
Gregorio Quintana-Ortí, Field G. van Zee, Robert A. van de Geijn
Publication date: 10 March 2015
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10234/123806
eigenvaluesSVDsingular valueshigh performancelinear algebraQR algorithmtridiagonalgivens rotationslibrariesEVDbidiagonal
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)
Related Items
Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions, The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale, Efficient algorithm for simultaneous reduction to the \(m\)-Hessenberg-triangular-triangular form, BLIS: A Framework for Rapidly Instantiating BLAS Functionality
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Blocked algorithms for the reduction to Hessenberg-triangular form revisited
- A new shift of the QL algorithm for irreducible symmetric tridiagonal matrices
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Current inverse iteration software can fail
- Accurate singular values and differential qd algorithms
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- On the correctness of some bisection-like parallel eigenvalue algorithms in floating point arithmetic
- An implementation of the dqds algorithm (positive case)
- Global convergence of tridiagonal QR algorithm with origin shifts
- Matrix Algorithms
- The Multishift QR Algorithm. Part I: Maintaining Well-Focused Shifts and Level 3 Performance
- The Multishift QR Algorithm. Part II: Aggressive Early Deflation
- dqds with Aggressive Early Deflation
- Understanding the $QR$ Algorithm
- Families of Algorithms for Reducing a Matrix to Condensed Form
- Accurate Singular Values of Bidiagonal Matrices
- New Fast and Accurate Jacobi SVD Algorithm. I
- New Fast and Accurate Jacobi SVD Algorithm. II
- Accumulating Householder transformations, revisited
- The design and implementation of the MRRR algorithm
- Anatomy of high-performance matrix multiplication
- Cache efficient bidiagonalization using BLAS 2.5 operators
- A Global Convergence Proof for Cyclic Jacobi Methods with Block Rotations
- Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
- The WY Representation for Products of Householder Matrices
- An extended set of FORTRAN basic linear algebra subprograms
- A Storage-Efficient $WY$ Representation for Products of Householder Transformations
- LAPACK Users' Guide
- Jacobi’s Method is More Accurate than QR
- Basic Linear Algebra Subprograms for Fortran Usage
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- Using Level 3 BLAS in Rotation-Based Algorithms
- Orthogonal Eigenvectors and Relative Gaps
- Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
