A domain decomposition solver for a parallel adaptive meshing paradigm

Abstract. We describe a domain decomposition (DD) algorithm for use in the parallel adaptive meshing paradigm of Bank and Holst [3, 4]. Our algorithm has low communication, makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. Numerical examples illustrate the effectiveness of the procedure. Key words. Domain decomposition, Bank–Holst algorithm, parallel adaptive grid generation. AMS subject classifications. 65N50, 65N30 1. Introduction. In this work, we describe a domain decomposition (DD) algorithm for use in the parallel adaptive meshing paradigm described in [3, 4]. The Bank-Holst paradigm provides a general approach to parallel adaptive meshing in which communication costs are kept low, and where sequential adaptive software (such as the software package pltmg used in this work) can be employed withou