Parallel Computation of Eigensystems for Symmetric and      non-Symmetric Matrices
{'Code': '05010200', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'S. Kamal Abdali', 'PO_EMAI': None, 'PO_PHON': None}
The investigation of Jacobi-type methods for the solution of the                algebraic eigenproblem on parallel architectures is proposed here.              Both symmetric and non-symmetric problems are considered, as is the             generalized problem.  Interest in this general area of numerical linear         algebra has increased markedly since parallel machines appeared on the          market; these machines already play an important role in scientific             computing, and parallel algorithms present an important challenge.                                                                                              Jacobi-type algorithms are ideally suited for a parallel multiprocessor         environment; recently they have been found competitive with standard            serial methods on both shared memory multiprocessors and serial vector          machines for the singular value problem.  New approaches are shown              which lead to an extension to the eigenvalue problem for both symmetric         and non-symmetric matrices.                                                                                                                                     One-sided Jacobi methods are introduced here, and compared with block           Jacobi                                                                          implementations.  These methods may be regarded as a factored form of a         sequence of similarity transformations which may be extended to non-            unitary transformations.                                                                                                                                        Probably the most important goal of the project is the experimental             comparison of Jacobi methods with other methods which have become               standard for serial computation on both the symmetric and non-symmetric         eigenvalue/vector problems.^R                                                   JUSTIFICATION
{'FirstName': 'Patricia', 'LastName': 'Eberlein', 'PI_MID_INIT': 'J', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Patricia J Eberlein', 'EmailAddress': None, 'NSF_ID': '000163376', 'StartDate': '09/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'SUNY at Buffalo', 'CityName': 'AMHERST', 'ZipCode': '142282577', 'PhoneNumber': '7166452634', 'StreetAddress': '520 LEE ENTRANCE STE 211', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'New York', 'StateCode': 'NY', 'CONGRESSDISTRICT': '26', 'CONGRESS_DISTRICT_ORG': 'NY26', 'ORG_UEI_NUM': 'LMCJKRFW5R81', 'ORG_LGL_BUS_NAME': 'RESEARCH FOUNDATION FOR THE STATE UNIVERSITY OF NEW YORK, THE', 'ORG_PRNT_UEI_NUM': 'GMZUKXFDJMA9'}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
[{'Code': '2865', 'Text': 'NUMERIC, SYMBOLIC & GEO COMPUT'}, {'Code': '9145', 'Text': 'SPECIAL PROGRAMS-RESERVE'}]
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8812521.xml'}