AN ALGORITHM FOR JORDAN CANONICAL FORM OF A QUATERNION MATRIX

In this paper, we first introduce a concept of companion vector, and study the Jordan canonical forms of quaternion matrices by using the methods of complex rep resentation and companion vector, not only give out a practical algorithm for Jordan canonical form J of a quaternion matrix A, but also provide a practical algorithm for corresponding nonsingular matrix P with P-1AP = J.     

离散点集上的向量有理插值算法与特征性质

1引言 给出R~2中离散点集     

基于L~1度量分析的图象分解与重构算法

Mallat‘s decompositon and reconstruction algorithms are very important in the the field of wavelet theory and its applications to signal processing.Wavelet Anal-ysis,which is based on L^2(R) space,can eliminate redundancy of signals with the help of orthogonality and characterize the processing precision with the meansquare error.In the recent years,it is understood that the mean square measuredoes not match human visual sensitivity well.From the point of view,R.DeVore studied L^1 measure instead.Similarly,considering the principles of image com-pression,Yang introduced and dealt with orthogonality in L^1 space based on thebest approximation theory,and consequently established the corresponding decom-position and reconstruction algorithms for signals.In this paper,error analyses for the algorithms above are taken and the selection of the best parameters in the algorithms are discussed in detail.Finally,the algorithms are compared with the classical Haar and Daubechies‘‘s orthogonal wavelets based on the singal-to-noiseratio data computed.     

空间有理参数多项式曲线的整数级绘制算法

讨论了空间有理曲线中心投影后导数上界的估计，基于曲线各阶差分的递推计算，给出了空间有理参数多项式曲线的快速绘制算法．算法只用到整数的加减法，效率高．     

水资源可再生能力综合评价的遗传加权物元模型

为了科学地计算水资源可再生能力评价指标的权重 ,使评价方法具有可操作性 ,采用主、客观相结合的赋权基点法 ,以全局收敛的格雷码加速遗传算法为工具来确定权重 ,并结合物元分析理论 ,建立了一种新的评价模型——遗传加权物元模型 .文中给出了该模型实施的详细步骤 ,对黄河流域 9个行政分区的水资源可再生能力进行了综合评价 ,取得了较好的效果 .     

基于加强型BP算法的神经网络故障诊断研究

文章给出了利用神经网络进行故障诊断的可行性、基本原理、诊断过程分析、和参数优化过程 ,并得出较为理想的诊断结果 .     

薄膜光学常数的模拟退火算法研究

在薄膜的光学参数拟合时，操作者给定的模型初值对拟合结果有很大的关系。采用广泛用于求解复杂系统优化问题的模拟退火算法来求解薄膜光学常数，降低了操作者给定拟合模型初值的要求。通过对常规的模拟退火算法以及非常快速的模拟退火方法(Very Fast Stimulated Annealing，VFSA)分析，针对性地在模型扰动及退火计划上存在的缺陷作了改进，提高了VFSA算法的计算稳健性。通过大量的拟合实践，验证了提出的改进模拟退火方法的有效性。     

A primal-dual algorithm for the fermat-weber problem involving mixed gauges

We give a new algorithm for solving the Fermat-Weber location problem involving mixed gauges. This algorithm, which is derived from the partial inverse method developed by J.E. Spingarn, simultaneously generates two sequences globally converging to a primal and a dual solution respectively. In addition, the updating formulae are very simple; a stopping rule can be defined though the method is not dual feasible and the entire set of optimal locations can be obtained from the dual solution by making use of optimality conditions. When polyhedral gauges are used, we show that the algorithm terminates in a finite number of steps, provided that the set of optimal locations has nonepty interior and a counterexample to finite termination is given in a case where this property is violated. Finally, numerical results are reported and we discuss possible extensions of these results.     

基于空间离散的最短路径求解法及其局部优化方法

提出了一种基于空间离散的最短路径求解法，该法利用复杂表面的空间离散信息，从已知的两点中估算与其相连的一点的距离，递推式求取一点与其他点之间的最短距离。计算获得了各点与起点和终点的距离后，再把它们相加，依据与起点的距离的大小，顺序把距离和最小的结点连接起来，这样获得了最短路径的邻域路径，然后对最短路径的邻域路径的各点进行迭代式更新，从而获得局部优化，最终获得最短路径。经过对例子的计算及分析，表明该方法普适性强、可靠及有效。     

一种求解虚波长路径光网络波长资源优化问题的启发式算法

本文提出了一种虚波长路径光网络的启发式路由选择算法,它可以用来解决以最小化网络所需波长数目为目标的资源优化问题.该算法应用了基于最大概率路径的选路优化策略.对一个样例网络的数值分析结果表明该算法是有效的.