周期单元中相对论Boltzmann方程初值问题整体解的存在性

本文证明了周期单元中带有某些硬相互作用的相对论Ｂｏｌｔｚｍａｎｎ方程初值问题在初值满足质量、能量和熵有限的条件下具有一个整体温和解．     

线性常微分方程组解的特征数的估计

复数域上线性系统ｘ＝Ａ（ｔ）ｘ，当Ａ（ｔ）＝（ａｉｊ（ｔ））ｎ×ｎ具有（ｎ，Ｎ，ｒ） 差异性质且ｒｎ时，解的特征数ｊ有估计λｊ－ｌｉｍｔ→∞１ｔ∫ｔｔ０Ｒｅａｊ（τ）ｄτｎ－１ｒ＋１－ｎｌｉｍｔ→∞１ｔ∫ｔｔ０Ａ（τ）ｄτ，ｊ＝１，２，…，ｎ，其中Ａ（ｔ）＝ｍａｘ｛｜ａｉｊ（ｔ）｜：ｉ，ｊ＝１，２，…，ｎ，ｉ≠ｊ．｝     

运动水平平板上混合对流的群论分析

本文用变换群理论对运动水平平板混合对流边界层流动的动量、能量和浓度扩散方程进行了分析，得到了与X4/(7-5n)成正比的壁面温度分布和浓度分布，同时壁面运动速度正比于X(3-n)／(7-5n)时存在相似性解．导出了相似性解方程，用四阶Runge－Kutta方法进行了计算，给出了Pr＝0．72　和Sc，K1，K2，K3参数下的速度、温度和浓度分布，得出了各参数对流场、温度场的影响。     

Global Optimization of a Quadratic Functional with Quadratic Equality Constraints, Part 2

In this paper, we investigate a constrained optimization problem with a quadratic cost functional and two quadratic equality constraints. It is assumed that the cost functional is positive definite and that the constraints are both feasible and regular (but otherwise they are unrestricted quadratic functions). Thus, the existence of a global constrained minimum is assured. We develop a necessary and sufficient condition that completely characterizes the global minimum cost. Such a condition is of essential importance in iterative numerical methods for solving the constrained minimization problem, because it readily distinguishes between local minima and global minima and thus provides a stopping criterion for the computation. The result is similar to one obtained previously by the authors. In the previous result, we gave a characterization of the global minimum of a constrained quadratic minimization problem in which the cost functional was an arbitrary quadratic functional (as opposed to positive-definite here) and the constraints were at least positive-semidefinite quadratic functions (as opposed to essentially unrestricted here).     

On Producing Multiple Solutions Using Repeated Trials

The number of trials that is required by an algorithm to produce a given fraction of the problem solutions with a specified level of confidence is analyzed. The analysis indicates that the number of trials required to find a large fraction of the solutions rapidly decreases as the number of solutions obtained on each trial by an algorithm increases. In applications where multiple solutions are sought, this decrease in the number of trials could potentially offset the additional computational cost of algorithms that produce multiple solutions on a single trial. The analysis framework presented is used to compare the efficiency of a homotopy algorithm to that of a Newton method by measuring both the number of trials and the number of calculations required to obtain a specified fraction of the solutions.     

Fractional programming and characterization of some vertices of the feasible region

This paper considers a problem of nonlinear programming in which the objective function is the ratio of two linear functions and the constraints define a bounded and connected feasible region. Using a coordinate transformation, this problem is transformed into a simpler one, whose geometric interpretation is of particular significance. The transformation leads to a characterization of some special vertices of the feasible region from both the theoretical and operational points of view.     

A globally convergent Newton method for solving strongly monotone variational inequalities

Variational inequality problems have been used to formulate and study equilibrium problems, which arise in many fields including economics, operations research and regional sciences. For solving variational inequality problems, various iterative methods such as projection methods and the nonlinear Jacobi method have been developed. These methods are convergent to a solution under certain conditions, but their rates of convergence are typically linear. In this paper we propose to modify the Newton method for variational inequality problems by using a certain differentiable merit function to determine a suitable step length. The purpose of introducing this merit function is to provide some measure of the discrepancy between the solution and the current iterate. It is then shown that, under the strong monotonicity assumption, the method is globally convergent and, under some additional assumptions, the rate of convergence is quadratic. Limited computational experience indicates the high efficiency of the proposed method.     

某些椭圆算子基本解之间的关系

本文在适当的假设下.给出了某些变系数椭圆算子基本解间的一些关系.可用来研究一些椭圆算子解的性质.     

叶栅全三维粘性反问题的数值解

本文发展了一种解叶栅全三维粘性反问题的新的数值方法.基于非正交曲线坐标与相应的非正交速度分量下完全守恒型的Navier－Stokes方程,全三维反问题规定叶片表面的无量纲压力分布反求叶型。计算中叶片表面的边界条件采用一种特殊的方式来处理，即一方面强加给定的压力分布条件,另方面叶面的几何位置在迭代过程中又是可移动的，其移动速度将与Navier—Stokes方程在当地的解联系起来，从而形成一种解定常问题的新的不定常过程.试算证明了本文方法的可行性。     

非线性系统两变量控制下的分枝特性

采用分枝理论推导非线性系统两变量P和PI控制下的分枝特性,所导得的几个定理阐明了简单分枝点和Hopf分枝点的位置和性质。一个简化精馏塔模型用于演示这一过程,展示出精馏塔系统在闭环时,可能出现多态和极限环。