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

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

Robust Bayesian Inference for Seemingly Unrelated Regressions with Elliptical Errors

Bayesian inference is considered for the seemingly unrelated regressions with an elliptically contoured error distribution. We show that the posterior distribution of the regression parameters and the predictive distribution of future observations under elliptical errors assumption are identical to those obtained under independently distributed normal errors when an improper prior is used. This gives inference robustness with respect to departures from the reference case of independent sampling from the normal distribution.     

椭圆波导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方程孤立子解的化简．     

一类Marangoni对流边界层方程的近似解析解

利用Adomain解析拆分和Padé逼近方法对由Marangoni对流诱发的层流边界层问题进行了研究, 提供了一种求解边界层方程的解析分析方法. 得到了问题的近似解析解并对相应的流动及传热特性进行了探讨. 本文所提出的思想方法可以用于解决其他科学和工程技术问题. 关键词： Marangoni对流 非线性 Adomain拆分法 近似解析解     

Nonlinear Time Series Analysis Since 1990:Some Personal Reflections

Abstract I reflect upon the development of nonlinear time series analysis since 1990 by focusing on five majorareas of development. These areas include the interface between nonlinear time series analysis and chaos,thenonparametric/semiparametric approach,nonlinear state space modelling,financial time series and nonlinearmodelling of panels of time series.