@Article{JCM-7-2,
author = {},
title = {Some Domain Decomposition and Iterative Refinement Algorithms for Elliptic Finite Element Problems},
journal = {Journal of Computational Mathematics},
year = {1989},
volume = {7},
number = {2},
pages = {200--208},
abstract = {<p style="text-align: justify;">In this contribution, we report on some results recently obtained in joint work with Maksymilian Dryja. We first study an additive variant of Schwarz&#39; alternating algorithm and establish that a fast method of this kind can be devised which is optimal in the sense that the number of conjugate gradient iterations required, to reach a certain tolerance, is independent of the mesh size as well as the number of subregions.</p>},
issn = {1991-7139},
doi = {https://doi.org/1989-JCM-9470},
url = {https://global-sci.com/article/86098/some-domain-decomposition-and-iterative-refinement-algorithms-for-elliptic-finite-element-problems}
}