Schwarz Methods: To Symmetrize or Not to Symmetrize

From MaRDI portal
Publication:4337461

DOI10.1137/S0036142994275743zbMATH Open0880.65090arXiv1001.1362MaRDI QIDQ4337461FDOQ4337461


Authors: Stefan Vandewalle, Michael Holst Edit this on Wikidata


Publication date: 2 February 1998

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

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 non-variational and non-convergent 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 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.


Full work available at URL: https://arxiv.org/abs/1001.1362




Recommendations





Cited In (10)





This page was built for publication: Schwarz Methods: To Symmetrize or Not to Symmetrize

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337461)