非线性互补问题的SQP方法

In this paper, the nonlinear complementarity problem is transformed into the least squares problem with nonnegative constraints ,and a SQP algorithm for this reformulation based on a damped Gauss-Newton type method is presented. It is shown that the algorithm is globally and locally superlinearly (quadratically) convergent without the assumption of monotonicity.     

EXACT SOLUTIONS OF SOME FIFTH——ORDER NONLINEAR EQUATIONS

Abstract. To solve the nonlinear partial differential equations is changed into solving some alge-braic equations by using the function U to be expressed as linear independent functions. Thenew soliton and periodic solutions of some fifth-order nonlinear partial differential equations areobtained.     

整图的构造

In this paper, some new classes of integral graphs are given in two new ways. It is proved that the problem of finding such integral graphs is equivalent to the problem of solving diophantine equations. Some classes are infinite. The discovery of these classes is a new contribution to the search of such integral graphs.     

The multifit algorithm for set partitioning containing kernels

This pager investigates the set partitioning containing kernels. This problem can alsobe considered as the identical machine scheduling prohlem with nonsimultaneous machine release times. That the algorithm MULTIFIT has a worst ease bound of 6/5 is proved. Throughcombining MULTIFIT and LPT. an algorithm MULTILPT with a worat case bound of 7/6 has been obtained.     

Asymptotic efficient estimation in semiparametric nonlinear regression models

§１ＩｎｔｒｏｄｕｃｔｉｏｎＣｏｎｓｉｄｅｒｔｈｅｆｉｘｅｄｄｅｓｉｇｎｓｅｍｉｐａｒａｍｅｔｒｉｃｎｏｎｌｉｎｅａｒｒｅｇｒｅｓｓｉｏｎｍｏｄｅｌｓｇｉｖｅｎｂｙｙｉ＝ｆ（ｘｉ,θ）＋λ（ｔｉ）＋εｉ,ｉ＝１,．．．,ｎ,（１）ｗｈｅｒｅｆ（,）ｉ...     

Liénard方程至多存在n个极限环的充分条件

在文[7,8]中对Lienard方程提出状态函数的概念.本文我们将极限环存在性的研究转化为微积分中连续函数(状态函数)零点的研究,给出了Lienard方程至多存在n个极限环的充分条件.最后证明了A.Lins,W.de Melo,C.C.Pugh的猜想.     

最大度不小于6的伪-Halin图的完备色数

设G为2-连通平面图,若存在G的面f₀,其中f₀的边界构成的圈上无弦且V（f₀）中的点的度至少为3,使得在G中去掉f₀边界上的所有边后得到的图为除V（f₀）中的点外度不小于3的树T,则称G为伪-Halin图;若V（f₀）中的点全为3度点,则称G为Halin-图.本文研究了这类图的完备色数,并证明了对△（G）≥ 6的伪-Halin图 G有 X_C（C）=△（G）+1.其中△（G）和X_C（G）分别表示G的最大度和完备色数.     

LTE computation of axisymmetric arc-flow interaction incircuit-breakers

A numerical procedure for the computation of arc-flow interaction in gas-blast circuit breakers is presented. In the proposed approach the flow is obtained via the solution of the Euler equations and the coupling with the arc by a source term in the energy equation. This source term is composed of an ohmic energy production part and a radiative transport part. The equations are solved by a time-marching procedure using a finite-volume discretization. The model is applied to the computation of an axisymmetric arc in a model breaker. The results reproduce qualitatively the major features of arc-flow interaction and show the presence of a localized form of choking of the flow around the arc boundary     

The E-Functional for Some Pairs of Groups

We describe a new algorithm to compute the eigenvalues of singular Sturm-Liouville problems with separated self-adjoint boundary conditions for both the limit-circle nonoscillatory and oscillatory cases. Also described is a numerical code implementing this algorithm and how it compares with SLEIGN. The latter is the only effective general purpose software available for the computation of the eigenvalues of singular Sturm-Liouville problems.     

Self-similar fractals with a given dimension and the application to quantitative linguistics

Stimulated by the modeling of language structures, we present three adequate constructions of self-similar fractals with a given dimension. A concrete example of an application to quantitative linguistics is then supplied.