Abstract
The popular subspace iteration method for eigenproblems in science and engineering is reviewed briefly. Its suitability for execution on a parallel computer is then discussed. The algorithm was programmed for a shared memory symmetric multiprocessor system. The implementation of the algorithm on the parallel system is described. Timings, speed-ups and efficiencies for the parallel version of the program are given. It is concluded that this is a highly parallelizable algorithm, and high efficiency, in terms of processor utilization, was predicted and achieved.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
