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

The SBP-SAT technique for initial value problems

Abstract: A detailed account of the stability and accuracy properties of the SBP-SAT technique for numerical time integration is presented. We show how the technique can be used to formulate both global and multi-stage methods with high order of accuracy for both stiff and non-stiff problems. Linear and nonlinear stability results, including A-stability, L-stability and B-stability are proven using the energy method for general initial value problems. Numerical experiments corroborate the theoretical properties.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
110
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
4
2

Relationship

4
2

Authors

Journals

citations
Cited by 54 publications
(115 citation statements)
references
References 25 publications
(51 reference statements)
2
110
0
Order By: Relevance
“…Point 2 is proven for the second order case, but remains an open question for high order operators. However, extensive numerical studies corroborate this hypothesis (see [7]). We consider Point 2 in the form of a conjecture.…”
Section: Invertibilitymentioning
confidence: 86%
See 2 more Smart Citations
“…Point 2 is proven for the second order case, but remains an open question for high order operators. However, extensive numerical studies corroborate this hypothesis (see [7]). We consider Point 2 in the form of a conjecture.…”
Section: Invertibilitymentioning
confidence: 86%
“…The initial data for each time-slab is given by the last solution from the previous time-slab. The procedure (multi-block in time) is explained in detail in [7].…”
Section: Remark 1 the Bound (14) Is A Discrete Analogue Of The Continmentioning
confidence: 99%
See 1 more Smart Citation
“…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%
“…In this paper (and the full paper [5]) we treat the time-dependent transformations in a SBP-SAT framework. To guarantee stability of the fully discrete approximation we employ the recently developed SBP-SAT technique in time [8,4].…”
Section: Introductionmentioning
confidence: 99%