Solving sparse symmetric generalized eigenvalue problems without factorization
Journal Article
·
· SIAM J. Numer. Anal.; (United States)
In this paper an iterative technique is discussed for finding the algebraic alloy smallest (or largest) eigenvalue of the generalized eigenvalue problem. A-lambda M, where A and M are real, symmetric, and M is positive definite. It is assumed that A and M are such that it is undesirable to factor the matrix A-sigma M for any value of sigma. It is proved that the algorithm is globally convergent, and that convergence is asymptotically quadratic. Finally, the modifications required in the algorithm to make it computationally feasible are discussed.
- Research Organization:
- Union Carbide Corp., Oak Ridge, TN
- DOE Contract Number:
- W-7405-ENG-26
- OSTI ID:
- 6151892
- Journal Information:
- SIAM J. Numer. Anal.; (United States), Journal Name: SIAM J. Numer. Anal.; (United States) Vol. 18:1; ISSN SJNAA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization
Solving Symmetric-Definite Quadratic $\lambda $-Matrix Problems without Factorization
Solving symmetric-definite quadratic lambda-matrix problems without factorization
Journal Article
·
Sat Jan 31 19:00:00 EST 1981
· SIAM Journal on Numerical Analysis
·
OSTI ID:5879482
Solving Symmetric-Definite Quadratic $\lambda $-Matrix Problems without Factorization
Journal Article
·
Sun Feb 28 19:00:00 EST 1982
· SIAM Journal on Scientific and Statistical Computing
·
OSTI ID:6654481
Solving symmetric-definite quadratic lambda-matrix problems without factorization
Journal Article
·
Sun Feb 28 19:00:00 EST 1982
· SIAM J. Sci. Stat. Comput.; (United States)
·
OSTI ID:6506875