Some Domain Decomposition And Iterative Refinement Algorithems For Elliptic Finite Element Problems
Olof Widlund 11 Courant Institute of Mathematical Sciences, 251 Mercer Street, New York, N.Y.10012
Revised Online 2006-11-29
In this contribution, we report on some results recently obtained in joint work with Maksymilian Dryja. We first study an additive variant of Schewarz' alternating algorithm and establish that a fast method of this kind can be devised which is optimal in the number of conjugate gradient iterations required, to reach a certain tolerance, is independent of the mesh size as well as the of subregions.