Skip Navigation

The Computer Journal 1983 26(1):6-9; doi:10.1093/comjnl/26.1.6
© 1983 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (8)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Barlow, R. H.
Right arrow Articles by Shanehchi, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Parallel Multisection Applied to the Eigenvalue Problem

R. H. Barlow *, D. J. Evans * and J. Shanehchi *

Department of Computer Studies, Loughborough University of Technology, Loughborough, UK

This paper presents the results of some parallel multisection methods applied to the determination of eigenvalues of real symmetric tridiagonal matrices. The first method which is suitable for Single Instruction Multiple Data computers has been run on the ICL DAP. The size of the processing array limits only the number of eigenvalues that can be used in parallel, but not the size of the matrix. The second method uses Multiple Instruction Multiple Data parallelism and has been run on an asynchronous 4 processor system. This version allows faster processors to move ahead to sample further points without having to wait on slower processors.

Received November 1981.

* Department of Computer Studies, Loughborough University of Technology, Loughborough, Leicestershire, UK


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.