Referenced Items are not available for this document.
The goal of the PRISM project is the development of infrastructure and algorithms for the parallel solution of eigenvalue problems. We are currently investigating a complete eigensolver based on the invariant Subspace Decomposition Algorithm for dense symmetric matrices (SYISDA). After briefly reviewing the SYISDA approach, we discuss the algorithmic highlights of a distributed-memory implementation of an eigensolver based on this approach. These include a fast matrix-matrix multiplication algorithm, a new approach to parallel band reduction and tridiagonalization, and a harness for coordinating the divide-and-conquer parallelism in the problem. We also present performance results of these kernels as well as the overall SYISDA implementation on the Intel Touchstone Delta prototype and the IBM SP/1
Published in:
Scalable Parallel Libraries Conference, 1993., Proceedings of the
Date of Conference: 6-8 Oct 1993
- Page(s):
- 123 - 131
- Meeting Date :
- 06 Oct 1993-08 Oct 1993
- Print ISBN:
- 0-8186-4980-1
- INSPEC Accession Number:
- 4818775
- Conference Location :
- Mississippi State, MS
- Digital Object Identifier :
- 10.1109/SPLC.1993.365575
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
