Implicit-explicit (IMEX) time stepping methods can efficiently solve differential equa- tions with both stiff and nonstiff components. IMEX Runge-Kutta methods and IMEX linear multistep methods have been studied in the literature. In this pa- per we study new implicit-explicit methods of general linear type (IMEX-GLMs). We develop an order conditions theory for high stage order partitioned GLMs that share the same abscissae, and show that no additional coupling order conditions are needed. Consequently, GLMs offer an excellent framework for the construction of multi-method integration algorithms. Next, we propose a family of IMEX schemes based on diagonally-implicit multi-stage integration methods and construct practical schemes of order three. Numerical results confirm the theoretical findings.
Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University(南京师范大学数学科学学院);School of Mathematical Sciences, Peking University(北京大学数学科学学院)
High-order, linearly stable, partitioned solvers for general multiphysics problems based on implicit-explicit Runge-Kutta schemes
Stanford University(斯坦福大学);Lawrence Berkeley National Laboratory(劳伦斯伯克利国家实验室);University of California, Berkeley(加州大学伯克利分校);University of Notre Dame(圣母大学)
We present an arbitrarily high-order, conditionally stable, partitioned spectral deferred correction (SDC) method for solving multiphysics problems using a sequence of pre-existing single-physics solvers. This method extends the work in [1, 2], which used implicit-explicit Runge-Kutta methods (IMEX) to build high-order, partitioned multiphysics solvers. We consider a generic multiphysics problem modeled as a system of coupled ordinary differential equations (ODEs), coupled through coupling terms that can depend on the state of each subsystem; therefore the method applies to both a semi-discret…
King Abdullah University of Science & Technology(阿卜杜拉国王科技大学);Mathematical Institute, University of Oxford(牛津大学数学研究所);Department of Mathematics, Simon Fraser University(西蒙菲莎大学数学系)
Analysis for Implicit and Implicit-Explicit ADER and DeC Methods for Ordinary Differential Equations, Advection-Diffusion and Advection-Dispersion Equations
本文在 DeC 框架下构造隐式与隐式–显式 ADER、DeC 方法,通过 Runge–Kutta 重解释和 von Neumann 分析刻画其 ODE 及线性 PDE 稳定性,并给出系数边界与格式选择建议。
A high-order partitioned solver for general multiphysics problems and its applications in optimization
Stanford University(斯坦福大学);Lawrence Berkeley National Laboratory(劳伦斯伯克利国家实验室);University of California, Berkeley(加州大学伯克利分校);University of Notre Dame(圣母大学)
We present novel coupling schemes for partitioned multi-physics simulation that combine four important aspects for strongly coupled problems: implicit coupling per time step, fast and robust acceleration of the corresponding iterative coupling, support for multi-rate time stepping, and higher-order convergence in time. To achieve this, we combine waveform relaxation -- a known method to achieve higher order in applications with split time stepping based on continuous representations of coupling variables in time -- with interface quasi-Newton coupling, which has been developed throughout the l…
Systems driven by multiple physical processes are central to many areas of science and engineering. Time discretization of multiphysics systems is challenging, since different processes have different levels of stiffness and characteristic time scales. The multimethod approach discretizes each physical process with an appropriate numerical method; the methods are coupled appropriately such that the overall solution has the desired accuracy and stability properties. The authors developed the general-structure additive Runge-Kutta (GARK) framework, which constructs multimethods based on Runge-Ku…
Numerically solving ordinary differential equations (ODEs) is a naturally serial process and as a result the vast majority of ODE solver software are serial. In this manuscript we developed a set of parallelized ODE solvers using extrapolation methods which exploit "parallelism within the method" so that arbitrary user ODEs can be parallelized. We describe the specific choices made in the implementation of the explicit and implicit extrapolation methods which allow for generating low overhead static schedules to then exploit with optimized multi-threaded implementations. We demonstrate that wh…
Alternating Directions Implicit (ADI) integration is an operator splitting approach to solve parabolic and elliptic partial differential equations in multiple dimensions based on solving sequentially a set of related one-dimensional equations. Classical ADI methods have order at most two, due to the splitting errors. Moreover, when the time discretization of stiff one-dimensional problems is based on Runge-Kutta schemes, additional order reduction may occur. This work proposes a new ADI approach based on the partitioned General Linear Methods framework. This approach allows the construction of…
This work considers multirate generalized-structure additively partitioned Runge-Kutta (MrGARK) methods for solving stiff systems of ordinary differential equations (ODEs) with multiple time scales. These methods treat different partitions of the system with different timesteps for a more targeted and efficient solution compared to monolithic single rate approaches. With implicit methods used across all partitions, methods must find a balance between stability and the cost of solving nonlinear equations for the stages. In order to characterize this important trade-off, we explore multirate cou…
In this paper we generalize the polynomial time integration framework to additively partitioned initial value problems. The framework we present is general and enables the construction of many new families of additive integrators with arbitrary order-of-accuracy and varying degree of implicitness. In this first work, we focus on a new class of implicit-explicit polynomial block methods that are based on fully-implicit Runge-Kutta methods with Radau nodes, and possess high stage order. We show that the new fully-implicit-explicit (FIMEX) integrators have improved stability compared to existing …
We present a new linearly implicit exponential integrator that preserves the polynomial first integrals or Lyapunov functions for the conservative and dissipative stiff equations, respectively. The method is tested by both oscillated ordinary differential equations and partial differential equations, e.g., an averaged system in wind-induced oscillation, the Fermi-Pasta-Ulam systems, and the polynomial pendulum oscillators. The numerical simulations confirm the conservative properties of the proposed method and demonstrate its good behavior in superior running speed when compared with fully imp…
We consider partitioned time integration for heterogeneous coupled heat equations. First and second order multirate, as well as time-adaptive Dirichlet-Neumann Waveform relaxation (DNWR) methods are derived. In 1D and for implicit Euler time integration, we analytically determine optimal relaxation parameters for the fully discrete scheme. We test the robustness of the relaxation parameters on the second order multirate method in 2D. DNWR is shown to be very robust and consistently yielding fast convergence rates, whereas the closely related Neumann-Neumann Waveform relaxtion (NNWR) method is …
A quasi-monolithic localized high-order ALE finite element method for multi-scale fluid-structure interaction problems
Shenzhen Raymind Biotechnology Co., Ltd.(深圳睿盟基因生物技术有限公司);The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳));Shenzhen Research Institute of Big Data(深圳大数据研究院);King Abdullah University of Science and Technology(阿卜杜拉国王科技大学)
Efficient high order numerical methods for evolving the solution of an ordinary differential equation are widely used. The popular Runge--Kutta methods, linear multi-step methods, and more broadly general linear methods, all have a global error that is completely determined by analysis of the local truncation error. In prior work in we investigated the interplay between the local truncation error and the global error to construct {\em error inhibiting schemes} that control the accumulation of the local truncation error over time, resulting in a global error that is one order higher than expect…
Eigenvalue perturbation theory is applied to justify using complex-valued linear scalar test equations to characterize the stability of implicit-explicit general linear methods (IMEX GLMs) solving autonomous linear ordinary differential equations (ODEs) when the implicitly treated term is sufficiently stiff relative to the explicitly treated term. The stiff and non-stiff matrices are not assumed to be simultaneously diagonalizable or triangularizable and neither matrix is assumed to be symmetric or negative definite. The stability of IMEX GLMs solving complex-valued scalar linear ODEs displayi…
In this paper, we propose linearly implicit and arbitrary high-order conservative numerical schemes for ordinary differential equations with a quadratic invariant. Many differential equations have invariants, and numerical schemes for preserving them have been extensively studied. Since linear invariants can be easily kept after discretisation, quadratic invariants are essentially the simplest ones. Quadratic invariants are important objects that appear not only in many physical examples but also in the computationally efficient conservative schemes for general invariants such as scalar auxili…
Like many other biological processes, calcium dynamics in neurons containing an endoplasmic reticulum are governed by diffusion-reaction equations on interface-separated domains. Interface conditions are typically described by systems of ordinary differential equations that provide fluxes across the interfaces. Using the calcium model as an example of this class of ODE-flux boundary interface problems, we prove the existence, uniqueness and boundedness of the solution by applying comparison theorem, fundamental solution of the parabolic operator and a strategy used in Picard's existence theore…
In this work we construct a multiderivative implicit-explicit (IMEX) scheme for a class of stiff ordinary differential equations. Our solver is high-order accurate and has an asymptotic preserving (AP) property. The proposed method is based upon a two-derivative backward Taylor series base solver, which we show has an AP property. Higher order accuracies are found by iterating the result over a high-order multiderivative interpolant of the right hand side function, which we again prove has an AP property. Theoretical results showcasing the asymptotic consistency as well as the high-order accur…
We describe a set of Gaussian Process based approaches that can be used to solve non-linear Ordinary Differential Equations. We suggest an explicit probabilistic solver and two implicit methods, one analogous to Picard iteration and the other to gradient matching. All methods have greater accuracy than previously suggested Gaussian Process approaches. We also suggest a general approach that can yield error estimates from any standard ODE solver.
This paper investigates the competitiveness of semi-implicit Runge-Kutta (RK) and spectral deferred correction (SDC) time-integration methods up to order six for incompressible Navier-Stokes problems in conjunction with a high-order discontinuous Galerkin method for space discretization. It is proposed to harness the implicit and explicit RK parts as a partitioned scheme, which provides a natural basis for the underlying projection scheme and yields a straight-forward approach for accommodating nonlinear viscosity. Numerical experiments on laminar flow, variable viscosity and transition to tur…
This work focuses on the development of a new class of high-order accurate methods for multirate time integration of systems of ordinary differential equations. Unlike other recent work in this area, the proposed methods support mixed implicit-explicit (IMEX) treatment of the slow time scale. In addition to allowing this slow time scale flexibility, the proposed methods utilize a so-called `infinitesimal' formulation for the fast time scale through definition of a sequence of modified `fast' initial-value problems, that may be solved using any viable algorithm. We name the proposed class as im…
We propose a new Eulerian-Lagrangian Runge-Kutta finite volume method for numerically solving convection and convection-diffusion equations. Eulerian-Lagrangian and semi-Lagrangian methods have grown in popularity mostly due to their ability to allow large time steps. Our proposed scheme is formulated by integrating the PDE on a space-time region partitioned by approximations of the characteristics determined from the Rankine-Hugoniot jump condition; and then rewriting the time-integral form into a time differential form to allow application of Runge-Kutta (RK) methods via the method-of-lines …
It is well known that in the first-discretize-then-optimize approach in the control of ordinary differential equations the adjoint method may converge under additional order conditions only. For Peer two-step methods we derive such adjoint order conditions and pay special attention to the boundary steps. For $s$-stage methods, we prove convergence of order $s$ for the state variables if the adjoint method satisfies the conditions for order $s\!-\!1$, at least. We remove some bottlenecks at the boundaries encountered in an earlier paper of the first author et al. [J. Comput. Appl. Math., 262:73…
This paper investigates, a new class of fractional order Runge-Kutta (FORK) methods for numerical approximation to the solution of fractional differential equations (FDEs). By using the Caputo generalizedTaylor formula and the total differential for Caputo fractional derivative, we construct explicit and implicit FORK methods, as the well-known Runge-Kutta schemes for ordinary differential equations. In the proposed method, due to the dependence of fractional derivatives to a fixed base point $t_0,$ we had to modify the right-hand side of the given equation in all steps of the FORK methods. So…