scholarly journals A decoupled Crank-Nicolson time-stepping scheme for thermally coupled magneto-hydrodynamic system

Author(s):  
S. S. Ravindran

Thermally coupled magneto-hydrodynamics (MHD) studies the dynamics of electro-magnetically and thermally driven flows,involving MHD equations coupled with heat equation. We introduce a partitioned method that allows one to decouplethe MHD equations from the heat equation at each time step and solve them separately. The extrapolated Crank-Nicolson time-stepping scheme is used for time discretizationwhile mixed finite element method is used for spatial discretization. We derive optimal order error estimates in suitable norms without assuming any stability condition or restrictions on the time step size. We prove the unconditional stability of the scheme. Numerical experiments are used to illustrate the theoretical results.

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.


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.


2020 ◽  
Vol 13 (13) ◽  
pp. 51-54
Author(s):  
Kedar Nath Uprety ◽  
Harithar Khanal ◽  
Ananta Upreti

We solve the Black - Scholes equation for option pricing numerically using an Explicit finite difference method. To overcome the stability restriction of the explicit scheme for parabolic partial differential equations in the time step size Courant-Friedrichs-Lewy (CFL) condition, we employ a Super Time Stepping (STS) strategy based on modified Chebyshev polynomial. The numerical results show that the STS scheme boasts of large efficiency gains compared to the standard explicit Euler method.


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.


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.


2017 ◽  
Vol 27 (11) ◽  
pp. 2147-2184 ◽  
Author(s):  
Patrick Henning ◽  
Daniel Peterseim

This paper analyzes the numerical solution of a class of nonlinear Schrödinger equations by Galerkin finite elements in space and a mass and energy conserving variant of the Crank–Nicolson method due to Sanz-Serna in time. The novel aspects of the analysis are the incorporation of rough, discontinuous potentials in the context of weak and strong disorder, the consideration of some general class of nonlinearities, and the proof of convergence with rates in [Formula: see text] under moderate regularity assumptions that are compatible with discontinuous potentials. For sufficiently smooth potentials, the rates are optimal without any coupling condition between the time step size and the spatial mesh width.


Sign in / Sign up

Export Citation Format

Share Document