Relatively robust representations of symmetric tridiagonals
From MaRDI portal
Publication:1976913
DOI10.1016/S0024-3795(99)00262-1zbMath0948.65026MaRDI QIDQ1976913
Beresford N. Parlett, Inderjit S. Dhillon
Publication date: 22 November 2000
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
algorithmeigenvalueserror analysisorthogonal eigenvectorssymmetric tridiagonal matrixtriangular factorizationdiagonal scaling matrices
Computational methods for sparse matrices (65F50) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
On sensitivity of Gauss-Christoffel quadrature, The $QR$ Steps with Perfect Shifts, Twisted factorization of a banded matrix, Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations, On the sensitivity of generators for the QR factorization of quasiseparable matrices with total nonpositivity, On computing quadrature-based bounds for the \(A\)-norm of the error in conjugate gradients, An algorithm for computing the eigenvalues of block companion matrices, Performance and accuracy of the basic closure algorithm of quadrature-based moment methods, Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations, Localization in Matrix Computations: Theory and Applications, Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices, Perturbation theory for the eigenvalues of factorised symmetric matrices, A note on generating finer‐grain parallelism in a representation tree, Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices, Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG, For tridiagonals \(T\) replace \(T\) with \(LDL\), An overview of relative \(\sin\Theta\) theorems for invariant subspaces of complex matrices, The orthogonal Rayleigh quotient iteration (ORQI) method, An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD, Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral sensitivity of products of bidiagonals
- Floating-point perturbations of Hermitian matrices
- Accurate singular values and differential qd algorithms
- Relative perturbation theory. III: More bounds on eigenvalue variation
- Fernando's solution to Wilkinson's problem: An application of double factorization
- Relative Perturbation Theory: I. Eigenvalue and Singular Value Variations
- Relative Perturbation Theory: II. Eigenspace and Singular Subspace Variations
- Reliable Computation of the Condition Number of a Tridiagonal Matrix in O(n) Time
- Orthogonal Eigenvectors and Relative Gaps
- Relative Perturbation Techniques for Singular Value Problems
- Computing Accurate Eigensystems of Scaled Diagonally Dominant Matrices
