A grid‐free upwind relaxation scheme for inviscid compressible flows

A new grid‐free upwind relaxation scheme for simulating inviscid compressible flows is presented in this paper. The non‐linear conservation equations are converted to linear convection equations with non‐linear source terms by using a relaxation system and its interpretation as a discrete Boltzmann equation. A splitting method is used to separate the convection and relaxation parts. Least squares upwinding is used for discretizing the convection equations, thus developing a grid‐free scheme which can operate on any arbitrary distribution of points. The scheme is grid free in the sense that it works on any arbitrary distribution of points and it does not require any topological information like elements, faces, edges, etc. This method is tested on some standard test cases. To explore the power of the grid‐free scheme, solution‐based adaptation of points is done and the results are presented, which demonstrate the efficiency of the new grid‐free scheme. Copyright © 2005 John Wiley & Sons, Ltd.     

A simple four-node quadrilateral finite element for plates

A simple and accurate four-node quadrilateral finite element based on the Mindlin plate theory and Kirchhoff constraints is presented for general thin plate bending applications. The derivation of the element stiffness properties is straightforward, starting with a specified eight-node interpolation; usual discrete Kirchhoff (DK) constraints are employed to constrain out the four midside nodes of the element. The present resulting DK element passes patch tests with elements of arbitrary and even highly distorted mesh types. Numerical studies of the element convergence behaviours are undertaken for various plate bending problems so far investigated. It is indicated from comparative examples that fairly good convergence characteristics have been achieved.     

Motion Control by ZV Shaper Synthesis Extended for Fractional Systems and Its Application to CRONE Control

Shaping command input or preshaping is used for reducing system oscillation in motion control. Desired systems inputs are altered so that the system finishes the requested move without residual oscillation. This technique, developed by N.C. Singer and W.P. Seering, is used for example in the aerospace field, in particular in flexible structure control. This paper presents the study of ZV shaper for explicit fractional derivative systems (generalized derivative systems). A robustness study of ZV shaper is then presented and applied to improve second generation CRONE control response time. Results from simulation and from a DC motor bench are also given.     

On the long‐time stability of the Crank–Nicolson scheme for the 2D Navier–Stokes equations

In this article we study the stability for all positive time of the Crank–Nicolson scheme for the two‐dimensional Navier–Stokes equations. More precisely, we consider the Crank–Nicolson time discretization together with a general spatial discretization, and with the aid of the discrete Gronwall lemma and of the discrete uniform Gronwall lemma we prove that the numerical scheme is stable, provided a CFL‐type condition is satisfied. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

A Miura of the Painlevé I Equation and Its Discrete Analogs

We present Miura transformations for the continuous and several discrete Painlev\'e I equations. In the case of the continuous P_I, we use the Hamiltonian formulation of the Painlev\'e equations and show that there exists a Miura transformation between P_I and the binomial, second degree, equation of Cosgrove SD_V. In the case of the discrete P_I's we obtain two different kinds of Miuras. One kind relates a d-P_I to some other d-P_I while the other leads to discrete four-point equations which are the discrete analogs of the derivative of Cosgrove's equation SD_V.     

A Hierarchy of Integrable Lattice Soliton Equations and New Integrable Symplectic Map

Starting from a discrete spectral problem, a hierarchy of integrable lattice soliton equations is derived. It is shown that the hierarchy is completely integrable in the Liouville sense and possesses discrete bi-Hamiltonian structure. A new integrable symplectic map and finite-dimensional integrable systems are given by nonlinearization method. The binary Bargmann constraint gives rise to a Bäcklund transformation for the resulting integrable lattice equations. At last, conservation laws of the hierarchy are presented.     

Age Analysis of Status Updating System with Probabilistic Packet Preemption

The age of information (AoI) metric was proposed to measure the freshness of messages obtained at the terminal node of a status updating system. In this paper, the AoI of a discrete time status updating system with probabilistic packet preemption is investigated by analyzing the steady state of a three-dimensional discrete stochastic process. We assume that the queue used in the system is Ber/Geo/1/2*/η, which represents that the system size is 2 and the packet in the buffer can be preempted by a fresher packet with probability η. Instead of considering the system’s AoI separately, we use a three-dimensional state vector (n,m,l) to simultaneously track the real-time changes of the AoI, the age of a packet in the server, and the age of a packet waiting in the buffer. We give the explicit expression of the system’s average AoI and show that the average AoI of the system without packet preemption is obtained by letting η=0. When η is set to 1, the mean of the AoI of the system with a Ber/Geo/1/2* queue is obtained as well. Combining the results we have obtained and comparing them with corresponding average continuous AoIs, we propose a possible relationship between the average discrete AoI with the Ber/Geo/1/c queue and the average continuous AoI with the M/M/1/c queue. For each of two extreme cases where η=0 and η=1, we also determine the stationary distribution of AoI using the probability generation function (PGF) method. The relations between the average AoI and the packet preemption probability η, as well as the AoI’s distribution curves in two extreme cases, are illustrated by numerical simulations. Notice that the probabilistic packet preemption may occur, for example, in an energy harvest (EH) node of a wireless sensor network, where the packet in the buffer can be replaced only when the node collects enough energy. In particular, to exhibit the usefulness of our idea and methods and highlight the merits of considering discrete time systems, in this paper, we provide detailed discussions showing how the results about continuous AoI are derived by analyzing the corresponding discrete time system and how the discrete age analysis is generalized to the system with multiple sources. In terms of packet service process, we also propose an idea to analyze the AoI of a system when the service time distribution is arbitrary.     

The Optimal Error Estimate of the Fully Discrete Locally Stabilized Finite Volume Method for the Non-Stationary Navier-Stokes Problem

This paper proves the optimal estimations of a low-order spatial-temporal fully discrete method for the non-stationary Navier-Stokes Problem. In this paper, the semi-implicit scheme based on Euler method is adopted for time discretization, while the special finite volume scheme is adopted for space discretization. Specifically, the spatial discretization adopts the traditional triangle P1−P0 trial function pair, combined with macro element form to ensure local stability. The theoretical analysis results show that under certain conditions, the full discretization proposed here has the characteristics of local stability, and we can indeed obtain the optimal theoretic and numerical order error estimation of velocity and pressure. This helps to enrich the corresponding theoretical results.     

ACTIVE CONTROL OF A FLEXIBLE CANTILEVER PLATE WITH MULTIPLE TIME DELAYS

Active control of a flexible cantilever plate with multiple time delays is investigated using the discrete optimal control method. A controller with multiple time delays is presented. In this controller, time delay effect is incorporated in the mathematical model of the dynamic system throughout the control design and no approximations and assumptions are made in the controller derivation, so the system stability is easily guaranteed. Furthermore, this controller is available for both small time delays and large time delays. The feasibility and efficiency of the proposed controller are verified through numerical simulations in the end of this paper.     

Quantum Circuit Optimization for Solving Discrete Logarithm of Binary Elliptic Curves Obeying the Nearest-Neighbor Constrained

In this paper, we consider the optimization of the quantum circuit for discrete logarithm of binary elliptic curves under a constrained connectivity, focusing on the resource expenditure and the optimal design for quantum operations such as the addition, binary shift, multiplication, squaring, inversion, and division included in the point addition on binary elliptic curves. Based on the space-efficient quantum Karatsuba multiplication, the number of CNOTs in the circuits of inversion and division has been reduced with the help of the Steiner tree problem reduction. The optimized size of the CNOTs is related to the minimum degree of the connected graph.