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.     

拆边法求最短路径

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

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

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

关于AOR迭代法的研究

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

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

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

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.     

混沌实验数据处理及仿真

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

金属薄膜制备及物性测量系列实验

介绍了由模拟真空实验和“金属薄膜的制备”、“金属薄膜厚度的测量”、“金属薄膜电阻率的测量”,以及“金属薄膜生长过程的动态监测”等4个实验组成的金属薄膜制备与物性测量系列实验.这组实验与现代科学技术发展联系紧密,仪器设备可靠,操作简单,适合于普通物理实验阶段的研究性教学.     

改善光纤倒像器的对比度传递特性

光纤倒像器是一种特殊类型的光纤板，可将传递图像直接倒转180°并应用于像增强器。由于光纤倒像器的特殊结构，造成光纤随着距扭转轴心的距离增加，数值孔径和光通量逐渐下降。相对于光纤板，光纤倒像器在透过率和对比度传递特性上均有一定程度的下降。通过改进玻璃系统，在一定程度上降低芯皮玻璃间离子扩散和相互渗透的程度，可提高光纤倒像器的实际数值孔径；通过调节EMA吸收量，既能满足像增强器对光纤倒像器荧光屏透过率的要求，又能保证最大程度地吸收光纤中逸出的杂散光，提高对比度。选择合理的芯皮比，不仅可弥补因扭转拉伸造成的皮层厚度减薄，还可进一步增加皮层厚度，抑制光从光纤中逸出。通过以上改进，可改善光纤倒像器的对比度传递特性。     

Highly accurate calculation of radial spheroidal functions

A new method for calculating the radial spheroidal functions of the first kind is proposed for the arguments that are greater than unity in modulus. A well-known representation of these functions is refined and used for this purpose. The constructs and the software implementation proposed in the paper provide an efficient tool for the calculation of the functions with a desired accuracy in a wide range of parameters.