Abstract
The use of implicit methods for numerical time integration typically generates very large systems of equations, often too large to fit in memory. To address this it is necessary to investigate ways to reduce the sizes of the involved linear systems. We describe a domain decomposition approach for the advection–diffusion equation, based on the Summation-by-Parts technique in both time and space. The domain is partitioned into non-overlapping subdomains. A linear system consisting only of interface components is isolated by solving independent subdomain-sized problems. The full solution is then computed in terms of the interface components. The Summation-by-Parts technique provides a solid theoretical framework in which we can mimic the continuous energy method, allowing us to prove both stability and invertibility of the scheme. In a numerical study we show that single-domain implementations of Summation-by-Parts based time integration can be improved upon significantly. Using our proposed method we are able to compute solutions for grid resolutions that cannot be handled efficiently using a single-domain formulation. An order of magnitude speed-up is observed, both compared to a single-domain formulation and to explicit Runge–Kutta time integration.
Original language | English |
---|---|
Pages (from-to) | 755-774 |
Number of pages | 20 |
Journal | Journal of Scientific Computing |
Volume | 77 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1 Nov 2018 |
Externally published | Yes |
Keywords
- Domain decomposition
- Finite difference methods
- Partial differential equations
- Stability
- Summation-by-Parts
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Numerical Analysis
- General Engineering
- Computational Theory and Mathematics
- Computational Mathematics
- Applied Mathematics