Parallel domain decomposition procedures of improved D–D type for parabolic problems
✍ Scribed by Danping Yang
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 808 KB
- Volume
- 233
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
✦ Synopsis
Two parallel domain decomposition procedures for solving initial-boundary value problems of parabolic partial differential equations are proposed. One is the extended D-D type algorithm, which extends the explicit/implicit conservative Galerkin domain decomposition procedures, given in [5], from a rectangle domain and its decomposition that consisted of a stripe of sub-rectangles into a general domain and its general decomposition with a net-like structure. An almost optimal error estimate, without the factor H -1/2 given in Dawson-Dupont's error estimate, is proved. Another is the parallel domain decomposition algorithm of improved D-D type, in which an additional term is introduced to produce an approximation of an optimal error accuracy in L 2 -norm.
📜 SIMILAR VOLUMES
## Abstract This Letter, proposes an algebraic domain decomposition algorithm (ADDA) to solve large sparse linear systems derived from the vector finite‐element method (FEM) for 3D electromagnetic field problems. The proposed method segments the problem into several smaller pieces, solves each subp