An Iterative Substructuring Algorithm for Problems in Three Dimensions

Conference · Mon May 06 04:00:00 EDT 1991

OSTI ID:5633125

Smith, Barry F. ^[1]

---

1. Argonne National Laboratory (ANL), Argonne, IL (United States)

In domain decomposition algorithms with more than a few subdomains, there is a crucial need for a mechanism to provide for global communication of information at each step of the iterative process. The convergence rate will decay rapidly with an increasing number of subdomains if communication is only between neighboring subdomains. For iterative substructuring algorithms (those domain decomposition algorithms that use nonoverlapping subdomains), the method that provides for good global communication in two dimensions does not work well for problems in three dimensions. In this paper we present an alternative approach for providing global communication that works well in three dimensions. Sample theoretical and numerical results are presented.

• Research Organization: Argonne National Laboratory (ANL), Argonne, IL (United States)
• Sponsoring Organization: USDOE Office of Science (SC)
• DOE Contract Number: W-31109-ENG-38
• OSTI ID: 5633125
• Report Number(s): ANL/CP-73224; CONF-9105217--1; ON: DE91014388
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING
99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
BOUNDARY-VALUE PROBLEMS
CONVERGENCE
DIRICHLET PROBLEM
ITERATIVE METHODS
MATHEMATICAL LOGIC
THREE-DIMENSIONAL CALCULATIONS