Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userHigh order linearly implicit methods for evolution equations
130
0
0.0
(
0
)
Added by
Guillaume Dujardin
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Authors
Guillaume Dujardin
Ask ChatGPT about the research
No Arabic abstract
This paper introduces a new class of numerical methods for the time integration of evolution equations set as Cauchy problems of ODEs or PDEs. The systematic design of these methods mixes the Runge-Kutta collocation formalism with collocation techniques, in such a way that the methods are linearly implicit and have high order. The fact that these methods are implicit allows to avoid CFL conditions when the large systems to integrate come from the space discretization of evolution PDEs. Moreover, these methods are expected to be efficient since they only require to solve one linear system of equations at each time step, and efficient techniques from the literature can be used to do so. After the introduction of the methods, we set suitable definitions of consistency and stability for these methods. This allows for a proof that arbitrarily high order linearly implicit methods exist and converge when applied to ODEs. Eventually, we perform numerical experiments on ODEs and PDEs that illustrate our theoretical results for ODEs, and compare our methods with standard methods for several evolution PDEs.
rate research
Read More
We consider the construction of semi-implicit linear multistep methods which can be applied to time dependent PDEs where the separation of scales in additive form, typically used in implicit-explicit (IMEX) methods, is not possible. As shown in Boscarino, Filbet and Russo (2016) for Runge-Kutta methods, these semi-implicit techniques give a great flexibility, and allows, in many cases, the construction of simple linearly implicit schemes with no need of iterative solvers. In this work we develop a general setting for the construction of high order semi-implicit linear multistep methods and analyze their stability properties for a prototype linear advection-diffusion equation and in the setting of strong stability preserving (SSP) methods. Our findings are demonstrated on several examples, including nonlinear reaction-diffusion and convection-diffusion problems.
Time integration methods for solving initial value problems are an important component of many scientific and engineering simulations. Implicit time integrators are desirable for their stability properties, significantly relaxing restrictions on timestep size. However, implicit methods require solutions to one or more systems of nonlinear equations at each timestep, which for large simulations can be prohibitively expensive. This paper introduces a new family of linearly implicit multistep methods (LIMM), which only requires the solution of one linear system per timestep. Order conditions and stability theory for these methods are presented, as well as design and implementation considerations. Practical methods of order up to five are developed that have similar error coefficients, but improved stability regions, when compared to the widely used BDF methods. Numerical testing of a self-starting variable stepsize and variable order implementation of the new LIMM methods shows measurable performance improvement over a similar BDF implementation.
A novel class of high-order linearly implicit energy-preserving exponential integrators are proposed for the nonlinear Schrodinger equation. We firstly done that the original equation is reformulated into a new form with a modified quadratic energy by the scalar auxiliary variable approach. The spatial derivatives of the system are then approximated with the standard Fourier pseudo-spectral method. Subsequently, we apply the extrapolation technique to the nonlinear term of the semi-discretized system and a linearized system is obtained. Based on the Lawson transformation, the linearized system is rewritten as an equivalent one and we further apply the symplectic Runge-Kutta method to the resulting system to gain a fully discrete scheme. We show that the proposed scheme can produce numerical solutions along which the modified energy is precisely conserved, as is the case with the analytical solution and is extremely efficient in the sense that only linear equations with constant coefficients need to be solved at every time step. Numerical results are addressed to demonstrate the remarkable superiority of the proposed schemes in comparison with other high-order structure-preserving method.
A tensor decomposition approach for the solution of high-dimensional, fully nonlinear Hamilton-Jacobi-Bellman equations arising in optimal feedback control of nonlinear dynamics is presented. The method combines a tensor train approximation for the value function together with a Newton-like iterative method for the solution of the resulting nonlinear system. The tensor approximation leads to a polynomial scaling with respect to the dimension, partially circumventing the curse of dimensionality. A convergence analysis for the linear-quadratic case is presented. For nonlinear dynamics, the effectiveness of the high-dimensional control synthesis method is assessed in the optimal feedback stabilization of the Allen-Cahn and Fokker-Planck equations with a hundred of variables.
We provide a preliminary comparison of the dispersion properties, specifically the time-amplification factor, the scaled group velocity and the error in the phase speed of four spatiotemporal discretization schemes utilized for solving the one-dimensional (1D) linear advection diffusion reaction (ADR) equation: (a) An explicit (RK2) temporal integration combined with the Optimal Upwind Compact Scheme (or OUCS3) and the central difference scheme (CD2) for second order spatial discretization, (b) a fully implicit mid-point rule for time integration coupled with the OUCS3 and the Leles compact scheme for first and second order spatial discretization, respectively, (c) An implicit (mid-point rule)-explicit (RK2) or IMEX time integration blended with OUCS3 and Leles compact scheme (where the IMEX time integration follows the same ideology as introduced by Ascher et al.), and (d) the IMEX (mid-point/RK2) time integration melded with the New Combined Compact Difference scheme (or NCCD scheme). Analysis reveal the superior resolution features of the IMEX-NCCD scheme including an enhanced region of neutral stability (a region where the amplification factor is close to one), a diminished region of spurious propagation characteristics (or a region of negative group velocity) and a smaller region of nonzero phase speed error. The dispersion error of these numerical schemes through the role of q-waves is further investigated using the novel error propagation equation for the 1D linear ADR equation. Again, the in silico experiments divulge excellent Dispersion Relation Preservation (DRP) properties of the IMEX-NCCD scheme including minimal dissipation via implicit filtering and negligible unphysical oscillations (or Gibbs phenomena) on coarser grids.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
