Applying parallel computer systems to solve symmetric tridiagonal eigenvalue problems
An algorithm for the symmetric eigenvalue problem is given. It uses the advantages of the segmentation and the cyclic reduction methods. The proposed algorithm has a linear speed-up. Experimental results are given. These results are shown to achieve the expected performance. The relative efficiency of the proposed algorithm over the currently available algorithms is also discussed.
scientific article; zbMATH DE number 482219