An implicitly extended Crank-Nicolson scheme for the heat equation on time-dependent domains

03/13/2022
by   Stefan Frei, et al.
0

We consider a time-stepping scheme of Crank-Nicolson type for the heat equation on a moving domain in Eulerian coordinates. As the spatial domain varies between subsequent time steps, an extension of the solution at the previous time step is required. Following Lehrenfeld & Olskanskii [ESAIM: M2AN, 53(2): 585-614, 2019], we apply an implicit extension based on so-called ghost-penalty terms. For spatial discretisation, a cut finite element method is used. We derive a complete a priori error analysis in space and time, which shows in particular second-order convergence in time under a parabolic CFL condition. Finally, we present numerical results in two and three space dimensions that confirm the analytical estimates.

READ FULL TEXT

Authors

page 19

page 23

10/07/2019

Eulerian time-stepping schemes for the non-stationary Stokes equations on time-dependent domains

This article is concerned with the discretisation of the Stokes equation...
06/08/2022

Space-time aggregated finite element methods for time-dependent problems on moving domains

We propose a space-time scheme that combines an unfitted finite element ...
10/02/2019

Fast integral equation methods for linear and semilinear heat equations in moving domains

We present a family of integral equation-based solvers for the linear or...
06/09/2020

A linear implicit Euler method for the finite element discretization of a controlled stochastic heat equation

We consider a numerical approximation of a linear quadratic control prob...
12/08/2019

Parallel algorithm for numerical solution of heat equation in complex cylindrical domain

In this article we present a parallel algorithm for simulation of the he...
02/19/2021

Semi-analytic integration for a parallel space-time boundary element method modeling the heat equation

The presented paper concentrates on the boundary element method (BEM) fo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.