An $O(N^2 )$ Method for Computing the Eigensystem of $N \times N$ Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
From MaRDI portal
Publication:3479447
DOI10.1137/0911010zbMath0701.65026OpenAlexW2021049357MaRDI QIDQ3479447
Publication date: 1990
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0911010
numerical exampleseigenvalueseigenvectorssymmetric tridiagonal matricesdivide and conquer algorithmupdating problem
Related Items (7)
The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I ⋮ A numerical comparison of methods for solving secular equations ⋮ Gradient-Finite Element Method for Nonlinear Neumann Problems ⋮ A unifying convergence analysis of second-order methods for secular equations ⋮ On the finite section method for computing exponentials of doubly-infinite skew-Hermitian matrices ⋮ Analysis of third-order methods for secular equations ⋮ Practical improvement of the divide-and-conquer eigenvalue algorithms
This page was built for publication: An $O(N^2 )$ Method for Computing the Eigensystem of $N \times N$ Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
