A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Solving the symmetric tridiagonal eigenvalue problem on hypercubes
1993
Computers and Mathematics with Applications
Using the methods of bisection and inverse iteration respectively, this paper presents a parallel solver for the calculation of the eigenvalues of a real symmetric tridiagonal matrix on hypercube networks in O(ml logn) time using O(n2/logn) processors, where ml is the number of iterations. The corresponding eigenvectors problem can be solved in O(log n) time on the same networks.
doi:10.1016/0898-1221(93)90135-i
fatcat:3zkqh37eabdchktbypzyvjsyma