LBNL-42828

Parallel efficiency of the Lanczos method for eigenvalue problems

Kesheng Wu and Horst Simon
December, 1998

Abstract

Two of the commonly used versions of the Lanczos method for eigenvalues problems are the shift-and-invert Lanczos method and the restarted Lanczos method. In this paper, we will address two questions, is the shift-and-invert Lanczos method a viable option on massively parallel machines and which one is more appropriate for a given eigenvalue problem?

full text in postscript

slides of the talk given at SIAM Parallel Processing 99

More research work by John Wu
Bitmap Index
Connected Component Labeling
Eigenvalue Computation
Inforamtion available elsewhere on the web
CiteSeer
DBLP
Google Scholar
Contact us
Disclaimers

John Wu