Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube
From MaRDI portal
Publication:3485794
DOI10.1137/0911013zbMath0705.65026OpenAlexW1987564325MaRDI QIDQ3485794
E. R. Jessup, Ilse C. F. Ipsen
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/0911013
eigenvalueseigenvectorsinverse iterationsymmetric tridiagonal matrixbisectionmultisectionNumerical resultsCuppen's methoddistributed memory hypercube multiprocessor
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)
Related Items
A fast and stable parallel QR algorithm for symmetric tridiagonal matrices, Inverse iteration method with multiple cyclotomically shifted parameters, A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix, A case against a divide and conquer approach to the nonsymmetric eigenvalue problem, An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures, Homotopy-Determinant Algorithm for Solving Nonsymmetric Eigenvalue Problems, Solving the symmetric tridiagonal eigenvalue problem on hypercubes, The orthogonal Rayleigh quotient iteration (ORQI) method, PARALLEL ALGORITHMS TO COMPUTE THE EIGENVALUES AND EIGENVECTORS OFSYMMETRIC TOEPLITZ MATRICES∗
Uses Software
