Schwarz Methods: To Symmetrize or Not to Symmetrize
- Creators
- Holst, Michael
- Vandewalle, Stefan
Abstract
A preconditioning theory is presented which establishes sufficient conditions for multiplicative and additive Schwarz algorithms to yield self-adjoint positive definite preconditioners. It allows for the analysis and use of nonvariational and nonconvergent linear methods as preconditioners for conjugate gradient methods, and it is applied to domain decomposition and multigrid. It is illustrated why symmetrizing may be a bad idea for linear methods. It is conjectured that enforcing minimal symmetry achieves the best results when combined with conjugate gradient acceleration. Also, it is shown that the absence of symmetry in the linear preconditioner is advantageous when the linear method is accelerated by using the Bi-CGstab method. Numerical examples are presented for two test problems which illustrate the theory and conjectures.
Additional Information
© 1997 Society for Industrial and Applied Mathematics. Received by the editors October 17, 1994; accepted for publication (in revised form) June 20, 1995. This research was supported in part by NSF cooperative agreement CCR-9120008. The authors thank the referees and Olof Widlund for several helpful comments.Attached Files
Published - HOLsiamjna97.pdf
Files
Name | Size | Download all |
---|---|---|
md5:62a739f15cab4a293e70afafa1e5f9fc
|
502.9 kB | Preview Download |
Additional details
- Eprint ID
- 12608
- Resolver ID
- CaltechAUTHORS:HOLsiamjna97
- CCR-9120008
- National Science Foundation
- Created
-
2008-12-15Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field