Home

Implementation of the GMR Algorithm for Large Symmetric Eigenproblems

Jacek Kuczynski; Columbia University. Computer Science

Title:
Implementation of the GMR Algorithm for Large Symmetric Eigenproblems
Author(s):
Kuczynski, Jacek; Columbia University. Computer Science
Date:
Type:
Technical reports
Department:
Computer Science
Permanent URL:
Series:
Columbia University Computer Science Technical Reports
Part Number:
CUCS-198-85
Abstract:
We present an implementation of the generalized minimal residual (gmr) algorithm for finding an eigenpair of a large symmetric matrix. We report some numerical results for this algorithm and compare them with the results obtained for the Lanczos algorithm. A Fortran implementation of the gmr algorithm is included. The input of this subroutine is a matrix which has been partially reduced to tridiagonal form. Such a form can be obtained by the Lanczos process. The Fortran subroutine is also available via anonymous FTP as "pub/gmrval" on Columbia.edu [128.59.16.1] the Arpanet.
Subject(s):
Computer science
Item views:
126
Metadata:
text | xml

In Partnership with the Center for Digital Research and Scholarship at Columbia University Libraries/Information Services | Terms of Use