Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Convergence Analysis of a Domain Decomposition Paradigm

Journal Article · · Computing and Visualization in Science, vol. 11, no. 4, April 8, 2008, pp. 333-350
OSTI ID:936663

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 convergence is independent of both the global problem size N and the number of subdomains p used in the domain decomposition partition. Numerical examples illustrate the effectiveness of the procedure.

Research Organization:
Lawrence Livermore National Laboratory (LLNL), Livermore, CA
Sponsoring Organization:
USDOE
DOE Contract Number:
W-7405-ENG-48
OSTI ID:
936663
Report Number(s):
UCRL-JRNL-222227
Journal Information:
Computing and Visualization in Science, vol. 11, no. 4, April 8, 2008, pp. 333-350, Journal Name: Computing and Visualization in Science, vol. 11, no. 4, April 8, 2008, pp. 333-350 Journal Issue: 4 Vol. 11
Country of Publication:
United States
Language:
English

Similar Records

On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control
Journal Article · Tue Jul 26 00:00:00 EDT 2022 · IEEE Transactions on Automatic Control · OSTI ID:2333647

Convergence analysis of a balalncing domain decomposition method for solving interior Helmholtz equations
Journal Article · Tue Dec 09 23:00:00 EST 2008 · NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS · OSTI ID:945049

Domain decomposition solvers for PDEs : some basics, practical tools, and new developments.
Conference · Mon Nov 01 00:00:00 EDT 2010 · OSTI ID:1035646