2019
DOI: 10.1137/18m1191609
|View full text |Cite
|
Sign up to set email alerts
|

Order-Preserving Interpolation for Summation-by-Parts Operators at Nonconforming Grid Interfaces

Abstract: We study non-conforming grid interfaces for summation-by-parts finite difference methods applied to partial differential equations with second derivatives in space. To maintain energy stability, previous efforts have been forced to accept a reduction of the global convergence rate by one order, due to large truncation errors at the non-conforming interface. We avoid the order reduction by generalizing the interface treatment and introducing order preserving interpolation operators. We prove that, given two dia… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
36
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 27 publications
(36 citation statements)
references
References 31 publications
0
36
0
Order By: Relevance
“…The second choice of SATs uses four penalty terms [28], which has a better stability property for problems with curved interfaces. The method was improved further in [1] from the accuracy perspective when non-periodic boundary conditions are used in the x-direction. In addition, the penalty parameters in [1] are optimized and are sharper than those in [28].…”
Section: The Sbp-sat Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The second choice of SATs uses four penalty terms [28], which has a better stability property for problems with curved interfaces. The method was improved further in [1] from the accuracy perspective when non-periodic boundary conditions are used in the x-direction. In addition, the penalty parameters in [1] are optimized and are sharper than those in [28].…”
Section: The Sbp-sat Methodsmentioning
confidence: 99%
“…The method was improved further in [1] from the accuracy perspective when non-periodic boundary conditions are used in the x-direction. In addition, the penalty parameters in [1] are optimized and are sharper than those in [28]. As will be seen in the numerical experiments, the sharper penalty parameters lead to an improved CFL condition.…”
Section: The Sbp-sat Methodsmentioning
confidence: 99%
“…Proof of Theorem 2. 1 We aim to show that Q Q −1 = I , where I is the (n + 1) × (n + 1) identity matrix. Using Q from ( 7) and Q −1 from ( 9), we compute 5) is a consistent difference operator.…”
Section: Theorem 21mentioning
confidence: 99%
“…where we need to show that d dt v 2 H ≤ 0. We will determine the stability limits of σ L,R and τ L,R using a procedure sometimes called the borrowing technique [1,2,7,15,24,30,32]. The idea is to "borrow" a maximum amount γ of "positivity" from A, more precisely as…”
Section: Stabilitymentioning
confidence: 99%
“…These ideas can contribute to the creation of a free-energy stable scheme as the one developed in this work. The foundation for the establishment of this family of methods has been laid in [25][26][27][28]. One of the first works is the one presented by Carpenter et al [29] which makes a first attempt to create an entropy-stable scheme using the local discontinuous Galerkin method.…”
Section: Introductionmentioning
confidence: 99%