Abstract

To solve boundary value problems with moving fronts or sharp variations, moving mesh methods can be used to achieve reasonable solution resolution with a fixed, moderate number of mesh points. Such meshes are obtained by solving a nonlinear elliptic differential equation in the steady case, and a nonlinear parabolic equation in the time-dependent case. To reduce the potential overhead of adaptive partial differential equation-(PDE) based mesh generation, we consider solving the mesh PDE by various alternating Schwarz domain decomposition methods. Convergence results are established for alternating iterations with classical and optimal transmission conditions on an arbitrary number of subdomains. An analysis of a colouring algorithm is given which allows the subdomains to be grouped for parallel computation. A first result is provided for the generation of time-dependent meshes by an alternating Schwarz algorithm on an arbitrary number of subdomains. The paper concludes with numerical experiments illustrating the relative contraction rates of the iterations discussed.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call