Linearized ridge-path method for function minimization

A modification based on a linearization of a ridge-path optimization method is presented. The linearized ridge-path method is a nongradient, conjugate direction method which converges quadratically in half the number of search directions required for Powell's method of conjugate directions. The ridge-path method and its modification are compared with some basic algorithms, namely, univariate method, steepest descent method, Powell's conjugate direction method, conjugate gradient method, and variable-metric method. The assessment indicates that the ridge-path method, with modifications, could present a promising technique for optimization.This work was in partial fulfillment of the requirements for the MS degree of the first author at Cairo University, Cairo, Egypt. The authors would like to acknowledge the helpful and constructive suggestions of the reviewer.     

A note on estimating parameters in two-parameter Pareto distributions

Pareto distributions are used extensively in modelling income distributions. Estimation of parameters is revisited in two-parameter Pareto distributions. The method of quantile estimates using the elemental estimates and the method of product spacings are applied to the two-parameter Pareto distributions. A comparative study between the maximum likelihood method, the unbiased estimates which are functions of the maximum likelihood method, the minimum mean squared error method, the method of moments, the method of quantile estimation, the method of quantile estimation using the elemental estimates and the method of product spacings is presented.     

A COLUMN-SECANT UPDATE TECHNIQUE FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS

In this paper,we present a column-secant modification of the SCC method,which is called the CSSCC method.The CSSCC method uses function values more efficiently than the SCC method,and it is shown that the CSSCC method has better local q-convergence and r-convergence rates than the SCC method.The numerical results show that the CSSCC method is competitive with some well known methods for some standard test problems.     

对流占优扩散方程的特征线楔形基无网格法

本文研究了一维对流占优扩散方程的初边值问题.利用特征线法与楔形基无网格法,获得了特征线楔形基无网格显格式与隐格式算法.数值实验表明算法具有精度高、计算简单等优点.     

自适应多重网格法与超松弛法的比较

多重网格法(Multiple Grid Method,简称M-G方法)是近年来出现的快速方法之一,本文在M-G方法中采用自适应控制层间转换的技术,并将自适应M-G方法与G-S迭代方法及SOR迭代方,法进行了比较。其计算结果表明,自适应M-G方法的计算量比G-S迭代及SOR迭代少得多,当M-G方法所用层数为4-6层,这种优越性就更加明显,且自适应M-G方法中选取控制参数有很大的灵活性。     

拟Raabe判别法与拟对数判别法的强弱关系

拟Raabe判别法是新近提出的关于正项级数收敛性的一种比较细致的判别法.对通项递减的正项级数来说,此判别法强于传统的Raabe判别法与Gauss判别法.通过对拟Raabe判别法与另一个细致的判别法——拟对数判别法强弱关系的探讨,得出了后一判别法强于前者的结论.     

双层规划问题的一种模式搜索Filter方法

双层规划在工程设计和经济管理中应用广泛,结合模式搜索方法和Filter方法提出了一种解决双层规划问题的算法—模式搜索Filter方法.算法以Filter法思想构造接受准则,以模式搜索提供迭代方向和步长,能够有效的解决一类双层规划问题.     

一种基于矩阵初等变换的Schmidt正交化方法

对向量组的Schmidt正交化法和合同变换法的关系进行了分析,指出Schmidt正交化法就是合同变换法中利用规范化初等变换后的一种特殊情况,由此给出一种基于矩阵初等变换的Schmidt正交化方法——Schmidt初等变换正交化法,以及这一方法在软件Matlab上实现的程序.     

用不确定德尔菲法预测GDP

德尔菲法是一种建立在专家意见基础上的预测评估方法.不确定统计是利用不确定理论收集和整理分析专家数据的一种统计方法,其中关键的一点是如何构造不确定变量的不确定分布.把德尔菲法和不确定统计相结合,就得到了一种估计不确定分布的新方法——不确定德尔菲法.对该方法的估计误差进行了改进,得到了一种预测GDP的新方法,并利用其预测邯郸市的生产总值(GDP).     

牛顿迭代法与几种改进格式的效率指数

研究牛顿迭代、牛顿弦截法以及它们的六种改进格式的计算效率,计算了它们的效率指数,得到牛顿迭代、改进牛顿法、弦截法和改进弦截法(即所谓牛顿迭代的P.C格式)、二次插值迭代格式、推广的牛顿迭代法、调和平均牛顿法和中点牛顿法的效率指数分别为0.347/n、0.3662/n、0.4812/n、0.4812/n、0.347/n、0.3662/n、0.3662/n、0.3662/n.我们的结果显示,利用抛物插值多项式推出的迭代格式和改进弦截法并没有真正提高迭代的计算效率.此外,我们还证明了改进弦截法与牛顿弦截法等价,并利用这一结论给出了改进弦截法收敛阶为2.618的一个简化证明.     

多目标决策问题及其求解方法研究

针对多目标决策问题的多目标最优化问题化为单目标最优化问题进行了研究.其主要方法有:理想点法、等级权重法、加权算术平均法、加权几何平均法、风险偏好系数法、乘除法、模糊规划法等.此外,还对多目标最大最小和多目标最小最大决策问题进行了处理.     

On preconditioned Uzawa methods and SOR methods for saddle-point problems

This paper studies convergence analysis of a preconditioned inexact Uzawa method for nondifferentiable saddle-point problems. The SOR-Newton method and the SOR-BFGS method are special cases of this method. We relax the Bramble-Pasciak-Vassilev condition on preconditioners for convergence of the inexact Uzawa method for linear saddle-point problems. The relaxed condition is used to determine the relaxation parameters in the SOR-Newton method and the SOR-BFGS method. Furthermore, we study global convergence of the multistep inexact Uzawa method for nondifferentiable saddle-point problems.     

Iterative Methods of Richardson-Lucy-Type for Image Deblurring

Image deconvolution problems with a symmetric point-spread function arise in many areas of science and engineering. These problems often are solved by the Richardson-Lucy method, a nonlinear iterative method. We first show a convergence result for the Richardson-Lucy method. The proof sheds light on why the method may converge slowly. Subsequently, we describe an iterative active set method that imposes the same constraints on the computed solution as the Richardson-Lucy method. Computed examples show the latter method to yield better restorations than the Richardson-Lucy method and typically require less computational effort.     

一种求解非线性互补问题的方法及其收敛性

本文将Newton方法和外梯度方法相结合,提出了一种求解非线性互补问题的方法,证明了此方法的全局收敛性和超线性收敛性,在适当的条件下给出了一个有限终止结果。数值实验表明,此方法是有效的。     

求解一类非线性方程的改进的平均法

本文研究确定非线性方程一致有效近似解的平均法,得到B方法(Krylov-Bogoliubov method)与KBM方法(Krylov-Bogoliubov-Mitropolski method)的改进形式,通过两个例子与多尺度方法的比较,说明改进的平均法的有效性,从而拓广了平均法的应用范围。     

粗糙面分形计算理论研究进展

为提出一种工程上适用可靠的粗糙面分形维数计算方法,在分形曲线的维数计算方法(码尺法,盒维法)基础上,先后提出了星积分形曲面的维数计算方法、三角形棱柱表面积法、投影覆盖法、立方体覆盖法、改进的立方体覆盖法、分形的增变量描述法等曲面分形维数理论.鉴于上述方法的共有缺陷——获取三维坐标的激光表面仪器的扫描尺度限制,研究者提出了粗糙面图像维数计算理论,包括二值化图像维数、灰度图像维数、RGB图像维数计算理论.最后,本文展望了分形维数计算理论领域内亟待解决的三大问题.     

Efficient numerical methods for pricing American options under stochastic volatility

Five numerical methods for pricing American put options under Heston's stochastic volatility model are described and compared. The option prices are obtained as the solution of a two‐dimensional parabolic partial differential inequality. A finite difference discretization on nonuniform grids leading to linear complementarity problems with M‐matrices is proposed. The projected SOR, a projected multigrid method, an operator splitting method, a penalty method, and a componentwise splitting method are considered. The last one is a direct method while all other methods are iterative. The resulting systems of linear equations in the operator splitting method and in the penalty method are solved using a multigrid method. The projected multigrid method and the componentwise splitting method lead to a sequence of linear complementarity problems with one‐dimensional differential operators that are solved using the Brennan and Schwartz algorithm. The numerical experiments compare the accuracy and speed of the considered methods. The accuracies of all methods appear to be similar. Thus, the additional approximations made in the operator splitting method, in the penalty method, and in the componentwise splitting method do not increase the error essentially. The componentwise splitting method is the fastest one. All multigrid‐based methods have similar rapid grid independent convergence rates. They are about two or three times slower that the componentwise splitting method. On the coarsest grid the speed of the projected SOR is comparable with the multigrid methods while on finer grids it is several times slower. ©John Wiley & Sons, Inc. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

鞍点问题的修正对称超松弛迭代算法

为了提高求解鞍点问题的迭代算法的速度,通过设置合适的加速变量,对修正超松弛迭代算法（简记作MSOR-like算法）和广义对称超松弛迭代算法（简记作GSSOR-like算法）进行了修正,给出了修正对称超松弛迭代算法,即MSSOR-like （modified symmetric successiveover-relaxation）算法,并研究了该算法收敛的充分必要条件.最后,通过数值例子表明,选择合适的参数后,新算法的迭代速度和迭代次数均优于MSOR-like （modified successive overrelaxation）和GSSOR-like （generalized symmetric successive over-relaxation）算法,因此,它是一种较好的解决鞍点问题的算法.     

复合材料旋转壳非线性稳定性分析计算

利用前屈曲一致理论和能量变分法分析计算了复合材料旋转壳非线性稳定性.前屈曲应变-位移关系采用非线性的卡门方程,能量积分采用数值积分,用势能最小原理求解前屈曲位移和内力,提出了求解临界载荷的实用计算方法,用FORTRAN语言编制了相应的计算机程序,并给出了算例.     

A partial inexact alternating direction method for structured variational inequalities

In this article, a new method is proposed for solving a class of structured variational inequalities (SVIs). The proposed method is referred to as the partial inexact proximal alternating direction (piPAD) method. In the method, two subproblems are solved independently. One is handled by an inexact proximal point method and the other is solved directly. This feature is the major difference between the proposed method and some existing alternating direction-like methods. The convergence of the piPAD method is proved. Two examples of the modern convex optimization problem arising from engineering and information sciences, which can be reformulated into the encountered SVIs, are presented to demonstrate the applicability of the piPAD method. Also, some preliminary numerical results are reported to validate the feasibility and efficiency of the piPAD method.