Orthogonal Eigenvectors and Relative Gaps
From MaRDI portal
Publication:4650963
DOI10.1137/S0895479800370111zbMath1068.65046MaRDI QIDQ4650963
Inderjit S. Dhillon, Beresford N. Parlett
Publication date: 21 February 2005
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
comparison of methodsnumerical exampleseigenvectorsorthogonalityinverse iterationsymmetric tridiagonal matrixbidiagonal factorization\(qd\)-type algorithmalgorithm GETvec
Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)
Related Items
On computing the eigenvectors of a class of structured matrices ⋮ Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions ⋮ On sensitivity of Gauss-Christoffel quadrature ⋮ The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale ⋮ A periodic qd-type reduction for computing eigenvalues of structured matrix products to high relative accuracy ⋮ Twisted factorization of a banded matrix ⋮ Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations ⋮ Vectorization of a Thread-Parallel Jacobi Singular Value Decomposition Method ⋮ On a special basis of approximate eigenvectors with local supports for an isolated narrow cluster of eigenvalues of a symmetric tridiagonal matrix ⋮ Computing singular value decompositions of parameterized matrices with total nonpositivity to high relative accuracy ⋮ A note on the dqds algorithm with Rutishauser's shift for singular values ⋮ Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices ⋮ Rigorous proof of cubic convergence for the dqds algorithm for singular values ⋮ Relatively robust representations of symmetric tridiagonals ⋮ A fast symmetric SVD algorithm for square Hankel matrices ⋮ A shift strategy for superquadratic convergence in the dqds algorithm for singular values ⋮ Simulation of laser propagation in a plasma with a frequency wave equation ⋮ A note on generating finer‐grain parallelism in a representation tree ⋮ Superquadratic convergence of DLASQ for computing matrix singular values ⋮ Restructuring the Tridiagonal and Bidiagonal QR Algorithms for Performance ⋮ Structured Eigenvalue Problems ⋮ Fast linear inversion for highly overdetermined inverse scattering problems ⋮ Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices ⋮ Subsampling Algorithms for Semidefinite Programming ⋮ For tridiagonals \(T\) replace \(T\) with \(LDL\) ⋮ The orthogonal Rayleigh quotient iteration (ORQI) method ⋮ An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD ⋮ A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
