Numerical methods on some structured matrix algebra problems
This proposal concerned the design, analysis, and implementation of serial and parallel algorithms for certain structured matrix algebra problems. It emphasized large order problems and so focused on methods that can be implemented efficiently on distributed-memory MIMD multiprocessors. Such machines supply the computing power and extensive memory demanded by the large order problems. We proposed to examine three classes of matrix algebra problems: the symmetric and nonsymmetric eigenvalue problems (especially the tridiagonal cases) and the solution of linear systems with specially structured coefficient matrices. As all of these are of practical interest, a major goal of this work was to translate our research in linear algebra into useful tools for use by the computational scientists interested in these and related applications. Thus, in addition to software specific to the linear algebra problems, we proposed to produce a programming paradigm and library to aid in the design and implementation of programs for distributed-memory MIMD computers. We now report on our progress on each of the problems and on the programming tools.
- Research Organization:
- Colorado Univ., Boulder, CO (United States). Dept. of Computer Science
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- FG03-94ER25215
- OSTI ID:
- 244504
- Report Number(s):
- DOE/ER/25215-T1; ON: DE96011195
- Resource Relation:
- Other Information: PBD: [1996]
- Country of Publication:
- United States
- Language:
- English
Similar Records
Reduction of a general matrix to tridiagonal form using a hypercube multiprocessor
Parallel solution of the symmetric tridiagonal eigenproblem