A provably stable, non-iterative domain decomposition technique for the advection-diffusion equation
2016 (English)Report (Other academic)
We describe an efficient, non-iterative domain decomposition approach for the onedimensional advection–diffusion equation based on the Summation-by-Parts technique in both time and space. A fully discrete multidomain analogue of the continuous equation is formulated and a linear system consisting only of the solution components involved in the coupling between the subdomain interfaces is isolated. Once the coupling system is solved, the full solution is found by computing linear combinations of known vectors, weighted by the coupling components. Both stability and invertibility of the discrete scheme is proved using standard Summation-by-Parts procedures.
In a numerical study we show that perfunctory implementations of monodomain Summation-by-Parts based time integration can be improved upon significantly. Using our proposed method we are able to reduce execution time and memory footprint by up to 80% and 95% respectively. Similar improvements in execution time is shown also when compared against explicit Runge–Kutta time integration.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2016. , 24 p.
LiTH-MAT-R, ISSN 0348-2960 ; 2016:15
domain decomposition, stability, summation-by-parts
IdentifiersURN: urn:nbn:se:liu:diva-131596ISRN: LiTH-MAT-R--2016/15--SEOAI: oai:DiVA.org:liu-131596DiVA: diva2:974656