An a posteriori strategy for adaptive schemes in time for one-dimensional advection-diffusion transport equations. (1st December 2021)

• Record Type: Journal Article
• Authors: Malheiro, M.T.; Machado, Gaspar J.; Clain, Stéphane
• Is Part Of: Computers & mathematics with applications. Volume 103(2021)
• Page Start: 65
• Page End: 81
• Publication Date: 2021-12-01
• Subjects: Optimal time step -- Stability -- Finite difference method -- MOOD -- High-order -- Non-stationary convection-diffusion; Electronic data processing -- Periodicals; Mathematics -- Data processing -- Periodicals; 510.28541
• DOI: 10.1016/j.camwa.2021.10.022
• Languages: English
• ISSNs: 0898-1221

Abstract

Abstract: Stability condition is a more restrictive constraint that leads to unnecessary small-time steps with respect to the accuracy and results in computational time wastage. We propose a node by node adaptive time scheme to relax the stability constraint enabling a larger global time step for all the nodes. A nonlinear procedure for optimising both the schemes in time and space is proposed in view of increasing the numerical efficiency and reducing the computational time. The method is based on a four-parameter family of schemes we shall tune in function of the physical data (velocity, diffusion), the characteristic size in time and space, and the local regularity of the function leading to a nonlinear procedure. The a posteriori strategy we adopt consists in, given the solution at time t n, computing a candidate solution with the highest accurate schemes in time and space for all the nodes. Then, for the nodes that present some instabilities, both the schemes in time and space are modified and adapted in order to preserve the stability with a large time step. The updated solution is computed with node-dependent schemes both in time and space. For the sake of simplicity, only convection-diffusion problems are addressed as a prototype with a two-parameters five-points finite difference method for the spatial discretisation together with an explicit time two-parameters four-stages Runge–Kutta method. We prove that we manage to obtain an optimal time-step algorithm that produces accurate numerical approximations exempt of non-physical oscillations.