Technical reports:
Implementation of the GMR Algorithm for Large Symmetric Eigenproblems
Jacek Kuczynski
Downloads:
- Title:
- Implementation of the GMR Algorithm for Large Symmetric Eigenproblems
- Author(s):
- Kuczynski, Jacek
- Date:
- 1985
- Type:
- Technical reports
- Department:
- Computer Science
- Permanent URL:
- http://hdl.handle.net/10022/AC:P:11735
- Series:
- Columbia University Computer Science Technical Reports
- Part Number:
- CUCS-198-85
- Publisher:
- Department of Computer Science, Columbia University
- Publisher Location:
- New York
- 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:
- 83