Water Hammer Simulation Method in Pressurized Pipeline with a Moving Isolation Device

Smart isolation devices (SIDs) are commonly used in pressurized subsea pipelines that need to be maintained or repaired. The sudden stoppage of the SID may cause large water hammer pressures, which may threaten both the pipeline and the SID. This paper proposes a simulation method by using a coupled dynamic mesh technique to simulate water hammer pressures in the pipeline. Unlike other water hammer simulations, this method is the first to be used in the simulation in pipelines with a moving object. The implicit method is applied to model the moving SID since it has the mutual independence between the space step and the time step. The movement of the SID is achieved by updating the size of the computational meshes close to the SID at each time step. To improve the efficiency of the simulation and the ability of handling complex boundary conditions, the pipe sections far away from the SID can also be simulated by using the explicit Method of Characteristics (MOC). Verifications were conducted using the simulated results from the Computational Fluid Dynamics (CFD) numerical simulation. Two scenarios have been studied and the comparisons between the simulated results by using the dynamic meshes in 1D methods and those by the CFD simulation show a high correlation, thus validating the new method proposed in this paper.

A stiffly stable semi-discrete scheme for the characteristic linear hyperbolic relaxation with boundary

We study the stability of the semi-discrete central scheme for the linear damped wave equation with boundary. We exhibit a sufficient condition on the boundary to guarantee the uniform stability of the initial boundary value problem for the relaxation system independently of the stiffness of the source term and of the space step. The boundary is approximated using a summation-by-parts method and the stiff stability is proved using energy estimates and the Laplace transform. We also investigate if the condition is also necessary, following the continuous case studied by Xin and Xu (J. Differ. Equ. 167 (2000) 388–437).

Null space gradient flows for constrained optimization with applications to shape optimization

The purpose of this article is to introduce a gradient-flow algorithm for solving equality and inequality constrained optimization problems, which is particularly suited for shape optimization applications. We rely on a variant of the Ordinary Differential Equation (ODE) approach proposed by Yamashita (Math. Program. 18 (1980) 155–168) for equality constrained problems: the search direction is a combination of a null space step and a range space step, aiming to decrease the value of the minimized objective function and the violation of the constraints, respectively. Our first contribution is to propose an extension of this ODE approach to optimization problems featuring both equality and inequality constraints. In the literature, a common practice consists in reducing inequality constraints to equality constraints by the introduction of additional slack variables. Here, we rather solve their local combinatorial character by computing the projection of the gradient of the objective function onto the cone of feasible directions. This is achieved by solving a dual quadratic programming subproblem whose size equals the number of active or violated constraints. The solution to this problem allows to identify the inequality constraints to which the optimization trajectory should remain tangent. Our second contribution is a formulation of our gradient flow in the context of – infinite-dimensional – Hilbert spaces, and of even more general optimization sets such as sets of shapes, as it occurs in shape optimization within the framework of Hadamard’s boundary variation method. The cornerstone of this formulation is the classical operation of extension and regularization of shape derivatives. The numerical efficiency and ease of implementation of our algorithm are demonstrated on realistic shape optimization problems.

Saul’yev and Group Explicit Methods

The Saul’yev methods for parabolic equations are implicit in form, but can be solved explicitly and are therefore interesting in connection with non-linear problems. Abdullah’s Group Explicit methods are parallel in nature and therefore interesting when using parallel computers. The main objective of this paper is to study the accuracy of these methods. Using global error estimation we show that for all these methods the time step must be bounded by the square of the space step size to ensure a global error which can be estimated. As a curiosity we show that the two original Saul’yev methods in fact solve two different differential equations.

Two numerical methods for heat conduction problems with phase change

A fixed-space-step method and a fixed-time-step method are presented, respectively, for solving the Stefan problems with time-dependent boundary conditions. The evolution of the moving interface and the temperature distribution in the phase change domain are simulated numerically by using two methods for melting in the half-plane and outward spherical solidification. Numerical experiment results show that the numerical results obtained from the two methods are in good agreement for the different test examples, and the two methods can be applied to solve Stefan problems in engineering practice.

The approximate modelling of a “rail vehicle-railway track- substructure” system

A system “railway vehicle–railway track–substructure” was analysed. Rails were modelled as the Bernoulii-Euler beams on an elastic foundation. Two load cases were considered a) static load from the train to the railway track, b) dynamic load from the train moving with the constant velocity. As a result, the fourth-order differential equation was obtained. Both, material data and operating parameters were determined by components of the equation. To solve this equation, the finite difference method was used. This method was described considering such matters as space step, time step, discretization, and moving load modelling. Evaluation of usefulness of a selected method in modelling a railway infrastructure was the purpose of the authors. The obtained results were compared with results received by analytical way. The presented, simplified model: railway vehicle–infrastructure–substructure after appropriative validation will be used later on to analyse various technical solutions and materials in designing railway constructions. Keywords: numerical methods, finite difference method, railway infrastructure, dynamic impact factor

A fast second-order parareal solver for fractional optimal control problems

The gradient projection technique has recently been used to solve the optimal control problems governed by a fractional diffusion equation. It lies in repeatedly solving the state and co-state equations derived from the optimality conditions, and the Crank–Nicolson (CN) scheme, which gives a second-order numerical solution, is a widely used method to solve these two equations. The goal of this paper is to implement the CN scheme in a parallel-in-time manner in the framework of the parareal algorithm. Because of the stiffness of the approximation matrix of the fractional operator, direct use of the CN scheme results in a convergence factor ρ satisfying [Formula: see text] as [Formula: see text] for the parareal algorithm, where [Formula: see text] denotes the space step-size. Here, we provide a new idea to let the parareal algorithm use the CN scheme as the basic component possessing a constant convergence factor [Formula: see text], which is independent of [Formula: see text]. Numerical results are provided to show the efficiency of the proposed algorithm.

Multiresolution Time-Domain Analysis of Multiconductor Transmission Lines Terminated in Linear Loads

This paper derives a multiresolution time-domain (MRTD) scheme for the multiconductor transmission line (MTL) equations based on Daubechies’ scaling functions. The terminations are characterized by a state-variable formulation which allows a general description of the termination networks. For the linear load terminations, a method incorporating the terminal constraints is proposed to work out the scheme at and close to the terminations. The MRTD scheme is implemented with different basis functions for linear components including resistances, inductances, and capacitances. Numerical results show that the MRTD schemes obtain a more stable result than the conventional finite difference time-domain (FDTD) method with a coarse space step.

On the continuum limit for a semidiscrete Hirota equation

In this paper, we propose a new semidiscrete Hirota equation which yields the Hirota equation in the continuum limit. We focus on the topic of how the discrete space step δ affects the simulation for the soliton solution to the Hirota equation. The Darboux transformation and explicit solution for the semidiscrete Hirota equation are constructed. We show that the continuum limit for the semidiscrete Hirota equation, including the Lax pair, the Darboux transformation and the explicit solution, yields the corresponding results for the Hirota equation as δ → 0 .

Stability Analysis of a Fully Coupled Implicit Scheme for Inviscid Chemical Non-Equilibrium Flows

Von Neumann stability theory is applied to analyze the stability of a fully coupled implicit (FCI) scheme based on the lower-upper symmetric Gauss-Seidel (LU-SGS) method for inviscid chemical non-equilibrium flows. The FCI scheme shows excellent stability except the case of the flows involving strong recombination reactions, and can weaken or even eliminate the instability resulting from the stiffness problem, which occurs in the subsonic high-temperature region of the hypersonic flow field. In addition, when the full Jacobian of chemical source term is diagonalized, the stability of the FCI scheme relies heavily on the flow conditions. Especially in the case of high temperature and subsonic state, theCFLnumber satisfying the stability is very small. Moreover, we also consider the effect of the space step, and demonstrate that the stability of the FCI scheme with the diagonalized Jacobian can be improved by reducing the space step. Therefore, we propose an improved method on the grid distribution according to the flow conditions. Numerical tests validate sufficiently the foregoing analyses. Based on the improved grid, theCFLnumber can be quickly ramped up to large values for convergence acceleration.