XFEM_Fracture

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

利用多元回归分析对气象站点数据进行插值运算。(The data of meteorological stations are interpolated by multiple regression analysis.)

美国汪利宏的蒙特卡洛及卷积模拟程序，可以模拟top-hat光束和高斯光束在生物组织中的传输(U.S. WANG Li-hong of the Monte Carlo and convolution simulation program can simulate the top-hat beam and Gaussian beam transport in tissue)

用ABAQUS及其子程序解决热冲压热力耦合问题(Subroutine with ABAQUS and hot stamping coupled thermal problem solving)

PB开发的计算器程序，适合初学者，比较简单，开发程序版本PB9.0(PB calculator program developed for beginners, is relatively simple, the development program version PB9.0)

电磁传播损耗的计算方法，模拟电磁波在大气中的传播路径(A propagation path of the electromagnetic propagation loss calculation method and the simulation of electromagnetic wave in the atmosphere)

　禁忌搜索算法是一种全局性邻域搜索算法，模拟人类具有记忆功能的寻优特征。它通过局部邻域搜索机制和相应的禁忌准则来避免迂回搜索，并通过破禁水平来释放一些被禁忌的优良状态，进而保证多样化的有效探索，以最终实现全局优化(Tabu search algorithm)

计算离散傅里叶变换的一种快速算法，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。(A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.)

对一维光谱实现偏最小二乘回归进行UVE变量选择(UVE variable selection on the spectrum)

优化设计算法：用powell法求解目标函数的最优解和最优值，已经验证算法的正确性，在visual c++6.0下开发(Optimization algorithm: Solving the objective function with powell optimal solution and optimal value, has verified the correctness of the algorithm, the visual c++6.0 under development)