“…While DD methods have been applied successfully to a large variety of nonlinear problems (see e.g. [27,3] for porous media flow problems, [45,1] for problems from physiology, [26] for nonlinear parabolic systems, and [14] for the compressible Navier-Stokes equations), comparably much less has been written about the analysis of DD methods for nonlinear PDEs; see [10,38,37,36,16,6,46] for the steady case, and [17,23] for evolution problems.…”
Moving mesh methods based on the equidistribution principle are powerful techniques for the space-time adaptive solution of evolution problems. Solving the resulting coupled system of equations, namely the original PDE and the mesh PDE, however, is challenging in parallel. Recently several Schwarz domain decomposition algorithms were proposed for this task and analyzed at the continuous level. However, after discretization, the resulting problems may not even be well posed, so the discrete algorithms requires a different analysis, which is the subject of this paper. We prove that when the number of grid points is large enough, the classical parallel and alternating Schwarz methods converge to the unique monodomain solution. Thus, such methods can be used in place of Newton's method, which can suffer from convergence difficulties for challenging problems. The analysis for the nonlinear domain decomposition algorithms is based on M-function theory and is valid for an arbitrary number of subdomains. An asymptotic convergence rate is provided and numerical experiments illustrate the results.
“…While DD methods have been applied successfully to a large variety of nonlinear problems (see e.g. [27,3] for porous media flow problems, [45,1] for problems from physiology, [26] for nonlinear parabolic systems, and [14] for the compressible Navier-Stokes equations), comparably much less has been written about the analysis of DD methods for nonlinear PDEs; see [10,38,37,36,16,6,46] for the steady case, and [17,23] for evolution problems.…”
Moving mesh methods based on the equidistribution principle are powerful techniques for the space-time adaptive solution of evolution problems. Solving the resulting coupled system of equations, namely the original PDE and the mesh PDE, however, is challenging in parallel. Recently several Schwarz domain decomposition algorithms were proposed for this task and analyzed at the continuous level. However, after discretization, the resulting problems may not even be well posed, so the discrete algorithms requires a different analysis, which is the subject of this paper. We prove that when the number of grid points is large enough, the classical parallel and alternating Schwarz methods converge to the unique monodomain solution. Thus, such methods can be used in place of Newton's method, which can suffer from convergence difficulties for challenging problems. The analysis for the nonlinear domain decomposition algorithms is based on M-function theory and is valid for an arbitrary number of subdomains. An asymptotic convergence rate is provided and numerical experiments illustrate the results.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.