For tridiagonals \(T\) replace \(T\) with \(LDL\)

DOI10.1016/S0377-0427(00)00394-0zbMath0970.65032MaRDI QIDQ1591178

Beresford N. Parlett

Publication date: 7 October 2001

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

eigenvaluenumerical examplestriangular factorizationQD algorithmLDU factorizationclustered eigenvaluesorthogonal eigenvectores

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (2)

Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations ⋮ Unnamed Item

Uses Software

• LAPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analysis of the HR algorithm for computing the eigenvalues of a matrix
• Accurate singular values and differential qd algorithms
• The DQR algorithm, basic theory, convergence, and conditional stability
• Fernando's solution to Wilkinson's problem: An application of double factorization
• Relatively robust representations of symmetric tridiagonals
• An implementation of the dqds algorithm (positive case)
• Der Quotienten-Differenzen-Algorithmus
• An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
• Orthogonal Eigenvectors and Relative Gaps
• Relative Perturbation Techniques for Singular Value Problems
• Computing Accurate Eigensystems of Scaled Diagonally Dominant Matrices

This page was built for publication: For tridiagonals \(T\) replace \(T\) with \(LDL\)