Highly indefinite multigrid for eigenvalue problems
Conference
·
OSTI ID:440734
Eigenvalue problems are extremely important in understanding dynamic processes such as vibrations and control systems. Large scale eigenvalue problems can be very difficult to solve, especially if a large number of eigenvalues and the corresponding eigenvectors need to be computed. For solving this problem a multigrid preconditioned algorithm is presented in {open_quotes}The Davidson Algorithm, preconditioning and misconvergence{close_quotes}. Another approach for solving eigenvalue problems is by developing efficient solutions for highly indefinite problems. In this paper we concentrate on the use of new highly indefinite multigrid algorithms for the eigenvalue problem.
- Research Organization:
- Front Range Scientific Computations, Inc., Lakewood, CO (United States)
- OSTI ID:
- 440734
- Report Number(s):
- CONF-9604167--Vol.2; ON: DE96015307
- Country of Publication:
- United States
- Language:
- English
Similar Records
Overlapping domain decomposition preconditioners for the generalized Davidson method for the eigenvalue problem
Preconditioned iterations to calculate extreme eigenvalues
Preconditioned Krylov subspace methods for eigenvalue problems
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:223845
Preconditioned iterations to calculate extreme eigenvalues
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:223844
Preconditioned Krylov subspace methods for eigenvalue problems
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:433397