High order summation-by-parts methods in time and space

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 s...

Full description

Bibliographic Details
Main Author: Lundquist, Tomas
Format: Doctoral Thesis
Language:English
Published: Linköpings universitet, Beräkningsmatematik 2016
Subjects:
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-126172
http://nbn-resolving.de/urn:isbn:978-91-7685-837-0 (Print)
id ndltd-UPSALLA1-oai-DiVA.org-liu-126172
record_format oai_dc
spelling ndltd-UPSALLA1-oai-DiVA.org-liu-1261722016-04-01T05:13:13ZHigh order summation-by-parts methods in time and spaceengLundquist, TomasLinköpings universitet, BeräkningsmatematikLinköpings universitet, Tekniska fakultetenLinköping2016summation-by-partstime integrationstiff problemsweak initial conditionshigh order methodssimultaneous-approximation-termfinite differencediscontinuous Galerkinspectral methodsconservationenergy stabilitycomplex geometriesnon-conforming grid interfacesinterpolationThis 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. Doctoral thesis, comprehensive summaryinfo:eu-repo/semantics/doctoralThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-126172urn:isbn:978-91-7685-837-0 (Print)doi:10.3384/diss.diva-126172Linköping Studies in Science and Technology. Dissertations, 0345-7524 ; 1740application/pdfinfo:eu-repo/semantics/openAccess
collection NDLTD
language English
format Doctoral Thesis
sources NDLTD
topic 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
spellingShingle 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
Lundquist, Tomas
High order summation-by-parts methods in time and space
description 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.
author Lundquist, Tomas
author_facet Lundquist, Tomas
author_sort Lundquist, Tomas
title High order summation-by-parts methods in time and space
title_short High order summation-by-parts methods in time and space
title_full High order summation-by-parts methods in time and space
title_fullStr High order summation-by-parts methods in time and space
title_full_unstemmed High order summation-by-parts methods in time and space
title_sort high order summation-by-parts methods in time and space
publisher Linköpings universitet, Beräkningsmatematik
publishDate 2016
url http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-126172
http://nbn-resolving.de/urn:isbn:978-91-7685-837-0 (Print)
work_keys_str_mv AT lundquisttomas highordersummationbypartsmethodsintimeandspace
_version_ 1718214374779256832