On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
From MaRDI portal
Publication:4377488
DOI10.1137/S0895479895294484zbMATH Open0897.65028MaRDI QIDQ4377488FDOQ4377488
Authors:
Publication date: 9 February 1998
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3930234
- Computing the eigenvectors of nonsymmetric tridiagonal matrices
- scientific article; zbMATH DE number 1910736
- An $O(N^2 )$ Method for Computing the Eigensystem of $N \times N$ Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
- Reliable Computation of the Condition Number of a Tridiagonal Matrix in O(n) Time
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cited In (25)
- Current inverse iteration software can fail
- The numerical solution of a birth-death process arising in multimedia synchronization
- Ramanujan theta functions and birth and death processes
- On Computing Eigenvectors of Symmetric Tridiagonal Matrices
- Computing the eigenvectors of nonsymmetric tridiagonal matrices
- A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
- Inner deflation for symmetric tridiagonal matrices
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- The Godunov-inverse iteration: A fast and accurate solution to the symmetric tridiagonal eigenvalue problem
- Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations
- Basis of Eigenvectors and Principal Vectors Associated with Gauss--Seidel Matrix of A = tridiag [-1 2 -1]
- Computation of exact inertia and inclusions of eigenvalues (singular values) of tridiagonal (bidiagonal) matrices
- Computation of an eigenvector of a symmetric tridiagonal matrix
- Title not available (Why is that?)
- Birth and Death (BDP) Process Models with Applications
- The orthogonal Rayleigh quotient iteration (ORQI) method
- Accurate ordering of eigenvectors and singular vectors without eigenvalues and singular values.
- Fernando's solution to Wilkinson's problem: An application of double factorization
- On a special basis of approximate eigenvectors with local supports for an isolated narrow cluster of eigenvalues of a symmetric tridiagonal matrix
- An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD
- Title not available (Why is that?)
- Fluid queues driven by birth and death processes with quadratic rates
- Twisted factorization of a banded matrix
- A fast SVD for multilevel block Hankel matrices with minimal memory storage
- An efficient method for obtaining the eigenvectors of a ring system
This page was built for publication: On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377488)