scholarly journals A Nonoscillatory Second-Order Time-Stepping Procedure for Reaction-Diffusion Equations

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Philku Lee ◽  
George V. Popescu ◽  
Seongjai Kim

After a theory of morphogenesis in chemical cells was introduced in the 1950s, much attention had been devoted to the numerical solution of reaction-diffusion (RD) partial differential equations (PDEs). The Crank–Nicolson (CN) method has been a common second-order time-stepping procedure. However, the CN method may introduce spurious oscillations for nonsmooth data unless the time step size is sufficiently small. This article studies a nonoscillatory second-order time-stepping procedure for RD equations, called a variable-θmethod, as a perturbation of the CN method. In each time level, the new method detects points of potential oscillations to implicitly resolve the solution there. The proposed time-stepping procedure is nonoscillatory and of a second-order temporal accuracy. Various examples are given to show effectiveness of the method. The article also performs a sensitivity analysis for the numerical solution of biological pattern forming models to conclude that the numerical solution is much more sensitive to the spatial mesh resolution than the temporal one. As the spatial resolution becomes higher for an improved accuracy, the CN method may produce spurious oscillations, while the proposed method results in stable solutions.

Author(s):  
Florentine Catharina Fleißner

The purpose of this paper is to introduce a Minimizing Movement approach to scalar reaction-diffusion equations of the form \partial_t u \ = \ \Lambda\cdot \mathrm{div}[u(\nabla F'(u) + \nabla V)] \ - \ \Sigma\cdot (F'(u) + V) u, \quad \text{ in } (0, +\infty)\times\Omega, with parameters $\Lambda, \Sigma > 0$ and no-flux boundary condition u(\nabla F'(u) + \nabla V)\cdot {\sf n} \ = \ 0, \quad \text{ on } (0, +\infty)\times\partial\Omega, which is built on their gradient-flow-like structure in the space $\mathcal{M}(\bar{\Omega})$ of finite nonnegative Radon measures on $\bar{\Omega}\subset\xR^d$, endowed with the recently introduced Hellinger-Kantorovich distance $\HK_{\Lambda, \Sigma}$. It is proved that, under natural general assumptions on $F: [0, +\infty)\to\xR$ and $V:\bar{\Omega}\to\xR$, the Minimizing Movement scheme \mu_\tau^0:=u_0\mathscr{L}^d \in\mathcal{M}(\bar{\Omega}), \quad \mu_\tau^n \text{ is a minimizer for } \mathcal{E}(\cdot)+\frac{1}{2\tau}\HK_{\Lambda, \Sigma}(\cdot, \mu_\tau^{n-1})^2, \ n\in\xN, for \mathcal{E}: \mathcal{M}(\bar{\Omega}) \to (-\infty, +\infty], \ \mathcal{E}(\mu):= \begin{cases} \int_\Omega{[F(u(x))+V(x)u(x)]\xdif x} &\text{ if } \mu=u\mathscr{L}^d, \\ +\infty &\text{ else}, \end{cases} yields weak solutions to the above equation as the discrete time step size $\tau\downarrow 0$. Moreover, a superdifferentiability property of the Hellinger-Kantorovich distance $\HK_{\Lambda, \Sigma}$, which will play an important role in this context, is established in the general setting of a separable Hilbert space.


2017 ◽  
Vol 21 (5) ◽  
pp. 1408-1428 ◽  
Author(s):  
Xiaoling Liu ◽  
Chuanju Xu

AbstractThis paper is concerned with numerical methods for the Navier-Stokes-Nernst-Planck-Poisson equation system. The main goal is to construct and analyze some stable time stepping schemes for the time discretization and use a spectral method for the spatial discretization. The main contribution of the paper includes: 1) an useful stability inequality for the weak solution is derived; 2) a first order time stepping scheme is constructed, and the non-negativity of the concentration components of the discrete solution is proved. This is an important property since the exact solution shares the same property. Moreover, the stability of the scheme is established, together with a stability condition on the time step size; 3) a modified first order scheme is proposed in order to decouple the calculation of the velocity and pressure in the fluid field. This new scheme equally preserves the non-negativity of the discrete concentration solution, and is stable under a similar stability condition; 4) a stabilization technique is introduced to make the above mentioned schemes stable without restriction condition on the time step size; 5) finally we construct a second order finite difference scheme in time and spectral discretization in space. The numerical tests carried out in the paper show that all the proposed schemes possess some desirable properties, such as conditionally/unconditionally stability, first/second order convergence, non-negativity of the discrete concentrations, and so on.


2011 ◽  
Vol 2011 ◽  
pp. 1-25
Author(s):  
Jui-Ling Yu

We present a class of numerical methods for the reaction-diffusion-chemotaxis system which is significant for biological and chemistry pattern formation problems. To solve reaction-diffusion-chemotaxis systems, efficient and reliable numerical algorithms are essential for pattern generations. Along with the implementation of the method of lines, implicit or semi-implicit schemes are typical time stepping solvers to reduce the effect on time step constrains due to the stability condition. However, these two schemes are usually difficult to employ. In this paper, we propose an adaptive optimal time stepping strategy for the explicit -stage Runge-Kutta method to solve reaction-diffusion-chemotaxis systems. Instead of relying on empirical approaches to control the time step size, variable time step sizes are given explicitly. Yet, theorems about stability and convergence of the algorithm are provided in analyzing robustness and efficiency. Numerical experiment results on a testing problem and a real application problem are shown.


2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
S. S. Ravindran

Micropolar fluid model consists of Navier-Stokes equations and microrotational velocity equations describing the dynamics of flows in which microstructure of fluid is important. In this paper, we propose and analyze a decoupled time-stepping algorithm for the evolutionary micropolar flow. The proposed method requires solving only one uncoupled Navier-Stokes and one microrotation subphysics problem per time step. We derive optimal order error estimates in suitable norms without assuming any stability condition or time step size restriction.


2015 ◽  
Vol 143 (3) ◽  
pp. 972-990 ◽  
Author(s):  
Lei Bao ◽  
Robert Klöfkorn ◽  
Ramachandran D. Nair

Abstract A two-dimensional nonhydrostatic (NH) atmospheric model based on the compressible Euler system has been developed in the (x, z) Cartesian domain. The spatial discretization is based on a nodal discontinuous Galerkin (DG) method with exact integration. The orography is handled by the terrain-following height-based coordinate system. The time integration uses the horizontally explicit and vertically implicit (HEVI) time-splitting scheme, which is introduced to address the stringent restriction on the explicit time step size due to a high aspect ratio between the horizontal (x) and vertical (z) spatial discretization. The HEVI scheme is generally based on the Strang-type operator-split approach, where the horizontally propagating waves in the Euler system are solved explicitly while the vertically propagating waves are treated implicitly. As a consequence, the HEVI scheme relaxes the maximum allowed time step to be mainly determined by the horizontal grid spacing. The accuracy of the HEVI scheme is rigorously compared against that of the explicit strong stability-preserving (SSP) Runge–Kutta (RK) scheme using several NH benchmark test cases. The HEVI scheme shows a second-order temporal convergence, as expected. The results of the HEVI scheme are qualitatively comparable to those of the SSP-RK3 scheme. Moreover, the HEVI DG formulation can also be seamlessly extended to account for the second-order diffusion as in the case of the standard SSP-RK DG formulation. In the presence of orography, the HEVI scheme produces high quality results, which are visually identical to those produced by the SSP-RK3 scheme.


Author(s):  
Stefan Hante ◽  
Denise Tumiotto ◽  
Martin Arnold

AbstractIn this paper, we will consider a geometrically exact Cosserat beam model taking into account the industrial challenges. The beam is represented by a framed curve, which we parametrize in the configuration space $\mathbb{S}^{3}\ltimes \mathbb{R}^{3}$ S 3 ⋉ R 3 with semi-direct product Lie group structure, where $\mathbb{S}^{3}$ S 3 is the set of unit quaternions. Velocities and angular velocities with respect to the body-fixed frame are given as the velocity vector of the configuration. We introduce internal constraints, where the rigid cross sections have to remain perpendicular to the center line to reduce the full Cosserat beam model to a Kirchhoff beam model. We derive the equations of motion by Hamilton’s principle with an augmented Lagrangian. In order to fully discretize the beam model in space and time, we only consider piecewise interpolated configurations in the variational principle. This leads, after approximating the action integral with second order, to the discrete equations of motion. Here, it is notable that we allow the Lagrange multipliers to be discontinuous in time in order to respect the derivatives of the constraint equations, also known as hidden constraints. In the last part, we will test our numerical scheme on two benchmark problems that show that there is no shear locking observable in the discretized beam model and that the errors are observed to decrease with second order with the spatial step size and the time step size.


Mathematics ◽  
2021 ◽  
Vol 9 (18) ◽  
pp. 2284
Author(s):  
Endre Kovács ◽  
Ádám Nagy ◽  
Mahmoud Saleh

This paper introduces a set of new fully explicit numerical algorithms to solve the spatially discretized heat or diffusion equation. After discretizing the space and the time variables according to conventional finite difference methods, these new methods do not approximate the time derivatives by finite differences, but use a combined two-stage constant-neighbour approximation to decouple the ordinary differential equations and solve them analytically. In the final expression for the new values of the variable, the time step size appears not in polynomial or rational, but in exponential form with negative coefficients, which can guarantee stability. The two-stage scheme contains a free parameter p and we analytically prove that the convergence is second order in the time step size for all values of p and the algorithm is unconditionally stable if p is at least 0.5, not only for the linear heat equation, but for the nonlinear Fisher’s equation as well. We compare the performance of the new methods with analytical and numerical solutions. The results suggest that the new algorithms can be significantly faster than the widely used explicit or implicit methods, particularly in the case of extremely large stiff systems.


Author(s):  
W. Dauksher ◽  
A. F. Emery

The dispersive errors in the finite element solution to the one- and two-dimensional heat equations are examined as a function of element type and size, capacitance matrix formulation, time stepping scheme and time step size.


2021 ◽  
Vol 88 (3) ◽  
Author(s):  
Yuyuan Yan ◽  
Bernard A. Egwu ◽  
Zongqi Liang ◽  
Yubin Yan

AbstractA continuous Galerkin time stepping method is introduced and analyzed for subdiffusion problem in an abstract setting. The approximate solution will be sought as a continuous piecewise linear function in time t and the test space is based on the discontinuous piecewise constant functions. We prove that the proposed time stepping method has the convergence order $$O(\tau ^{1+ \alpha }), \, \alpha \in (0, 1)$$ O ( τ 1 + α ) , α ∈ ( 0 , 1 ) for general sectorial elliptic operators for nonsmooth data by using the Laplace transform method, where $$\tau $$ τ is the time step size. This convergence order is higher than the convergence orders of the popular convolution quadrature methods (e.g., Lubich’s convolution methods) and L-type methods (e.g., L1 method), which have only $$O(\tau )$$ O ( τ ) convergence for the nonsmooth data. Numerical examples are given to verify the robustness of the time discretization schemes with respect to data regularity.


2019 ◽  
Vol 53 (6) ◽  
pp. 1893-1914
Author(s):  
Piotr Swierczynski ◽  
Barbara Wohlmuth

The presence of corners in the computational domain, in general, reduces the regularity of solutions of parabolic problems and diminishes the convergence properties of the finite element approximation introducing a so-called “pollution effect”. Standard remedies based on mesh refinement around the singular corner result in very restrictive stability requirements on the time-step size when explicit time integration is applied. In this article, we introduce and analyse the energy-corrected finite element method for parabolic problems, which works on quasi-uniform meshes, and, based on it, create fast explicit time discretisation. We illustrate these results with extensive numerical investigations not only confirming the theoretical results but also showing the flexibility of the method, which can be applied in the presence of multiple singular corners and a three-dimensional setting. We also propose a fast explicit time-stepping scheme based on a piecewise cubic energy-corrected discretisation in space completed with mass-lumping techniques and numerically verify its efficiency.


Sign in / Sign up

Export Citation Format

Share Document