Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 1997 | Published
Journal Article Open

Schwarz Methods: To Symmetrize or Not to Symmetrize

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

HOLsiamjna97.pdf
Files (502.9 kB)
Name Size Download all
md5:62a739f15cab4a293e70afafa1e5f9fc
502.9 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 17, 2023