THE STRUCTURE AND APPROXIMATION OF A.S. SELF-SIMILAR SET

The structure of any a.s. self-similar set K(w) generated by a class of random elements {gn,wσ} taking values in the space of contractive operators is given and the approximation of K(w) by the fixed points {Pn,wσ} of {gn,ow} is obtained. It is useful to generate the fractal in computer.     

REPRESENTATIONS OF THE TWO PARAMETER DEFORMATION OF THE VIRASORO ALGEBRA

This paper constructs a class of Harish-Chandra modules with multiplicity ≤1 of the two parameter deformation of Virasoro algebra and proves a classification theorem.     

ANALYSIS OF AN SI EPIDEMIC MODEL WITH NONLINEAR TRANSMISSION AND STAGE STRUCTURE

A disease transmission model of SI type with stage structure is formulated. The stability of disease free equilibrium, the existence and uniqueness of an endemic equilibrium, the existence of a global attractor are investigated.     

自适应光学中的非等晕性

本文讨论了自适应光学中非等晕域对补偿效果的影响,提出了一种减小非等晕性误差的新方法—位相梯度法。分析结果表明,该方法可显著增大有效校正的角范围,使非等晕性误差的影响大大减小。我们预期位相梯度法有望解决自适应光学中信标的非等晕性问题。     

变参数波振器中小信号增益公式

利用微扰展开技术推导出变参数波振器的小信号增益两个近似求积表达式并将其计算结果与数值模拟结果进行了比较,二者吻合很好。利用近似解析式对小信号增益进行了初步探讨,得到了电子入射能量可低于初始谐振能,能散度允许范围受波振器设计影响以及降低锥度改变率可提高小信号增益等新结论。     

电感耦合等离子体原子发射光谱分析中光谱干扰校正卡尔曼滤波法研究

本文利用电感耦合等离子体原子发射光谱多色仪的扫描功能,用卡尔曼滤波法对各种光谱干扰进行校正。结果表明,该法能处理各种类型光谱干扰,不需要样品基体匹配,其测定回收率明显优于在峰法和离峰法,具有简便、准确等优点。     

基于增广Lagrange函数的RQP方法

Recursive quadratic programming is a family of techniques developd by Bartholomew-Biggs and other authors for solving nonlinear programming problems.This paperdescribes a new method for constrained optimization which obtains its search di-rections from a quadratic programming subproblem based on the well-known aug-mented Lagrangian function.It avoids the penalty parameter to tend to infinity.We employ the Fletcher‘s exact penalty function as a merit function and the use of an approximate directional derivative of the function that avoids the need toevaluate the second order derivatives of the problem functions.We prove that thealgorithm possesses global and superlinear convergence properties.At the sametime, numerical results are reported.     

红黑排序混合算法收敛速度分析

The algorithm of applying the block Gauss elimination to the Red-Black or-dering matrix to reduce the order of the system then solve the reduced system byiterative methods is called Hybrid Red-Black Ordering algorithm.In this paper,we discuss the convergence rate of the hybrid methods combined with JACOBI,CG,GMRES(m).Theoretical analysis shows that without preconditioner thesethree hybrid methods converge about 2 times as fast as the corresponding natural ordering methods.For the case that all the eigenvalues is near the real axis, the GMRES(m) algorithm converges about 3 times faster than the natural ordering GMRES(m).Various numerical experiments are presented.For large scale prob-lem with preconditioners, numerical experiments show that the GMRES(m) hybrid methods converge from about 3 times to even 5 times as fast as the natural order-ing methods and the computing time is reduced to about 1/3 even 1/6 of that of the natural ordering methods.     

AN ALGORITHM FOR JORDAN CANONICAL FORM OF A QUATERNION MATRIX

In this paper, we first introduce a concept of companion vector, and study the Jordan canonical forms of quaternion matrices by using the methods of complex rep resentation and companion vector, not only give out a practical algorithm for Jordan canonical form J of a quaternion matrix A, but also provide a practical algorithm for corresponding nonsingular matrix P with P-1AP = J.     

p阶平均曲率算子Dirichlet问题的无穷多个解

§ 1　 IntroductionSince the Mountain Pass Theorem came out,the existence of nontrivial solutions,pos-sibly multiple,ofnonlinear elliptic equations has been extensively studied.In this paper,weconsider the following Dirichlet problem for p-(generalized) mean curvature operator:-div((1 +| u|2 ) p- 22 u) =f(x,u) ,　 x∈Ω,u∈ W1 ,p0 (Ω ) , (1 .1 )whereΩ is a bounded domain in Rn(n>p>1 ) with smooth boundary Ω.First let us recall the following Dirichletproblem for p-Laplacian:-Δpu≡ -div…