A domain partitioning algorithm without subdomain overlap for solving parabolic equations
Dirichlet problemserror estimatesmethod of alternating directionsNeumann problemsnon-iterative domain partitioning algorithmparabolic problems
Initial value problems for second-order parabolic equations (35K15) Iterative numerical methods for linear systems (65F10) Error bounds for initial value and initial-boundary value problems involving PDEs (65M15) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55)
A non-iterative domain partitioning algorithm in which subdomains do not overlap is considered for solving multi-dimensional parabolic problems. The algorithm is similar in structure to the method of alternating directions. Error estimates are obtained for the approximate solution in the case of the Dirichlet and Neumann problems.
- scientific article; zbMATH DE number 1225904
- scientific article; zbMATH DE number 947567
- scientific article; zbMATH DE number 1218986
- On the domain decomposition method with splitting in subdomains for solving parabolic problems
- Explicit-implicit domain decomposition methods for solving parabolic equations
- A domain splitting algorithm for parabolic problems
- An alternating explicit-implicit domain decomposition method for the parallel solution of parabolic equations
- The efficient S-DDM scheme and its analysis for solving parabolic equations
- Non-iterative parallel Schwarz algorithms based on overlapping domain decomposition for parabolic partial differential equations
- On some approaches in domain decomposition methods for solving parabolic problems
This page was built for publication: A domain partitioning algorithm without subdomain overlap for solving parabolic equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1311554)
