liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
The SBP-SAT Technique for Initial Value Problems
Linköping University, Department of Mathematics, Computational Mathematics. Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Computational Mathematics. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-7972-6183
2014 (English)In: Journal of Computational Physics, ISSN 0021-9991, E-ISSN 1090-2716, Vol. 270, 86-104 p.Article in journal (Refereed) Published
Abstract [en]

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 non- linear 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.

Place, publisher, year, edition, pages
Elsevier, 2014. Vol. 270, 86-104 p.
Keyword [en]
time integration, initial value problems, high order accuracy, initial boundary value problems, boundary conditions, global methods, stability, convergence, summation-by-parts operators, stiff problems
National Category
Computational Mathematics
URN: urn:nbn:se:liu:diva-105802DOI: 10.1016/ 000336406200006OAI: diva2:710647
Available from: 2014-04-07 Created: 2014-04-07 Last updated: 2016-03-31
In thesis
1. High order summation-by-parts methods in time and space
Open this publication in new window or tab >>High order summation-by-parts methods in time and space
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

This thesis develops the methodology for solving initial boundary value problems with the use of summation-by-parts discretizations. The combination of high orders of accuracy and a systematic approach to construct provably stable boundary and interface procedures makes this methodology especially suitable for scientific computations with high demands on efficiency and robustness. Most classes of high order methods can be applied in a way that satisfies a summation-by-parts rule. These include, but are not limited to, finite difference, spectral and nodal discontinuous Galerkin methods.

In the first part of this thesis, the summation-by-parts methodology is extended to the time domain, enabling fully discrete formulations with superior stability properties. The resulting time discretization technique is closely related to fully implicit Runge-Kutta methods, and may alternatively be formulated as either a global method or as a family of multi-stage methods. Both first and second order derivatives in time are considered. In the latter case also including mixed initial and boundary conditions (i.e. conditions involving derivatives in both space and time).

The second part of the thesis deals with summation-by-parts discretizations on multi-block and hybrid meshes. A new formulation of general multi-block couplings in several dimensions is presented and analyzed. It collects all multi-block, multi-element and  hybrid summation-by-parts schemes into a single compact framework. The new framework includes a generalized description of non-conforming interfaces based on so called summation-by-parts preserving interpolation operators, for which a new theoretical accuracy result is presented.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2016. 21 p.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1740
summation-by-parts, time integration, stiff problems, weak initial conditions, high order methods, simultaneous-approximation-term, finite difference, discontinuous Galerkin, spectral methods, conservation, energy stability, complex geometries, non-conforming grid interfaces, interpolation
National Category
Computational Mathematics
urn:nbn:se:liu:diva-126172 (URN)10.3384/diss.diva-126172 (DOI)978-91-7685-837-0 (Print) (ISBN)
Public defence
2016-04-22, Visionen, ingång 27, B-huset, Campus Valla, Linköping, 13:15 (English)
Swedish Research Council, 2012-1689
Available from: 2016-03-31 Created: 2016-03-17 Last updated: 2016-03-31Bibliographically approved

Open Access in DiVA

The SBP-SAT Technique for Initial Value Problems(362 kB)77 downloads
File information
File name FULLTEXT01.pdfFile size 362 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Lundquist, TomasNordström, Jan
By organisation
Computational MathematicsThe Institute of Technology
In the same journal
Journal of Computational Physics
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 77 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 271 hits
ReferencesLink to record
Permanent link

Direct link