A Generalized Eigensolver based on Smoothed Aggregation (GES-SA) for Initializing Smoothed Aggregation Multigrid (SA)
Consider the linear system Ax = b, where A is a large, sparse, real, symmetric, and positive definite matrix and b is a known vector. Solving this system for unknown vector x using a smoothed aggregation multigrid (SA) algorithm requires a characterization of the algebraically smooth error, meaning error that is poorly attenuated by the algorithm's relaxation process. For relaxation processes that are typically used in practice, algebraically smooth error corresponds to the near-nullspace of A. Therefore, having a good approximation to a minimal eigenvector is useful to characterize the algebraically smooth error when forming a linear SA solver. This paper discusses the details of a generalized eigensolver based on smoothed aggregation (GES-SA) that is designed to produce an approximation to a minimal eigenvector of A. GES-SA might be very useful as a standalone eigensolver for applications that desire an approximate minimal eigenvector, but the primary aim here is for GES-SA to produce an initial algebraically smooth component that may be used to either create a black-box SA solver or initiate the adaptive SA ({alpha}SA) process.
- Research Organization:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 940855
- Report Number(s):
- UCRL-JRNL-231442
- Journal Information:
- Numerical Linear Algebra with Applications, vol. 15, no. 2-3, January 15, 2008, pp. 249-269, Journal Name: Numerical Linear Algebra with Applications, vol. 15, no. 2-3, January 15, 2008, pp. 249-269 Journal Issue: 2-3 Vol. 15
- Country of Publication:
- United States
- Language:
- English
Similar Records
New Multigrid Solver Advances in TOPS
ML 3.0 smoothed aggregation user's guide.