迭代的计算与估计

对高次多项式函数这类非线性映射给出了一般 n次迭代的一个计算结果 ,还讨论了一维欧氏空间中一些非多项式型映射的迭代 .在二维欧氏空间中 ,我们给出了几类特殊的非线性迭代的结果 .对于一些难以精确计算迭代表达式的映射 ,我们给出了其迭代的估计 .     

Multisplitting Iteration Schemes for Solving a Class of Nonlinear Complementarity Problems

We consider several synchronous and asynchronous multisplitting iteration schemes for solving aclass of nonlinear complementarity problems with the system matrix being an H-matrix.We establish theconvergence theorems for the schemes.The numerical experiments show that the schemes are efficient forsolving the class of nonlinear complementarity problems.     

Frozen Landweber Iteration for Nonlinear Ill-Posed Problems

In this paper we propose a modification of the Landweber iteration termed frozen Landweberiteration for nonlinear ill-posed problems.A convergence analysis for this iteration is presented.The numericalperformance of this frozen Landweber iteration for a nonlinear Hammerstein integral equation is compared withthat of the Landweber iteration.We obtain a shorter running time of the frozen Landweber iteration based onthe same convergence accuracy.     

牛顿碰撞球的解释与分析

对牛顿碰撞球的常规碰撞形式和混合联珠单球碰撞形式做了理论分析和解释.在常规碰撞时,将悬线(钓鱼线)先悬挂小球一段时间后组装仪器,可克服悬线的拉力.在混合联珠单球碰撞时,根据理论分析,选取大球和小球的质量比为27∶8时,演示效果较好.     

用干涉方法测量薄膜应力

基于基片弯曲法和牛顿环的基本原理,使用He-Ne激光器、扩束镜、凸透镜和带分光镜的移测显微镜,搭建了薄膜应力测量装置.采用直流溅射法制备了厚度为30~144 nm的银薄膜,衬底采用厚度为0.15 mm、直径为18 mm的圆形玻璃片.实验发现,薄膜厚度对银薄膜的内应力有显著的影响,在薄膜厚度很小时,随着薄膜厚度的增加,应力迅速增大,达到最大值后,随着厚度的继续增加,薄膜应力下降较快并趋于稳定值.     

New light on Hensel''s lemma

The historical development of Hensel's lemma is briefly discussed (Section 1). Using Newton polygons, a simple proof of a general Hensel's lemma for separable polynomials over Henselian fields is given (Section 3). For polynomials over algebraically closed, valued fields, best possible results on continuity of roots (Section 4) and continuity of factors (Section 6) are demonstrated. Using this and a general Krasner's lemma (Section 7), we give a short proof of a general Hensel's lemma and show that it is, in a certain sense, best possible (Section 8). All valuations here are non-Archimedean and of arbitrary rank. The article is practically self-contained.     

The Newton filtration and d-determination of bifurcation problems related to C~0 contact equivalence

In this paper, from the Newton filtration's point of view, we construct the singular Riemannian metric and use the method in singular theory to study the bifurcation problems, and give the sufficient condition of d-determination of bifurcation problems with respect to C0 contact equivalence. The special cases of the main result in this paper are the results of Sun Weizhi and Zou Jiancheng.     

Inexact Newton methods for the nonlinear complementarity problem

An exact Newton method for solving a nonlinear complementarity problem consists of solving a sequence of linear complementarity subproblems. For problems of large size, solving the subproblems exactly can be very expensive. In this paper we study inexact Newton methods for solving the nonlinear, complementarity problem. In such an inexact method, the subproblems are solved only up to a certain degree of accuracy. The necessary accuracies that are needed to preserve the nice features of the exact Newton method are established and analyzed. We also discuss some extensions as well as an application. This research was based on work supported by the National Science Foundation under grant ECS-8407240.     

Scaling by Binormalization

We present an iterative algorithm (BIN) for scaling all the rows and columns of a real symmetric matrix to unit 2-norm. We study the theoretical convergence properties and its relation to optimal conditioning. Numerical experiments show that BIN requires 2–4 matrix–vector multiplications to obtain an adequate scaling, and in many cases significantly reduces the condition number, more than other scaling algorithms. We present generalizations to complex, nonsymmetric and rectangular matrices.     

A RANDOM FIXED POINT ITERATION FOR THREE RANDOM OPERATORS ON UNIFORMLY CONVEX BANACH SPACES

In the present paper we introduce a random iteration scheme for three random operators defined on a closed and convex subset of a uniformly convex Banach space and prove its convergence to a common fixed point of three random operators. The result is also an extersion of a known theorem in the corresponding non-random case.