Some Domain Decomposition and Iterative Refinement Algorithms for Elliptic Finite Element Problems

Some Domain Decomposition and Iterative Refinement Algorithms for Elliptic Finite Element Problems

Year:    1989

Journal of Computational Mathematics, Vol. 7 (1989), Iss. 2 : pp. 200–208

Abstract

In this contribution, we report on some results recently obtained in joint work with Maksymilian Dryja. We first study an additive variant of Schwarz' 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.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/1989-JCM-9470

Journal of Computational Mathematics, Vol. 7 (1989), Iss. 2 : pp. 200–208

Published online:    1989-01

AMS Subject Headings:   

Copyright:    COPYRIGHT: © Global Science Press

Pages:    9

Keywords: