牛顿弦截法预估校正迭代格式的收敛阶

研究如下形式的牛顿弦截法的预估校正(P.C.)格式:P(预估):~xk+1=xk-(xk-xk-1)f(xk)f(xk)-f(xk-1)C(校正):xk+1=xk-(~xk+1-xk)f(xk)f~(xk+1)-f(xk)证明了它的收敛阶为2.618.     

求解非线性方程的一个新方法

提出了一种求解非线性方程的数值方法，此方法不需要导数的计算，其收敛阶与抛物线法相同，但计算量要比抛物线法小得多。     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

平面交叉玻璃波导型微透镜阵列光学性能研究

介绍了平面交叉玻璃光波导型半球形微透镜阵列的制作方法.利用积分形式的光线方程式讨论了半球形微透镜的光学特性,得到了半球形微透镜的光线轨迹方程式和焦距表示式,理论结果与实验数据是一致的.     

牛顿第二定律实验中的误差分析

本文是通过对加速度的实验值和理论值进行比较和分析，给出误差的合理范围。     

Continuous modified Newton’s-type method for nonlinear operator equations

A nonlinear operator equation F(x)=0, F:H→H, in a Hilbert space is considered. Continuous Newton’s-type procedures based on a construction of a dynamical system with the trajectory starting at some initial point x ₀ and becoming asymptotically close to a solution of F(x)=0 as t→+∞ are discussed. Well-posed and ill-posed problems are investigated. Received: June 29, 2001; in final form: February 26, 2002?Published online: February 20, 2003 This paper was finished when AGR was visiting Institute for Theoretical Physics, University of Giessen. The author thanks DAAD for support     

Modified Householder iterative method free from second derivatives for nonlinear equations

In this paper, we suggest and analyze a new two-step predictor–corrector type iterative method free from second derivatives for solving nonlinear equations of the type f(x)=0. This new method includes the two-step Newton method as a special case. We prove that the new iterative method is of fourth-order. Several examples are given to illustrate the efficiency of this new method and its comparison with other iterative methods. This method can be considered as a significant improvement of the Newton method and its variant forms.     

Solution of monotone complementarity problems with locally Lipschitzian functions

The paper deals with complementarity problems CP(F), where the underlying functionF is assumed to be locally Lipschitzian. Based on a special equivalent reformulation of CP(F) as a system of equationsφ(x)=0 or as the problem of minimizing the merit functionΘ=1/2∥Φ∥ ₂ ² , we extend results which hold for sufficiently smooth functionsF to the nonsmooth case. In particular, ifF is monotone in a neighbourhood ofx, it is proved that 0 εδθ(x) is necessary and sufficient forx to be a solution of CP(F). Moreover, for monotone functionsF, a simple derivative-free algorithm that reducesΘ is shown to possess global convergence properties. Finally, the local behaviour of a generalized Newton method is analyzed. To this end, the result by Mifflin that the composition of semismooth functions is again semismooth is extended top-order semismooth functions. Under a suitable regularity condition and ifF isp-order semismooth the generalized Newton method is shown to be locally well defined and superlinearly convergent with the order of 1+p.     

A parallel inexact newton method for stochastic programs with recourse

A parallel inexact Newton method with a line search is proposed for two-stage quadratic stochastic programs with recourse. A lattice rule is used for the numerical evaluation of multi-dimensional integrals, and a parallel iterative method is used to solve the quadratic programming subproblems. Although the objective only has a locally Lipschitz gradient, global convergence and local superlinear convergence of the method are established. Furthermore, the method provides an error estimate which does not require much extra computation. The performance of the method is illustrated on a CM5 parallel computer.This work was supported by the Australian Research Council and the numerical experiments were done on the Sydney Regional Centre for Parallel Computing CM5.     

牛顿碰撞球的解释与分析

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