ArrayAscendingOrder

算法设计与分析之汉诺塔问题介绍与讲解 希望大家有时间看看 (Tower of Hanoi problem description and explanation of the design and analysis of algorithms hope that we have time to look at)

迭代的动力缩聚法计算结构的前两阶频率和阵型（4个自由度）(Iterative dynamic condensation method to calculate the structure of the first two natural frequencies and formation (4 degrees of freedom))

对于chebyshev法只能对于均匀线阵，本程序实现对任意结构阵列的波束优化(Chebyshev method for only the uniform linear array, the program structure of arbitrary beam array optimization)

最小二乘法(LS)仿真6个参考节点定位一个定位节点，利用RSSI与距离转化的公式求解距离。(Least squares (LS) simulation 6 reference node positioning a positioning node, the use of RSSI and distance into the distance formula to solve.)

MATLAB，多目标优化，使用SQP算法(MATLAB, multi-objective optimization using SQP Algorithm)

能够实现二维边界造波，且自带消波，能够较好地模拟波浪荷载。(with a prgram of eliminating wave,it can be used to achieve boundry wave.)

fluent udf的动网格程序，实现了刚体和基于节点的运动(cg-motion grid motion)

求解旋量玻色爱因斯坦凝聚单个涡旋态的mathematics程序(Solving spinor Bose-Einstein condensates singly quantized vortex mathematics program)

说明：  umat公式详细介绍，我也不知道够20字了mei(the introduction of umat in abaqus)

针对功放得到非线性失真，采用查表法预失真对功放的非线性进行补偿，仿真表明了补偿方式的有效性。(Obtained for nonlinear distortion amplifier, using the look-up table predistortion to compensate for non-linear power amplifier, simulation shows the effectiveness of compensation.)