A Domain Decomposition Solver for a Parallel Adaptive Meshing Paradigm
نویسندگان
چکیده
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.
منابع مشابه
Convergence Analysis of a Domain Decomposition Paradigm
We describe a domain decomposition algorithm for use in several variants of the parallel adaptive meshing paradigm of Bank and Holst. This 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. We show that for an idealized version of the algorithm, the rate of convergen...
متن کاملA Domain Decomposition for a Parallel Adaptive Meshing Algorithm
We describe a domain decomposition algorithm for use in the parallel adaptive meshing paradigm of Bank and Holst. 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. In [4, 5], we introduced a gene...
متن کاملMesh Regularization in Bank-Holst Parallel hp-Adaptive Meshing
In this work, we study mesh regularization in Bank-Holst parallel adaptive paradigm when adaptive enrichment in both h (geometry) and p (degree) is used. The paradigm was first introduced by Bank and Holst in [2, 3, 1] and later extended to hp-adaptivity in [5]. In detail, the paradigm can be summarized in the following steps. Step 1 Load Balancing: The problem is solved on a coarse mesh, and a...
متن کاملA Comparison of Additive Schwarz Preconditioners for Parallel Adaptive Finite Elements
The Bank-Holst parallel adaptive meshing paradigm [2, 3, 1] is utilised to solve (1) in a combination of domain decomposition and adaptivity. It can be summarised as follows: Step I Mesh Partition: Starting with a coarse mesh TH , the domain is partitioned into non-overlapping subdomains: Ω = ∪pi=1Ωi. Step II Adaptive Meshing: Each processor i is provided with TH and instructed to sequentially ...
متن کاملCoupling parallel adaptive mesh refinement with a nonoverlapping domain decomposition solver
We study the effect of adaptive mesh refinement on a parallel domain decomposition solver of a linear system of algebraic equations. These concepts need to be combined within a parallel adaptive finite element software. A prototype implementation is presented for this purpose. It uses adaptive mesh refinement with one level of hanging nodes. Two and three-level versions of the Balancing Domain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 26 شماره
صفحات -
تاریخ انتشار 2004