An implicit characteristic-flux-averaging method for the euler equations for real gases

A formulation of an implicit characteristic-flux-averaging method for the unsteady Euler equations with real gas effects is presented. Incorporation of a real gas into a general equation of state is achieved by considering the pressure as a function of density and specific internal energy. The Ricmann solver as well as the flux-split algorithm are modified by introducing the pressure derivatives with respect to density and internal energy. Expressions for calculating the values of the flow variables for a real gas at the cell faces are derived. The Jacobian matrices and the eigenvectors are defined for a general equation of state. The solution of the system of equations is obtained by using a mesh-sequencing method for acceleration of the convergence. Finally, a test case for a simple form of equation of state displays the differences from the corresponding solution for an ideal gas.     

Theory of Valuations on Manifolds: A Survey

This is a non-technical survey of a recent theory of valuations on manifolds constructed in [A10], [A11], [AF] and [A12], and actually a guide to this series of articles. We also review some recent related results obtained by a number of people. Received: February 2006, Revision: June 2006, Accepted: June 2006     

聚能射流的断裂时间

从描述聚能射流失稳的一维近似方程出发，导出了聚能射流断裂时间的近似公式。这个近似公式定量显示了屈服应力、本构关系、粘度和径向收缩效应等对射流断裂时间的影响，在４个不同的特殊近似下，可以自然演化为近１０年来所发表的几个半经验解析公式，并且在合理的参数范围内，公式给出的断裂时间曲线覆盖了射流断裂时间的全部实验点。     

On the phase space approach to complexity

We elaborate in some detail on a new phase space approach to complexity, due to Y.-C. Zhang. We show in particular that the connection between maximal complexity and power law noise or correlations can be derived from a simple variational principle. For a 1D signal we find 1/f noise, in accordance with Zhang.     

THE SOLUTION OF _b－EQUATION OF （P，Q）－FORMS AND IT＇S L~P＆HOLDER ESTIMATES ON A STEIN MANIFOLD

ＴＨＥＳＯＬＵＴＩＯＮＯＦ_ｂ－ＥＱＵＡＴＩＯＮＯＦ（Ｐ，Ｑ）－ＦＯＲＭＳＡＮＤＩＴ＇ＳＬ￣Ｐ＆ＨＯＬＤＥＲＥＳＴＩＭＡＴＥＳＯＮＡＳＴＥＩＮＭＡＮＩＦＯＬＤ￥ＷｕＸｉａｏｑｉｎ（ＤｅｐｔｏｆＭａｔｈ，ＪｉｍｅｉＴｅａｃｈｅｒｓＣｏｌｌｅｇｅＸｉａ?..     

Gk^d图的平面性和平面图的色数

利用欧拉公式研究了Gdk图的平面性,获得了一个重要定理,并由此得到了关于平面图色数的一个结论.     

Clustering of spectra and fractals of regular graphs

We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and variance of the exponentials of graph eigenvalues cluster around a line segment that we call a filar. Zooming-in reveals that this cluster splits into smaller segments (filars) labeled by the number of triangles in graphs. Further zooming-in shows that the smaller filars split into subfilars labeled by the number of quadrangles in graphs, etc. We call this fractal structure, discovered in a numerical experiment, a multifilar structure. We also provide a mathematical explanation of this phenomenon based on the Ihara-Selberg trace formula, and compute the coordinates and slopes of all filars in terms of Bessel functions of the first kind.     

模糊事件贝叶斯公式

讨论了模糊事件的概率及其基本性质 ,并通过对经典贝叶斯公式的推广 ,提出了模糊事件的贝叶斯公式 .     

Assessment of some iterative methods for non-symmetric linear systems arising in computational fluid dynamics

Various tests have been carried out in order to compare the performances of several methods used to solve the non-symmetric linear systems of equations arising from implicit discretizations of CFD problems, namely the scalar advection-diffusion equation and the compressible Euler equations. The iterative schemes under consideration belong to three families of algorithms: relaxation (Jacobi and Gauss-Seidel), gradient and Newton methods. Two gradient methods have been selected: a Krylov subspace iteration method (GMRES) and a non-symmetric extension of the conjugate gradient method (CGS). Finally, a quasi-Newton method has also been considered (Broyden). The aim of this paper is to provide indications of which appears to be the most adequate method according to the particular circumstances as well as to discuss the implementation aspects of each scheme.     

一类数论函数的性质(Ⅱ)

For any given positive integer n≥1,the Euler functionφ(n) is defined to be the number of positive integers not exceeding n,which is relatively prime to n.ω(n) is defined to be the number of different prime divisors of n.In order to know the solvability of the function ofφ(φ(φ(n)))=2~(ω(n)),properties of the number theoretical functionφ(φ(n)) is studied in the paper.