Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.     

拆边法求最短路径

本文利用局部比较法 ,在图中定义子图、无效路径、以及可去边 .利用推导的有关定理 ,拆去可去边 ,利用最短路径相同的等价性 ,达到化简图 ,从而求出最短路径     

最速下降规则不失为一可用规则

本从统计意义上平均迭代次数的观点出发，指出求解线性规划的最速下降规则是可取的，好用的。     

方程w"-w+f(t,w)=O的Dirichlet边值问题的正解存在性与多解性

考察了下列常微分方程的Dirichlet边值问题的正解[w″(t)-w(t) f(t,w(t))=0,0≤t≤1 w(0)=w(1)=0建立了n正解的存在性，其中n是一个任意的自然数。     

关于AOR迭代法的研究

本文论证了严格对角占优矩阵之AOR法的误差估计式中的误差估计常数hγ,ω（0≤γ≤ω0）的最小值是h1,1.     

线性分式规划最优解集的求法

本文使用多面集的表示定理，导出了线性分式规划最优解集的结构，并给出确定全部最优解的计算步骤。     

Metastability in the Potts model on the Cayley tree

Metastability in the ferromagneticp-state Potts model defined on the Cayley tree is discussed. It is shown that the sign of the boundary fieldH _s determines the order of the transition as well as the stability of the low-temperature phase. Lowering the temperature withH _s >0, a system withp<2 (p>2) will display a second (first)-order transition to a metastable (stable) phase. ForH _s >0 a second (first)-order transition to a metastable (stable) phase occurs ifp>2 (p<2). In this case the system also has a residual entropy which is negative forp<2.     

Truncated Newton method for sparse unconstrained optimization using automatic differentiation

When solving large complex optimization problems, the user is faced with three major problems. These are (i) the cost in human time in obtaining accurate expressions for the derivatives involved; (ii) the need to store second derivative information; and (iii), of lessening importance, the time taken to solve the problem on the computer. For many problems, a significant part of the latter can be attributed to solving Newton-like equations. In the algorithm described, the equations are solved using a conjugate direction method that only needs the Hessian at the current point when it is multiplied by a trial vector. In this paper, we present a method that finds this product using automatic differentiation while only requiring vector storage. The method takes advantage of any sparsity in the Hessian matrix and computes exact derivatives. It avoids the complexity of symbolic differentiation, the inaccuracy of numerical differentiation, the labor of finding analytic derivatives, and the need for matrix store. When far from a minimum, an accurate solution to the Newton equations is not justified, so an approximate solution is obtained by using a version of Dembo and Steihaug's truncated Newton algorithm (Ref. 1).This paper was presented at the SIAM National Meeting, Boston, Massachusetts, 1986.     

金属银熔体快冷过程的计算机模拟

利用分子动力学模拟技术研究了由周期性边界条件控制的500个银(Ag)原子构成的金属Ag熔体快速冷凝过程.冷却速率为8×1013K/s.模拟在FS(Finnis-Sinclair)相互作用势的基础上,通过双体分布函数、键对分析技术、键取向序等多种方法,对液银快速冷凝过程的微观结构转变特性作了分析,给出了连续快速冷凝过程中液银原子间依靠相互作用力形成的独特的微观结构图像.并考察了冷却过程中体系能量和元胞体积随温度的变化.模拟结果表明在快速冷凝过程中液Ag没有形成bcc结构的倾向.     

混沌实验数据处理及仿真

大学物理实验中混沌实验大多采用观察现象的方法进行,本实验采用蔡氏电路(Chua s circuit)产生混沌行为.在观察不同初始值条件下出现的倍周期分岔、阵发混沌、奇异吸引子等相图及现象的基础上,通过对采集数据进行处理,对负电阻伏安特性进行分段线性拟合,用功率频谱法、计算机仿真方法(龙格-库塔数值积分法)对混沌现象进行描绘,将实验数据与非线性方程组的数值解相结合,呈现出混沌现象的本质.