A dissipation‐free numerical method to solve one‐dimensional hyperbolic flow equations

In this paper, a numerical method to capture the shock wave propagation in 1‐dimensional fluid flow problems with 0 numerical dissipation is presented. Instead of using a traditional discrete grid, the new numerical method is built on a range‐discrete grid, which is obtained by a direct subdivision of values around the shock area. The range discrete grid consists of 2 types: continuous points and shock points. Numerical solution is achieved by tracking characteristics and shocks for the movements of continuous and shock points, respectively. Shocks can be generated or eliminated when triggering entropy conditions in a marking step. The method is conservative and total variation diminishing. We apply this new method to several examples, including solving Burgers equation for aerodynamics, Buckley‐Leverett equation for fractional flow in porous media, and the classical traffic flow. The solutions were verified against analytical solutions under simple conditions. Comparisons with several other traditional methods showed that the new method achieves a higher accuracy in capturing the shock while using much less grid number. The new method can serve as a fast tool to assess the shock wave propagation in various flow problems with good accuracy.     

The aliasing‐phenomenon in visual terms

In a recent paper it was shown that the aliasing phenomenon, which leads to a severe identification problem in the estimation of stochastic differential equations, can be overcome by using a polygonal (or higher) approximation for the time paths of the exogenous variables. This work attempts to visualize the problem and presents several simulated trajectories of a continuous time AR(2)‐process (Ornstein‐Uhlenbeck‐process) together with the observationally equivalent structures. Furthermore it is shown that aliasing can even change the analytical properties of the time paths of the system: whereas the first component of the Ornstein‐Uhlenbeck‐process is differentiable, the trajectories of the aliasing structures are continuous, but not differentiable any more.     

Discrete filter operators for large‐eddy simulation using high‐order spectral difference methods

The combination of a high‐order unstructured spectral difference (SD) spatial discretization scheme with sub‐grid scale (SGS) modeling for large‐eddy simulation is investigated with particular focus on the consistent implementation of a structural mixed model based on the scale similarity hypothesis. The difficult task of deriving a consistent formulation for the discrete filter within the SD element of arbitrary order led to the development of a new class of three‐dimensional constrained discrete filters. The discrete filters satisfy a set of selected criteria and are completely local within the SD element. Their weights can be automatically computed at run time from the number of solution points within each element and the expected filter cutoff length scale. The novel discrete filters can be applied to any SGS model involving explicit filtering and to a broad class of high‐order discontinuous finite element numerical schemes. The code is applied to the computation of turbulent channel flows at three Reynolds numbers, namely Re_τ = 180, 395, and 590 (based on the friction velocity u_τ and channel half‐width δ). Results from computations with and without the SGS model are compared against results from direct numerical simulation. The numerical experiments suggest that the results are sensitive to the use of the SGS model, even when a high‐order numerical scheme is used, especially when the grid resolution is kept relatively low and mostly in terms of resolved Reynolds stresses. Results obtained using existing filters based on the projection of the solution over lower‐order polynomial bases are also shown and demonstrate that these filters are inadequate for SGS modeling purposes, mostly because of their inability to enforce the selected cutoff length scale with sufficient accuracy. The use of the similarity mixed formulation proved to be particularly accurate in reproducing SGS interactions, confirming that its well‐known potential can be realized in conjunction with state‐of‐the‐art high‐order numerical schemes.Copyright © 2012 John Wiley & Sons, Ltd.     

The Ablowitz–Ladik hierarchy integrability analysis revisited: the vertex operator solution representation structure

A regular gradient-holonomic approach to studying the Lax type integrability of the Ablowitz–Ladik hierarchy of nonlinear Lax type integrable discrete dynamical systems in the vertex operator representation is presented. The relationship to the Lie-algebraic integrability scheme is analyzed and the connection with the τ-function representation is discussed.     

An Introduction to Influence Theory: Kinematics and Dynamics

Influence theory is a foundational theory of physics that is not based on traditional empirically defined concepts, such as positions in space and time, mass, energy, or momentum. Instead, the aim is to derive these concepts, and their empirically determined relationships, from a more primitive model. It is postulated that there exist things, which are call particles, that influence one another in a discrete and directed fashion resulting in a partially ordered set of influence events. The problem of consistent quantification of the influence events is considered. Observers are modeled as particle chains (observer chains) as if an observer were able to track a particle and quantify the influence events that the particle experiences. From these quantified influence events, consistent quantification of the universe of events based on the observer chains is studied. Herein, the kinematics and dynamics of particles from the perspective of influence theory are both reviewed and further developed.     

On the Motion of Substance in a Channel of a Network: Extended Model and New Classes of Probability Distributions

We discuss the motion of substance in a channel containing nodes of a network. Each node of the channel can exchange substance with: (i) neighboring nodes of the channel, (ii) network nodes which do not belong to the channel, and (iii) environment of the network. The new point in this study is that we assume possibility for exchange of substance among flows of substance between nodes of the channel and: (i) nodes that belong to the network but do not belong to the channel and (ii) environment of the network. This leads to an extension of the model of motion of substance and the extended model contains previous models as particular cases. We use a discrete-time model of motion of substance and consider a stationary regime of motion of substance in a channel containing a finite number of nodes. As results of the study, we obtain a class of probability distributions connected to the amount of substance in nodes of the channel. We prove that the obtained class of distributions contains all truncated discrete probability distributions of discrete random variable ω which can take values 0,1,⋯,N. Theory for the case of a channel containing infinite number of nodes is presented in Appendix A. The continuous version of the discussed discrete probability distributions is described in Appendix B. The discussed extended model and obtained results can be used for the study of phenomena that can be modeled by flows in networks: motion of resources, traffic flows, motion of migrants, etc.     

Bifurcation analysis on a discrete model of Nicholson's blowflies

In this paper, the discrete Nicholson's blowflies model with delay is considered. First, the stability of the equilibria of the system is investigated by analyzing the characteristic equation and then the existence of fold and Neimark–Sacker bifurcations are verified. Subsequent to that, the direction and stability of the bifurcation are determined by using the normal form theory and center manifold theorem. Finally, some numerical simulations are carried out in order to support the results of mathematical analysis.     

最小二乘B样条函数在火箭发动机数据处理中的应用

在固体火箭发动机地面试验数据处理中,通过应用最小二乘三次B样条函数拟合的方法,进行野值辨识和修复。文中阐述了实际应用中的步骤及应注意的几点问题。为避免常规的控制序列中含有野值而影响数据辨识的问题,提出差别选取控制点循环过滤的方法,实现精度更高的野值辨识。进而采用门限判别方法,实现野值的修复。通过实测数据处理的应用表明,该算法对单个和成片野值的辨识度都很高,适用于火箭发动机地面试验数据处理。