A new algorithm based on factorization for heterogeneous domain decomposition

From MaRDI portal



Abstract: Often computational models are too expensive to be solved in the entire domain of simulation, and a cheaper model would suffice away from the main zone of interest. We present for the concrete example of an evolution problem of advection reaction diffusion type a heterogeneous domain decomposition algorithm which allows us to recover a solution that is very close to the solution of the fully viscous problem, but solves only an inviscid problem in parts of the domain. Our new algorithm is based on the factorization of the underlying differential operator, and we therefore call it factorization algorithm. We give a detailed error analysis, and show that we can obtain approximations in the viscous region which are much closer to the viscous solution in the entire domain of simulation than approximations obtained by other heterogeneous domain decomposition algorithms from the literature.


The authors present a new algorithm based on factorization for heterogeneous domain decomposition. They first provide their new factorization algorithm for a time-dependent model advection-reaction-diffusion problem in \(d\) spacial dimensions. A detailed analysis of the new factorization algorithm in one spatial dimension is given as well as a proof of asymptotic error estimates when the viscosity is becoming small. Numerical experiments are given to show that in one spatial dimension the theoretical error estimates are sharp and numerical experiments are given in two spatial dimensions to illustrate their new factorization algorithm works beyond the one-dimensional case.



Cites work



Describes a project that uses

Uses Software






This page was built for publication: A new algorithm based on factorization for heterogeneous domain decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312190)