Solving the symmetric tridiagonal eigenvalue problem on hypercubes
From MaRDI portal
Publication:1802455
DOI10.1016/0898-1221(93)90135-IzbMath0801.65032MaRDI QIDQ1802455
Publication date: 4 December 1994
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
eigenvaluesparallel computationeigenvectorsinverse iterationbisectionhypercube networksreal symmetric tridiagonal matrix
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A cost-optimal parallel tridiagonal system solver
- Solving Tridiagonal Systems on Ensemble Architectures
- Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube
- Systolic designs for the calculation of the eigenvalues and eigenvectors of a symmetric tridiagonal matrix
- Parallel Processing with the Perfect Shuffle
- An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
- Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection
This page was built for publication: Solving the symmetric tridiagonal eigenvalue problem on hypercubes