2013
DOI: 10.1016/j.jcp.2013.05.042
|View full text |Cite
|
Sign up to set email alerts
|

Summation-by-parts in time

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
132
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 82 publications
(134 citation statements)
references
References 42 publications
2
132
0
Order By: Relevance
“…In time we use L time levels from 0 to T. The first derivative u ξ is approximated by D ξ u, where D ξ is a so-called SBP operator, see [10]. A multi-dimensional finite difference approximation (including the time discretization [8,4]), on SBP-SAT form, is constructed by extending the one-dimensional SBP operators in a tensor product fashion as…”
Section: The Discrete Problemmentioning
confidence: 99%
See 2 more Smart Citations
“…In time we use L time levels from 0 to T. The first derivative u ξ is approximated by D ξ u, where D ξ is a so-called SBP operator, see [10]. A multi-dimensional finite difference approximation (including the time discretization [8,4]), on SBP-SAT form, is constructed by extending the one-dimensional SBP operators in a tensor product fashion as…”
Section: The Discrete Problemmentioning
confidence: 99%
“…The energy method (multiplying from the left with V T (P τ ⊗ P ξ ⊗ P η ⊗ I)) is applied to (8) and the equation is added to its transpose. The result is…”
Section: Stabilitymentioning
confidence: 99%
See 1 more Smart Citation
“…Such schemes typically generate a linear system of ordinary differential equations, which is integrated in time using explicit methods. The groundwork for employing SBP-SAT also as a method of time integration was laid in [10]. However, naive usage of SBP in time produces schemes that, while provably stable and high order accurate, lead to large systems which are difficult to solve efficiently in multiple dimensions.…”
Section: Introductionmentioning
confidence: 99%
“…We consider provably stable SBP based domain decomposition methods for a two-dimensional advection-diffusion problem, where local solutions are coupled at the subdomain interfaces using SATs. The coupling procedure follows the ideas in [1], with adjustments to account for the use of SBP in time [7,10]. Our scheme involves isolating a linear system consisting only of interface components by solving independent, subdomain sized systems.…”
Section: Introductionmentioning
confidence: 99%