Orthogonal Eigenvectors and Relative Gaps
From MaRDI portal
Recommendations
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- scientific article; zbMATH DE number 3930234
- For tridiagonals \(T\) replace \(T\) with \(LDL\)
- scientific article; zbMATH DE number 879770
- An Orthogonal High Relative Accuracy Algorithm for the Symmetric Eigenproblem
Cited in
(37)- Fernando's solution to Wilkinson's problem: An application of double factorization
- Accurate ordering of eigenvectors and singular vectors without eigenvalues and singular values.
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- For tridiagonals \(T\) replace \(T\) with \(LDL\)
- A periodic qd-type reduction for computing eigenvalues of structured matrix products to high relative accuracy
- Computing singular value decompositions of parameterized matrices with total nonpositivity to high relative accuracy
- The orthogonal Rayleigh quotient iteration (ORQI) method
- An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD
- Relatively robust representations of symmetric tridiagonals
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
- Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations
- A shift strategy for superquadratic convergence in the dqds algorithm for singular values
- Twisted factorization of a banded matrix
- Evaluation of small elements of the eigenvectors of certain symmetric tridiagonal matrices with high relative accuracy
- A fast symmetric SVD algorithm for square Hankel matrices
- Simulation of laser propagation in a plasma with a frequency wave equation
- On sensitivity of Gauss-Christoffel quadrature
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- A twisted factorization method for complex symmetric tridiagonal eigenvalue decomposition
- Structured Eigenvalue Problems
- Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations
- The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
- scientific article; zbMATH DE number 879770 (Why is no real title available?)
- A note on generating finer‐grain parallelism in a representation tree
- Subsampling algorithms for semidefinite programming
- Restructuring the tridiagonal and bidiagonal QR algorithms for performance
- Fast linear inversion for highly overdetermined inverse scattering problems
- The Godunov-inverse iteration: A fast and accurate solution to the symmetric tridiagonal eigenvalue problem
- 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
- A note on the dqds algorithm with Rutishauser's shift for singular values
- Computing eigenvalues of quasi-rational Said-Ball-Vandermonde matrices
- Estimation of spectral gaps for sparse symmetric matrices
- On computing the eigenvectors of a class of structured matrices
- Rigorous proof of cubic convergence for the dqds algorithm for singular values
- Superquadratic convergence of DLASQ for computing matrix singular values
This page was built for publication: Orthogonal Eigenvectors and Relative Gaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650963)
