Schwarz Methods: To Symmetrize or Not to Symmetrize
From MaRDI portal
Publication:4337461
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.
Recommendations
Cited in
(10)- Schwarz methods by domain truncation
- An H-multigrid method for hybrid high-order discretizations
- scientific article; zbMATH DE number 218048 (Why is no real title available?)
- The method of subspace corrections
- Subspace-by-subspace preconditioners for structured linear systems
- Multilevel Schwarz methods for elliptic partial differential equations
- Iterative linear solvers in a 2D radiation-hydrodynamics code: Methods and performance
- Interior boundary conditions in the Schwarz alternating method for the Trefftz method
- Auxiliary space preconditioners for a \(C^0\) finite element approximation of Hamilton-Jacobi-Bellman equations with cordes coefficients
- Schwarz preconditioned CG algorithm for the mortar finite element
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)