Runge-Kutta Methods for Linear Semi-explicit Operator Differential-algebraic Equations

As a first step towards time-stepping schemes for constrained PDE systems, this paper presents convergence results for the temporal discretization of operator DAEs. We consider linear, semi-explicit systems which includes e.g. the Stokes equations or applications with boundary control. To guarantee unique approximations, we restrict the analysis to algebraically stable Runge-Kutta methods for which the stability functions satisfy R(∞)=0. As expected from the theory of DAEs, the convergence properties of the single variables differ and depend strongly on the assumed smoothness of the data

Constraint-consistent Runge-Kutta methods for one-dimensional incompressible multiphase flow

New time integration methods are proposed for simulating incompressible multiphase flow in pipelines described by the one-dimensional two-fluid model. The methodology is based on 'half-explicit' Runge-Kutta methods, being explicit for the mass and momentum equations and implicit for the volume constraint. These half-explicit methods are constraint-consistent, i.e., they satisfy the hidden constraints of the two-fluid model, namely the volumetric flow (incompressibility) constraint and the Poisson equation for the pressure. A novel analysis shows that these hidden constraints are present in the continuous, semi-discrete, and fully discrete equations. Next to constraint-consistency, the new methods are conservative: the original mass and momentum equations are solved, and the proper shock conditions are satisfied; efficient: the implicit constraint is rewritten into a pressure Poisson equation, and the time step for the explicit part is restricted by a CFL condition based on the convective wave speeds; and accurate: achieving high order temporal accuracy for all solution components (masses, velocities, and pressure). High-order accuracy is obtained by constructing a new third order Runge-Kutta method that satisfies the additional order conditions arising from the presence of the constraint in combination with time-dependent boundary conditions. Two test cases (Kelvin-Helmholtz instabilities in a pipeline and liquid sloshing in a cylindrical tank) show that for time-independent boundary conditions the half-explicit formulation with a classic fourth-order Runge-Kutta method accurately integrates the two-fluid model equations in time while preserving all constraints. A third test case (ramp-up of gas production in a multiphase pipeline) shows that our new third order method is preferred for cases featuring time-dependent boundary conditions

HP-multigrid as smoother algorithm for higher order discontinuous Galerkin discretizations of advection dominated flows. Part II. Optimization of the Runge-Kutta smoother

Using a detailed multilevel analysis of the complete hp-Multigrid as Smoother algorithm accurate predictions are obtained of the spectral radius and operator norms of the multigrid error transformation operator. This multilevel analysis is used to optimize the coefficients in the semi-implicit Runge-Kutta smoother, such that the spectral radius of the multigrid error transformation operator is minimal under properly chosen constraints. The Runge-Kutta coefficients for a wide range of cell Reynolds numbers and a detailed analysis of the performance of the hp-MGS algorithm are presented. In addition, the computational complexity of the hp-MGS algorithm is investigated. The hp-MGS algorithm is tested on a fourth order accurate space-time discontinuous Galerkin finite element discretization of the advection-diffusion equation for a number of model problems, which include thin boundary layers and highly stretched meshes, and a non-constant advection velocity. For all test cases excellent multigrid convergence is obtained

Two combined methods for the global solution of implicit semilinear differential equations with the use of spectral projectors and Taylor expansions

Two combined numerical methods for solving semilinear differential-algebraic equations (DAEs) are obtained and their convergence is proved. The comparative analysis of these methods is carried out and conclusions about the effectiveness of their application in various situations are made. In comparison with other known methods, the obtained methods require weaker restrictions for the nonlinear part of the DAE. Also, the obtained methods enable to compute approximate solutions of the DAEs on any given time interval and, therefore, enable to carry out the numerical analysis of global dynamics of mathematical models described by the DAEs. The examples demonstrating the capabilities of the developed methods are provided. To construct the methods we use the spectral projectors, Taylor expansions and finite differences. Since the used spectral projectors can be easily computed, to apply the methods it is not necessary to carry out additional analytical transformations

A semi-explicit multi-step method for solving incompressible navier-stokes equations

The fractional step method is a technique that results in a computationally-efficient implementation of Navier–Stokes solvers. In the finite element-based models, it is often applied in conjunction with implicit time integration schemes. On the other hand, in the framework of finite difference and finite volume methods, the fractional step method had been successfully applied to obtain predictor-corrector semi-explicit methods. In the present work, we derive a scheme based on using the fractional step technique in conjunction with explicit multi-step time integration within the framework of Galerkin-type stabilized finite element methods. We show that under certain assumptions, a Runge–Kutta scheme equipped with the fractional step leads to an efficient semi-explicit method, where the pressure Poisson equation is solved only once per time step. Thus, the computational cost of the implicit step of the scheme is minimized. The numerical example solved validates the resulting scheme and provides the insights regarding its accuracy and computational efficiency.Peer ReviewedPostprint (published version

A class of implicit-explicit two-step Runge-Kutta methods

This work develops implicit-explicit time integrators based on two-step Runge-Kutta methods. The class of schemes of interest is characterized by linear invariant preservation and high stage orders. Theoretical consistency and stability analyses are performed to reveal the properties of these methods. The new framework offers extreme flexibility in the construction of partitioned integrators, since no coupling conditions are necessary. Moreover, the methods are not plagued by severe order reduction, due to their high stage orders. Two practical schemes of orders four and six are constructed, and are used to solve several test problems. Numerical results confirm the theoretical findings

Differential-Algebraic Equations and Beyond: From Smooth to Nonsmooth Constrained Dynamical Systems

The present article presents a summarizing view at differential-algebraic equations (DAEs) and analyzes how new application fields and corresponding mathematical models lead to innovations both in theory and in numerical analysis for this problem class. Recent numerical methods for nonsmooth dynamical systems subject to unilateral contact and friction illustrate the topicality of this development.Comment: Preprint of Book Chapte

Effective order strong stability preserving Runge–Kutta methods

We apply the concept of effective order to strong stability preserving (SSP) explicit Runge–Kutta methods. Relative to classical Runge–Kutta methods, effective order methods are designed to satisfy a relaxed set of order conditions, but yield higher order accuracy when composed with special starting and stopping methods. The relaxed order conditions allow for greater freedom in the design of effective order methods. We show that this allows the construction of four-stage SSP methods with effective order four (such methods cannot have classical order four). However, we also prove that effective order five methods—like classical order five methods—require the use of non-positive weights and so cannot be SSP. By numerical optimization, we construct explicit SSP Runge–Kutta methods up to effective order four and establish the optimality of many of them. Numerical experiments demonstrate the validity of these methods in practice