Preparation and Mechanical Properties of Fe3Al Nanostructured Intermetallics

Nanostructured Fe₃Al intermetallic compounds were produced by using hydrogen arc plasma method. The transmission electron microscopy experiments showed that the average particle size of the as-synthesized was about 40-nm. The change in hardness of Fe₃Al nanostructured intermetallic compounds with annealing temperatures was observed and evaluated.     

一类非线性方程解的存在和唯一性及在图像中的应用

本文我们给出一个修正的非线性扩散方程模型，与Cotte Lions和Morel的模型相比该模型有许多实质上的优点。主要的想法是把原来去噪声部分：卷积Gauss过程替代为解一个有界区域上的线性抛物方程问题，因此避开了对初始数值如何全平面延拓的问题。我们从数学上的证明该问题解的存在性和适定性，同时给出对矩形域情况的解的级数形式。最后我们给基于本模型的数值计算差分模型，并且给出几个具体图像在该模型下处理结果。     

不确定非线性系统的鲁棒自适应控制器

在ｂａｃｋｓｔｅｐｐｉｎｇ程序中，把非线性自适应控制和鲁棒控制连接起来，为参数化的严格反馈系统在不确定性存在的情况下，建立了一种鲁棒自适应控制方案．非线性自适应控制被用来处理系统的线性参数化部分，而鲁棒控制通过引进非线性阻尼项被用来处理不确定性部分．与现有的方案不同，作者给出了非线性阻尼项的无限种选择，而不是仅仅一种选择．通过使用一种合适的选择，能够设计一个鲁棒自适应控制器．它不仅能够保证对不确定性的鲁棒性，而且能够使输出误差任意小，以及用较小的控制努力取得较好的性能．     

光束偏转法自动测试激光等离子体冲击波系统的研制

根据光束偏转原理，研制了激光等离子体冲击波自动测试系统的硬件和软件。该系统使用计算机与可编程序控制器作为上下位机，采取上下位机通讯的方式控制步进电机及二维移动架的移动，以改变探测光的相对位置，并利用单模光纤和光电倍增管将探测到的光偏转信号传入数字示波器进行存储，最后计算机将示波器中采集到的光偏转信号进行分析处理。使用该系统对激光等离子冲击波的衰减过程进行了实际测试，得到了较为理想的实验结果。     

椭圆波导FEM放大器的非线性特性研究

 以椭圆波导、平板摇摆器为FEM放大器的模型，导出了自洽的注波互作用三维非线性方程组。在此基础上编制了相应的程序。利用该程序分析了FEM放大器的饱和功率、效率以及带宽等高频特性。考虑了摇摆器渐变、空间电荷波、电子初始速度零散对高频特性的影响。     

Convergence Rate of The Trust Region Method for Nonlinear Equations Under Local Error Bound Condition

In this paper, we present the new trust region method for nonlinear equations with the trust region converging to zero. The new method preserves the global convergence of the traditional trust region methods in which the trust region radius will be larger than a positive constant. We study the convergence rate of the new method under the local error bound condition which is weaker than the nonsingularity. An example given by Y.X. Yuan shows that the convergence rate can not be quadratic. Finally, some numerical results are given. This work is supported by Chinese NSFC grants 10401023 and 10371076, Research Grants for Young Teachers of Shanghai Jiao Tong University, and E-Institute of Computational Sciences of Shanghai Universities. An erratum to this article is available at .     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.     

Successive column correction algorithms for solving sparse nonlinear systems of equations

This paper presents two algorithms for solving sparse nonlinear systems of equations: the CM-successive column correction algorithm and a modified CM-successive column correction algorithm. Aq-superlinear convergence theorem and anr-convergence order estimate are given for both algorithms. Some numerical results and the detailed comparisons with some previously established algorithms show that the new algorithms have some promise of being very effective in practice.This research was partially supported by contracts and grants: DOE DE-AS05-82ER1-13016, AFOSR 85-0243 at Rice University, Houston, U.S.A. and Natural Sciences and Engineering Research Council of Canada grant A-8639.     

利用驻波实验研究混沌现象

利用驻波实验演示了混沌现象,并对其进行了理论分析和计算机仿真研究.仿真结果与实验结果都表明:当连接点接近驻波波节处时,振动系统处于混沌运动状态;而当连接点接近驻波波腹处时,系统处于稳定驻波运动状态.     

一类非线性常微分方程振荡解的渐近表示

在本文中,我们讨论了非线性常微分方程y"=a0|x|αy3 a1|x|βy2 α2|x|γy α3|x|δ振荡解的渐近表示．在这个方程中将α0,α,α1,β,α2,γ,α3,δ分别换成0,0,6,0,0,0,sgn(x),1就是著名的第一类Painleve方程,而将α0,α,α1,β,α2,γ,α3,δ分别换成2,0,0,0,sgn(x),1,α0,就是著名的第二类Painleve方程．当α0,α,α1,β,α2,γ,α3,δ分别换成-β/3γ,0,0,0,1/γ,1,α,0时,可用于组合KdV方程孤立子解的化简．