Journal of Computational Physics
On the use of composite grid schemes in computational aerodynamics
Computer Methods in Applied Mechanics and Engineering
A preconditioning technique for the efficient solution of problems with local grid refinement
Computer Methods in Applied Mechanics and Engineering
A self-adaptive formulation for the Euler/Navier—Stokes coupling
Computer Methods in Applied Mechanics and Engineering
Composite overlapping meshes for the solution of partial differential equations
Journal of Computational Physics
Domain decomposition algorithms with small overlap
SIAM Journal on Scientific Computing
SIAM Journal on Numerical Analysis
A Parallel Schwarz Method for a Convection-Diffusion Problem
SIAM Journal on Scientific Computing
Iterative Substructuring Preconditioners for Mortar Element Methods in Two Dimensions
SIAM Journal on Numerical Analysis
Overlapping Nonmatching Grid Mortar Element Methods for Elliptic Problems
SIAM Journal on Numerical Analysis
Maximum Norm Analysis of Overlapping Nonmatching Grid Discretizations of Elliptic Equations
SIAM Journal on Numerical Analysis
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Hi-index | 0.00 |
In this paper, theoretical results are described on the maximum norm stability and accuracy of finite difference discretizations of parabolic equations on overset nonmatching space-time grids. We consider parabolic equations containing a linear reaction term on a space-time domain Ω × [0, T] which is decomposed into an overlapping collection of cylindrical subregions of the form Ωl*×[0, T], for l = 1,..., p. Each of the space-time domains Ωl*[0, T] are assumed to be independently grided (in parallel) according to the local geometry and space-time regularity of the solution, yielding space-time grids with mesh parameters hl and τl. In particular, the different space-time grids need not match on the regions of overlap, and the time steps τl can differ from one grid to the next. We discretize the parabolic equation on each local grid by employing an explicit or implicit θ-scheme in time and a finite difference scheme in space satisfying a discrete maximum principle. The local discretizations are coupled together, without the use of Lagrange multipliers, by requiring the boundary values on each space-time grid to match a suitable interpolation of the solution on adjacent grids. The resulting global discretization yields a large system of coupled equations which can be solved by a parallel Schwarz iterative procedure requiring some communication between adjacent subregions. Our analysis employs a contraction mapping argument.Applications of the results are briefly indicated for reaction-diffusion equations with contractive terms and heterogeneous hyperbolic-parabolic approximations of parabolic equations.