ACM Home Page
Please provide us with feedback. Feedback
Solution of large, dense symmetric generalized eigenvalue problems using secondary storage
Full text PdfPdf (1.12 MB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 14 ,  Issue 3  (September 1988) table of contents
Pages: 241 - 256  
Year of Publication: 1988
ISSN:0098-3500
Authors
Roger G. Grimes  Boeing Computer Services, Seattle, WA
Horst D. Simon  NASA Ames Research Center, Moffett Field, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 31,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/44128.44130
What is a DOI?

ABSTRACT

This paper describes a new implementation of algorithms for solving large, dense symmetric eigen-problems AX = BX&Lgr;, where the matrices A and B are too large to fit in the central memory of the computer. Here A is assumed to be symmetric, and B symmetric positive definite. A combination of block Cholesky and block Householder transformations are used to reduce the problem to a symmetric banded eigenproblem whose eigenvalues can be computed in central memory. Inverse iteration is applied to the banded matrix to compute selected eigenvectors, which are then transformed back to eigenvectors of the original problem. This method is especially suitable for the solution of large eigenproblems arising in quantum physics, using a vector supercomputer with fast secondary storage device such as the Cray X-MP with SSD. Some numerical results demonstrate the efficiency of the new implementation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ARMSTRONG, J. Optimization of Householder Trans{ormations, Part I: Linear Least Squares. CONVEX Computer Corp., 701 N. Plano Rd., Richardson, TX 75081.
 
2
 
3
BUNCH, J., DONGARRA, J., MOLER, C., AND STEWART, G. LINPACK User's Guide. SIAM Philadelphia, 1979.
 
4
CUPPEN, J.J. A divide and conquer method for the symmetric tridiagonal eigenvalue problem. Numer. Math. 36 (1981) 177-195.
 
5
 
6
DONGARRA, J. J., DU CROZ, J., HAMMARLING, S., AND HANSON, R. Extended set of Fortran basic linear algebra subprograms. Argonne National Lab. Rep. ANL-MSC-TM-41 (Revision 3), 1986.
 
7
GARBOW, B. S., BOYLE, J. M., DONGARRA, J. J., AND MOLER, C. B. Matrix eigensystem routines--EISPACK guide extension. In Lecture Notes in Computer Sciences, Vol. 51, Springer- Verlag, Berlin, 1977.
 
8
GRIMES, R. Solving systems of large dense linear equations. Rep. ETA-TR-44, Boeing Computer Services, Seattle, Wash., Feb. 1987; submitted to Supercomputing and Its Applications.
 
9
 
10
GRIMES, R., AND SIMON, H. Subroutines for the out-of-core solution of generalized symmetric eigenvalue problems. Rep. ETA-TR-54, Boeing Computer Services, 1987.
11
 
12
KAUFMAN, L., DONGARRA, J., AND HAMMARLING, S. Squeezing the most out of eigenvalue solvers on high-performance computers. Linear Algebra Appl. 77 (1986), 113-136.
13
 
14
 
15
 
16
SMITH, B. T., BOYLE, J. M., DONGARRA, J. J., GARBOW, B. S., IKEBE, Y., KLEMA, V. C., AND MOLER, C.B. Matrix eigensystem routines--EISPACK guide. In Lecture Notes in Computer Sciences, Vol. 6, Springer-Verlag, Berlin, 1976.
 
17
VectorPak Users Manual. Boeing Computer Services Doc. 20460-0501-R1, 1987.



REVIEW

"Andy Roy Magid : Reviewer"

A large, dense, and symmetric generalized eigenproblem is considered: Ax = Bx&Lgr;, where A and B are symmetric n × n matrices too large to fit into core memory and   more...

Collaborative Colleagues:
Roger G. Grimes: colleagues
Horst D. Simon: colleagues