2018
DOI: 10.1016/j.amc.2018.03.006
|View full text |Cite
|
Sign up to set email alerts
|

Efficient boundary corrected Strang splitting

Abstract: Strang splitting is a well established tool for the numerical integration of evolution equations. It allows the application of tailored integrators for different parts of the vector field. However, it is also prone to order reduction in the case of non-trivial boundary conditions. This order reduction can be remedied by correcting the boundary values of the intermediate splitting step. In this paper, three different approaches for constructing such a correction in the case of inhomogeneous Dirichlet, Neumann, … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 13 publications
0
9
0
Order By: Relevance
“…On the other hand, applying numerical differentiation to get local order 3 causes less problems with ACR than with EO. Moreover, ACR has the advantage that you do not have to worry about the calculation of q which cost, although small according to [14], has not even been included for the comparisons here.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…On the other hand, applying numerical differentiation to get local order 3 causes less problems with ACR than with EO. Moreover, ACR has the advantage that you do not have to worry about the calculation of q which cost, although small according to [14], has not even been included for the comparisons here.…”
Section: Discussionmentioning
confidence: 99%
“…In one dimension, this was achieved just by integrating twice the linear functionq(t) and that was done analytically for every value of t ∈ [t n , t n + 1 ). However, in two dimensions, that cannot be done any more and the elliptic problems (14) should be numerically solved, not only for every value t n , but even theoretically for every t ∈ [t n , t n + 1 ). In contrast, notice that numerical differentiation with ACR (12) just requires approximating Af (t n , u(t n )) at each step and no elliptic problem must be numerically solved.…”
Section: Numerical Comparison With Exact Time Integration Of the Splimentioning
confidence: 99%
See 2 more Smart Citations
“…Then we just need to solve the sequence of a linear tri-diagonal system, and the whole process of programming is also simplified. SSM has been applied successfully in a diffusion-reaction problem [20]. To the best of our knowledge, no high-order CFDS combined with POD and SSM (E-CFDS6-SSM) aimed to solve MDPE efficiently has been developed so far.…”
Section: Introductionmentioning
confidence: 99%