Domain decomposition methods are widely used to solve in parallel large linear systems of equations arising in the discretization of partial differential equations. Optimized Schwarz Methods (OSM) have been the subject of intense research because they lead to algorithms that converge very quickly. The analysis of OSM has been a very challenging research area and there are currently no general proofs of convergence for the optimized choices of the Robin parameter in the case of overlap. In this article, we apply a proof technique developed for the analysis of Schwarz-type algorithms using matrix analysis techniques and specifically using properties of matrix splittings, to the Optimized Schwarz algorithms. We thus obtain new general convergence results, but they apply only to large Robin parameters, which may not be the optimal ones. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Loisel, S., & Szyld, D. B. (2009). On the convergence of optimized schwarz methods by way of matrix analysis. In Lecture Notes in Computational Science and Engineering (Vol. 70 LNCSE, pp. 363–370). https://doi.org/10.1007/978-3-642-02677-5_41
Mendeley helps you to discover research relevant for your work.