Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices

DOI10.1016/j.laa.2003.12.028zbMath1055.65048OpenAlexW2107785791MaRDI QIDQ1434380

Inderjit S. Dhillon, Beresford N. Parlett

Publication date: 4 August 2004

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2003.12.028

zbMATH Keywords

eigenvectors orthogonality symmetric tridiagonal matrix high relative accuracy clustered eigenvalues relatively robust representations

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

On computing the eigenvectors of a class of structured matrices, Iterative refinement for symmetric eigenvalue decomposition, On sensitivity of Gauss-Christoffel quadrature, The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale, Twisted factorization of a banded matrix, Low-pass filter design using locally weighted polynomial regression and discrete prolate spheroidal sequences, Reliable root detection with the qd-algorithm: When Bernoulli, Hadamard and Rutishauser cooperate, Solving dense generalized eigenproblems on multi-threaded architectures, New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem, Vectorization of a Thread-Parallel Jacobi Singular Value Decomposition Method, Coupling bounds for approximating birth-death processes by truncation, On computing modified moments for half-range Hermite weights, Subspace choices for the Celis-Dennis-Tapia problem, Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations, Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research), Parallel block tridiagonalization of real symmetric matrices, Numerical solution of linear eigenvalue problems, A note on the dqds algorithm with Rutishauser's shift for singular values, The LAPW Method with Eigendecomposition Based on the Hari--Zimmermann Generalized Hyperbolic SVD, On Computing Eigenvectors of Symmetric Tridiagonal Matrices, Rigorous proof of cubic convergence for the dqds algorithm for singular values, A fast symmetric SVD algorithm for square Hankel matrices, The eigenvalues of \(r\)-periodic tridiagonal matrices by factorization of some recursive sequences, A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix, A shift strategy for superquadratic convergence in the dqds algorithm for singular values, Computing eigenvalues of normal matrices via complex symmetric matrices, 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, A Lanczos bidiagonalization algorithm for Hankel matrices, A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices, Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices, Preconditioners for Saddle Point Systems with Trace Constraints Coupling 2D and 1D Domains, Current inverse iteration software can fail, Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues, Computing the Bidiagonal SVD Through an Associated Tridiagonal Eigenproblem, A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem

Uses Software

LAPACK

Cites Work