A NOTE ON THE GLOBAL SOLUTIONS OF A SEMILINEAR REACTION DIFFUSION SYSTEM

ＡＮＯＴＥＯＮＴＨＥＧＬＯＢＡＬＳＯＬＵＴＩＯＮＳＯＦＡＳＥＭＩＬＩＮＥＡＲＲＥＡＣＴＩＯＮＤＩＦＦＵＳＩＯＮＳＹＳＴＥＭ（王明新，吴永辉）￥ＷａｎｇＭｉｎｇｘｉｎ（Ｄｅｐｔ．ｏｆＭａｔｈｅｍａｔｉｃｓＭｅｃｈａｎｉｃｓ，ＳｏｕｔｈｅａｓｔＵｎｉｖ，...     

ON THE EXISTENCE OF GLOBAL GENERAL SOLUTIONS OF POLYNOMIAL SYSTEMS

ＯＮＴＨＥＥＸＩＳＴＥＮＣＥＯＦＧＬＯＢＡＬＧＥＮＥＲＡＬＳＯＬＵＴＩＯＮＳＯＦ　ＰＯＬＹＮＯＭＩＡＬＳＹＳＴＥＭＳＺＨＡＯＸＩＡＯＱＩＡＮＧ（赵晓强）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ｔｈｅＣｈｉｎｅｓｅＡｃａｄｅｍｙｏ...     

BANDWIDTH SELECTION IN NONPARAMETRIC SPECTRAL DENSITY ESTIMATION OF THE STATIONARY GAUSSIAN PROCESS

ＢＡＮＤＷＩＤＴＨＳＥＬＥＣＴＩＯＮＩＮＮＯＮＰＡＲＡＭＥＴＲＩＣＳＰＥＣＴＲＡＬＤＥＮＳＩＴＹＥＳＴＩＭＡＴＩＯＮＯＦＴＨＥＳＴＡＴＩＯＮＡＲＹＧＡＵＳＳＩＡＮＰＲＯＣＥＳＳ￥ＹＵＤＡＮ（于丹）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｓＳｃｉｅｎｃｅ，...     

RANDOM WEIGHTING APPROXIMATION IN LINEAR REGRESSION MODELS

ＲＡＮＤＯＭＷＥＩＧＨＴＩＮＧＡＰＰＲＯＸＩＭＡＴＩＯＮＩＮＬＩＮＥＡＲＲＥＧＲＥＳＳＩＯＮＭＯＤＥＬＳＳＨＩＪＩＡＮ（ＤｅｐａｒｔｍｅｎｔｏｆＰｒｏｂａｂｉｌｉｔｙａｎｄＳｔａｔｉｓｔｉｃｓ，ＰｅｋｉｎｇＵｎｉｖｅｒｓｉｔｙ，Ｂｅｉｊｉｎｇ１００８...     

REPRESENTATIONS AND ENUMERATIONS OF SEMIORDERS WITH HEIGHT ONE

ＲＥＰＲＥＳＥＮＴＡＴＩＯＮＳＡＮＤＥＮＵＭＥＲＡＴＩＯＮＳＯＦＳＥＭＩＯＲＤＥＲＳＷＩＴＨＨＥＩＧＨＴＯＮＥＷｕＳｈｉｑｕａｎ（巫世权）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉｅｎｃｅｓＰ...     

ARONSON'S ESTIMATES AND CONDITIONAL DIFFUSION PROCESSES

ＡＲＯＮＳＯＮ＇ＳＥＳＴＩＭＡＴＥＳＡＮＤＣＯＮＤＩＴＩＯＮＡＬＤＩＦＦＵＳＩＯＮＰＲＯＣＥＳＳＥＳＱＩＡＮＺＨＯＮＧＭＩＮ（钱忠民）ＷＥＩＧＵＯＱＩＡＮＧ（魏国强）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃａｌＳｔａｔｉｓｔｉｃｓ，ＥａｓｔＣｈ...     

A GENERATOR AND A SIMPLEX SOLVER FOR NETWORK PIECEWISE LINEAR PROGRAMS

ＡＧＥＮＥＲＡＴＯＲＡＮＤＡＳＩＭＰＬＥＸＳＯＬＶＥＲＦＯＲＮＥＴＷＯＲＫＰＩＥＣＥＷＩＳＥＬＩＮＥＡＲＰＲＯＧＲＡＭＳＳＵＮＪＩＥ（孙捷）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍｅｍａｔｉｃｓ，ｔｈｅＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉ...     

TWO NEW CONSTRUCTIONS OF CARTESIAN AUTHENTICATION CODES FROM SYMPLECTIC GEOMETRY

ＴＷＯＮＥＷＣＯＮＳＴＲＵＣＴＩＯＮＳＯＦＣＡＲＴＥＳＩＡＮＡＵＴＨＥＮＴＩＣＡＴＩＯＮＣＯＤＥＳＦＲＯＭＳＹＭＰＬＥＣＴＩＣＧＥＯＭＥＴＲＹＧＡＯＹＯＵＡＮＤＺＯＵＺＥＮＧＪＩＡ（ＤｅｐａｒｔｍｅｎｔｏｆＢａｓｉｃＳｃｉｅｎｃｅ，Ｎｏｒｔｈｅａｓｔ...     

On Bahadur asymptotic efficiency in a semiparametric regression model

ＯＮＢＡＨＡＤＵＲＡＳＹＭＰＴＯＴＩＣＥＦＦＩＣＩＥＮＣＹＩＮＡＳＥＭＩＰＡＲＡＭＥＴＲＩＣＲＥＧＲＥＳＳＩＯＮＭＯＤＥＬＬＩＡＮＧＨＵＡ（梁华）;ＣＨＥＮＧＰＩＮＧ（成平）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｓＳｃｉｅｎｃｅ,ｔｈｅＣｈｉｎｅｓｅＡ...     

ONE DIMENSIONAL FILTRATION PROBLEM IN PARTIALLY SATURATED LAYERED POROUS MEDIA

ＯＮＥＤＩＭＥＮＳＩＯＮＡＬＦＩＬＴＲＡＴＩＯＮＰＲＯＢＬＥＭＩＮＰＡＲＴＩＡＬＬＹＳＡＴＵＲＡＴＥＤＬＡＹＥＲＥＤＰＯＲＯＵＳＭＥＤＩＡ￥ＸＩＡＯＳＨＵＴＩＥ（萧树铁）（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，Ｔｓｉｎｇｈｕａ...     

Finding roots of a real polynomial simultaneously by means of Bairstow's method

Aberth's method for finding the roots of a polynomial was shown to be robust. However, complex arithmetic is needed in this method even if the polynomial is real, because it starts with complex initial approximations. A novel method is proposed for real polynomials that does not require any complex arithmetic within iterations. It is based on the observation that Aberth's method is a systematic use of Newton's method. The analogous technique is then applied to Bairstow's procedure in the proposed method. As a result, the method needs half the computations per iteration than Aberth's method. Numerical experiments showed that the new method exhibited a competitive overall performance for the test polynomials.     

A new method for decomposition in the Jacobian of small genus hyperelliptic curves

Decomposing a divisor over a suitable factor basis in the Jacobian of a hyperelliptic curve is a crucial step in an index calculus algorithm for the discrete log problem in the Jacobian. For small genus curves, in the year 2000, Gaudry had proposed a suitable factor basis and a decomposition method. In this work, we provide a new method for decomposition over the same factor basis. The advantage of the new method is that it admits a sieving technique which removes smoothness checking of polynomials required in Gaudry’s method. Also, the total number of additions in the Jacobian required by the new method is less than that required by Gaudry’s method. The new method itself is quite simple and we present some example decompositions and timing results of our implementation of the method using Magma.     

Derivative-Free Filter Simulated Annealing Method for Constrained Continuous Global Optimization

In this paper, a simulated-annealing-based method called Filter Simulated Annealing (FSA) method is proposed to deal with the constrained global optimization problem. The considered problem is reformulated so as to take the form of optimizing two functions, the objective function and the constraint violation function. Then, the FSA method is applied to solve the reformulated problem. The FSA method invokes a multi-start diversification scheme in order to achieve an efficient exploration process. To deal with the considered problem, a filter-set-based procedure is built in the FSA structure. Finally, an intensification scheme is applied as a final stage of the proposed method in order to overcome the slow convergence of SA-based methods. The computational results obtained by the FSA method are promising and show a superior performance of the proposed method, which is a point-to-point method, against population-based methods.     

A novel algorithm based on parameterization method for calculation of curvature of the free surface flows

In this paper, a new approach based on parameterization method is presented for calculation of curvature on the free surface flows. In some phenomena such as droplet and bubble, surface tension is prominent. Therefore in these cases, accurate estimation of the curvature is vital. Volume of fluid (VOF) is a surface capturing method for free surface modeling. In this method, free surface curvature is calculated based on gradient of scalar transport parameter which is regarded as original method in this paper. However, calculation of curvature for a circle and other known geometries based on this method is not accurate. For instance, in practice curvature of a circle in interface cells is constant, while this method predicts different curvatures for it. In this research a novel algorithm based on parameterization method for improvement of the curvature calculation is presented. To show the application of parameterization method, two methods are employed. In the first approach denoted by, three line method, a curve is fitted to the free surface so that the distance between curve and linear interface approximation is minimized. In the second approach namely four point method, a curve is fitted to intersect points with grid lines for central and two neighboring cells. These approaches are treated as calculus of variation problems. Then, using the parameterization method, these cases are converted into the sequences of time-varying nonlinear programming problems. With some treatments a conventional equivalent model is obtained. It is finally proved that the solution of these sequences in the models tends to the solution of the calculus of variation problems. For verification of the presented methods, curvature of some geometrical shapes such as circle, elliptic and sinusoidal profile is calculated and compared with original method used in VOF process and analytical solutions. Finally, as a more practical problem, spurious currents are studied. The results showed that more accurate curve prediction is obtained by these approaches than the original method in VOF approach.     

A FOURTH ORDER DERIVATIVE-FREE OPERATOR MARCHING METHOD FOR HELMHOLTZ EQUATION IN WAVEGUIDES

A fourth-order operator marching method for the Helmholtz equation in a waveguide is developed in this paper. It is derived from a new fourth-order exponential integrator for linear evolution equations. The method improves the second-order accuracy associated with the widely used step-wise coupled mode method where the waveguide is approximated by segments that are uniform in the propagation direction. The Helmholtz equation is solved using a one-way reformulation based on the Dirichlet-to-Neumann map. An alternative version closely related to the coupled mode method is also given. Numerical results clearly indicate that the method is more accurate than the coupled mode method while the required computing effort is nearly the same.     

A Random Numerical Method with Application in Combustion

This paper presents a random numerical method which combines the random vortex method and the random choice method. A random choice method is used for the modeling reaction-diffusion system. The splitting of source terms in two dimensions for the random choice method is tested. A hybrid random vortex method is used for solving the Navier-Stokes equation which governs the fluid motion. With the assumption of incompressibility, the fluid motion can be uncoupled from the chemistry. The method is applied to a flow passing a circular cylinder which is kept cold or heated. In both cases the method demonstrates an ability to resolve turbulent effects on flame front propagation.     

Chaotic dynamics of a third-order Newton-type method

The dynamics of a classical third-order Newton-type iterative method is studied when it is applied to degrees two and three polynomials. The method is free of second derivatives which is the main limitation of the classical third-order iterative schemes for systems. Moreover, each iteration consists only in two steps of Newton's method having the same derivative. With these two properties the scheme becomes a real alternative to the classical Newton method. Affine conjugacy class of the method when is applied to a differentiable function is given. Chaotic dynamics have been investigated in several examples. Applying the root-finding method to a family of degree three polynomials, we have find a bifurcation diagram as those that appear in the bifurcation of the logistic map in the interval.     

基于数值分布的激励型综合评价方法

针对激励评价中的等级划分问题,本文提出了一种基于数值分布的等级划分方法,相比于现有的等级划分方法,该方法能够综合考虑数值分布情况来划分等级,并结合本文提出的等级划分法对密度算子进行拓展,提出了一种基于数值分布的激励型综合评价方法。首先本文从数值分布的角度提出了一种新的等级划分方法,从而得出各等级区间的等级区间分界点;其次确定等级系数,并结合指标值和等级区间分界点给出各指标的权向量,给出一种不需要进行归一化处理的等级权向量确定方法,该方法能够较好的解决归一化处理带来的不公平性;再次根据密度算子思想对评价数据进行集结得出评价结果;最后通过一个算例对该方法进行验证,结果表明该方法可以实现对被评价对象科学激励的作用。该方法尤其适用于企业员工激励、省市综合排名、高校人才选拔等问题。     

A new symmetric linear eight-step method with fifth trigonometric order for the efficient integration of the Schrödinger equation

On the basis of a classical symmetric eight-step method, an optimized method with fifth trigonometric order for the numerical solution of the Schrödinger equation is developed in this work. The local truncation error analysis of the method proves the decrease of the maximum power of the energy in relation to the corresponding classical method, which renders the method highly efficient. This is confirmed by comparing the method to other methods from the literature while integrating the equation. The superiority of the method is strengthened by the existence of a larger interval of periodicity of the new method in comparison to the corresponding classical method.     

Clustering of functional data in a low-dimensional subspace

To find optimal clusters of functional objects in a lower-dimensional subspace of data, a sequential method called tandem analysis, is often used, though such a method is problematic. A new procedure is developed to find optimal clusters of functional objects and also find an optimal subspace for clustering, simultaneously. The method is based on the k-means criterion for functional data and seeks the subspace that is maximally informative about the clustering structure in the data. An efficient alternating least-squares algorithm is described, and the proposed method is extended to a regularized method. Analyses of artificial and real data examples demonstrate that the proposed method gives correct and interpretable results.