一种特殊规划的分块超松驰组合牛顿——乘子算法

本文给出了分块的超松驰组合牛顿－乘子（ＢＳＯＲ－Ｎ－Ｍ）方法，来求解一类约束函数可分块的规划问题，证明了其收敛性，进一步给出与理论相应的数值结果。     

Hybrid method for nonlinear least-square problems without calculating derivatives

This paper presents a no-derivative modification of the hybrid Gauss-Newton-BFGS method for nonlinear least-square problems suggested initially by Al-Baali and Fletcher and modified later by Fletcher and Xu. The modification is made in such a way that, in a Gauss-Newton step, the Broyden's rank-one updating formula is used to obtain an approximate Jacobian and, in a BFGS step, the Jacobian is estimated using difference formulas. A set of numerical comparisons among the new hybrid method, the Gauss-Newton-Broyden method, and the finite-difference BFGS method is made and shows that the new hybrid method combines the better features of the Gauss-Newton-Broyden method and the finite-difference BFGS method. This paper also extends to the least-square problem the finite-termination property of the Broyden method, proved for a nonsingular system of equations by Gay and for the full-rank rectangular system of equations by Gerber and Luk.The author would like to acknowledge the support of Xian Jiaotong University, Xian, China, and the award of a United Kingdom ORS studentship. The author wishes to express his gratitute to Professor R. Fletcher for his encouragement and to thank Dr. G. A. Watson and Dr. M. C. Bartholomew-Biggs for their useful comments during the preparation of this paper. The author also wishes to acknowledge Professor R. A. Tapia for his valuable suggestions.     

有限体积法定价美式期权

讨论美式期权定价的有限体积法.采用投影超松弛迭代法求解隐式欧拉和CrankNicolson有限体积格式离散Black-Scholes偏微分方程得到的线性互补问题.数值实验结果表明,两种有限体积格式都是有效的,而Crank-Nicolson格式的数值效果要优于隐式欧拉格式.     

PARALLEL SEMI ITERATIVE AND ITERATIVE METHODS FOR SINGULAR M-MATRICES

This paper praidrs a theurvtheal hasts for establishing the congergente of paraled interative and itratiee techaigues,for computing nmtrfied solution of Ar three A is a singal M-matrix,These results do not assuine A to irreducihle,A concrete relaxed parallet multixpla ting algorithin culled the parallel multispliting AOR algarithm is showed Findly,numericales amples are givep,arhleh show effertielve of parallel iterurise methods for singalar case     

Circulant-block preconditioners for solving ordinary differential equations

Boundary value methods for solving ordinary differential equations require the solution of non-symmetric, large and sparse linear systems. In this paper, these systems are solved by using the generalized minimal residual (GMRES) method. A circulant-block preconditioner is proposed to speed up the convergence rate of the GMRES method. Theoretical and practical arguments are given to show that this preconditioner is more efficient than some other circulant-type preconditioners in some cases. A class of waveform relaxation methods is also proposed to solve the linear systems.     

用摄动配置方法求解含时薛定谔方程

将摄动配置方法应用到含时薛定谔方程,在计算实现的基础上结合摄动配置的特征提出了一类新的数值积分方法,并给出了一个2级2阶和一个3级4阶的辛摄动配置方法对含时薛定谔方程的数值算例.为了检验新的数值积分方法,我们还给出了与两个辛摄动配置格式在理论上等价的辛龙格-库塔方法以及同阶的非辛方法的数值模拟.展示了一些数值结果,并给出了一些分析.     

基于同伦分析方法的一种改进的试位法

应用同伦分析方法,提出了一种求解非线性方程改进的试位法．给出的一些数值例证显示了该运算法则的有效性．     

Bootstrap confidence interval for a correlation curve

A correlation curve measures the strength of the association between two variables locally at different values of x. The purpose of this study is to obtain point-wise confidence intervals for a correlation curve using wild bootstrap techniques. Empirical coverage probabilities are found to be close to the specified nominal level. Bootstrapping is an attractive alternative to confidence intervals based on asymptotic expressions that have slow rate of convergence.     

Global convergence for a 1-D inverse problem with application to imaging of land mines

A new globally convergent numerical method is developed for a 1-D coefficient inverse problem for a hyperbolic partial differential equation (PDE). The back reflected data are used. A version of the quasi-reversibility method is proposed. A global convergence theorem is proven via a Carleman estimate. The results of numerical experiments are presented.     

Optimization of technology parameters for the plane-strain component in the process of gas quenching

The paper introduces an optimization method for the technology parameters of the plane-strain component in the process of gas quenching. Distortion, residual stress, average surface hardness and standard deviation of surface hardness are regarded as the optimization objectives. A new heat transfer coefficient model is presented, five distinct heat transfer coefficients are used at various regions of the model. The five heat transfer coefficients are regarded as the design variables, and four regressive equations are established by using response surface method. The four equations, respectively represent the relations between the four optimization objectives and the design variables. A multi-objectives optimization model is established, and the multi-objectives optimization model is optimized by the non-linear method. The optimized technology parameters are used to simulate the gas quenching process by FEM software. The quenching results after optimization are compared with those before optimization. The comparison shows that the quenching quality after optimization is better than that before optimization. After optimization, the four optimization objectives are all improved.     

大范围求解非线性方程组的指数同伦法

为了解决关于奇异的非线性方程组求根问题,提出了一种由同伦算法推出大范围收敛的连续型方法-指数同伦法,构造了一类指数同伦方程,克服了Jacobi矩阵的奇异,分析了指数同伦方     

Algorithm for solving shifted skew-symmetric linear system

A new algorithm for solving a shifted skew-Hermitian linear system is presented and the corresponding convergence theorem is given. Some numerical examples are provided to demonstrate the algorithm.      

求解奇数阶幻方的一个简单方法

运用等差数列的相关原理,给出一种构造奇数阶对称幻方的新方法——等差数列法.此方法简单、快捷、便于计算机操作,具有优越性.     

First-order methods for certain quasi-variational inequalities in a Hilbert space

Sufficient conditions are obtained for quasi-variational inequalities of a special type with nonlinear operators in a Hilbert space to be uniquely solvable. A first-order continuous method and its discrete variant are constructed for inequalities of this kind. The strong convergence of these methods is proved.     

具有Gilbert项的Landau-Lifshitz方程的显式平方守恒格式

构造了一种解具有Gilbert项的Landau-Lifshitz方程的显式平方守恒格式．基本思想是离散Landau-Lifshitz方程成常微分方程组,应用李群方法和显式Runge-Kutta方法解常微分方程组．数值试验比较了两方法的保平方守恒特性和精度,得出李群方法(RK-Cayley方法)比相应的Runge-Kutta(RK)方法有更好的精度和保平方守恒特性．     

Approximating the inverse and the Moore‐Penrose inverse of complex matrices

A parametric family of fourth‐order schemes for computing the inverse and the Moore‐Penrose inverse of a complex matrix is designed. A particular value of the parameter allows us to obtain a fifth‐order method. Convergence analysis of the different methods is studied. Every iteration of the proposed schemes involves four matrix multiplications. A numerical comparison with other known methods, in terms of the average number of matrix multiplications and the mean of CPU time, is presented.     

New convergence estimates for multilevel algorithms for finite-element approximations

New convergence estimates are established for some multilevel algorithms for finite-element methods applied to elliptic problems with jump coefficients. A uniform rate of convergence is derived if the coefficient has only one jump interface. If the coefficient has multi-jump interfaces which meet at only one interior point in the domain, the convergence rate is bounded by 1−(CJ)⁻¹, where J is the number of levels and C is a constant independent of the jump.     

变步长非单调模式搜索法

A varied steplength nonmonotone pattern search method is proposed in this paper. The varied steplength search strategy is designed in this method such that the pattern direction is more approximated to efficient descent direction. The interpolation and nonmonotone technique are used for improving local search and global convergence. The theoretical and numerical results show that this method is an efficient direct search method.     

三阶方向牛顿法的收敛性

通过递推关系,证明了解希尔伯特空间上的实系数非线性方程组的三阶方向牛顿法的半局部收敛性,给出了解的存在性以及先验误差界,最后计算出一些数值结果来证明我们的结论.     

Local convergence of the diagonalized method of multipliers

In this study, we consider a modification of the method of multipliers of Hestenes and Powell in which the iteration is diagonalized, that is, only a fixed finite number of iterations of Newton's method are taken in the primal minimization stage. Conditions are obtained for quadratic convergence of the standard method, and it is shown that a diagonalization where two Newton steps are taken preserves the quadratic convergence for all multipler update formulas satisfying these conditions.This work constitutes part of the author's doctoral dissertation in the Department of Mathematical Sciences, Rice University, under the direction of Professor R. A. Tapia and was supported in part by ERDA Contract No. E-(40-1)-5046.The author would like to thank Professor Richard Tapia for his comments, suggestions, and discussions on this material.