The research is devoted to a study of algorithms and methodologies for a variety of large, dense matrix eigenvalue problems. The techniques to be examined are based on the QR and Jacobi algorithms. A major part of the project is experimentation with parallel versions of these algorithms and their various extensions and generalizations. The experimentation will be done on an NCUBE multiprocessor

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Application #
8813493
Program Officer
S. Kamal Abdali
Project Start
Project End
Budget Start
1988-12-15
Budget End
1991-11-30
Support Year
Fiscal Year
1988
Total Cost
$158,800
Indirect Cost
Name
University of Minnesota Twin Cities
Department
Type
DUNS #
City
Minneapolis
State
MN
Country
United States
Zip Code
55455