Resistant orthogonal procrustes analysis

In this paper two alternative loss criteria for the least squares Procrustes problem are studied. These alternative criteria are based on the Huber function and on the more radical biweight function, which are designed to be resistant to outliers. Using iterative majorization it is shown how a convergent reweighted least squares algorithm can be developed. In asimulation study it turns out that the proposed methods perform well over a specific range of contamination. When a uniform dilation factor is included, mixed results are obtained. The methods also yield a set of weights that can be used for diagnostic purposes.     

A High Speed Detection Scheme for Point Targets in a Multitarget Environment

The purpose of this paper is to develop a high speed detection scheme for moving and / or stationary point targets in a multitarget environment as registered in an IR image sequence. An iterative approximate 3-D line searching algorithm based upon the geometric representation of lines (for non-maneuvering targets in space) in a 3-D space is derived. The convergency of the algorithm is proved. An analysis is performed of the theoretical detection performance of the algorithm. The statistical experiment results show high effectiveness and computational efficiency of the algorithm in the case of low SNR. The idea may be employed to satisfy the real-time processing requirement of an IR system.     

Radar Imaging Based on Iterative Algorithms

It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.     

一种新的计算周期表面电磁散射算法

利用数值方法研究周期表面的电磁散射问题。应用矩量法研究周期表面的电磁散射可以获得较为精确的数值结果。对于表面散射 ,应用矩量法时表面未知变量的数目非常大 ,即使对于一维表面也需要几千个未知变量 ;当求解矩阵方程时 ,计算机对求解的问题有内存和速度的限制。为了克服内存的限制 ,采用了一种新的迭代数值算法。对周期表面的电磁散射问题进行了研究 ,并与矩阵反演方法作了比较。所得结果表明 ,这种新的迭代法具有很好的收敛性。最后对散射结果进行了讨论     

铸造合金优化配料原理与计算机软件开发

应用计算机进行优化配料,不仅可以免除人工配料烦琐的计算过程,同时可以降低原材料成本,保证产品质量,提高企业经济效益。为此开发了计算机优化配料软件,论述了它的基本原理和功能,并介绍了该软件应用实例。     

一致平滑可分的Banach空间中K-正定算子方程的逼近解(英文)

设Ｅ是可分的一致平滑Ｂａｎａｃｈ空间,Ａ：Ｄ（Ａ）Ｅ→Ｅ是一个Ｋ－正定算子。构造了一个迭代序列强收敛于算子方程Ａｘ＝ｆ（ｆ∈Ｅ）的唯一解。所做工作推广了Ｃｈｉｄｕｍｅ与Ｏｓｉｌｉｋｅ,Ｃｈｉｄｕｍｅ与Ａｎｅｋｅ等人的结果。     

n 维单形的两个几何不等式

利用优超理论将平面上关于三角形的彼得洛维奇不等式和达林——莫泽不等式推广到ｎ维欧氏空间中的ｎ维单形上，得到（１）１Ｎ≤∑Ｎｉ＝１ａ２ｉ（∑Ｎｉ＝１ａｉ）２≤１ｎ（２）Ｍ≤∑Ｎｉ＝１ａｉ２－ｄ∏Ｎｉ＝１ａｉＳ≤ｎＳ２式中ａｉ（ｉ＝１，２，…，Ｎ；Ｎ＝ｎ（ｎ＋１）２）为ｎ维单形∑Ａ的棱长，ｄ为任一非负实数，Ｓ＝１ｎ∑Ｎｉ＝１ａｉ，Ｍ＝ｎ２ＮＳ２－ｄＳ（ｎＳＮ）Ｎ。     

粒子群优化算法及其应用

粒子群算法是一种群体优化算法,详细介绍了粒子群算法的基本原理、参数选择及其应用领域.     

离散时变系统迭代域最优学习控制

针对线性时变离散系统，首次提出并研究了迭代域内线性二次型最优迭代学习控制问题。所得到的迭代学习控制方法在迭代域内是保性能最优的，其学习率不需主观选取，学习速度可通过改变性能矩阵参数进行调节。     

一种正弦波信号频率幅值的高精度估计方法

为了提高正弦波信号频率和幅值的频域估计精度,提出了窗函数迭代逼近方法.Matlab仿真结果表明,该方法切实可行,估计精度可以提高4~5个数量级,且与频率偏差δ基本无关.