ABAQUS-UMAT

实现有限域中乘法，输入二个普通二级制数，输出在本原多项式的乘法结果(Achieve limited multiplication field, enter the number of two-tier system of two ordinary output in primitive polynomial multiplication results)

实现矩阵转置并且方便观看，第二个程序用于进行对海表面高度SSH进行EOF分析，第三个程序进行海陆点分离并写为NC文件(Matrix transpose and convenient to watch the second program for the EOF analysis of sea surface height SSH third program separation of land and sea, and write for NC files)

模糊控制的C语言实现，双输入单输出，采用查表法进行模糊推理，去模糊方法采用重心法，易于单片机实现(C language realization of fuzzy control, double input and single output, using look-up table method for fuzzy reasoning, using center of gravity method for deblurring, easy to realize by single chip computer)

AHP层次分析法计算判断矩阵的最大特征值,使用高阶累积量对MPSK信号进行调制识别，包括四元数的各种计算。( Calculate the maximum eigenvalue judgment matrix of AHP, Using high-order cumulants of MPSK signal modulation recognition, Including quaternion various calculations.)

线性方程组的计算，采用的是高斯消元法来实现的。只有主要的算法代码，没有写主函数(Calculation of linear equations using the Gauss elimination method to achieve. Only the main algorithm code, did not write the main function)

burgers方程求解，采用fortran编写，有详细的说明，效果非常好(burgers equations, using fortran prepared a detailed description of the effect is very good)

code for methuristic algorithm flower pollination 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.)

Python for Data Analysis DATA WRANGLING WITH PANDAS, NUMPY, AND IPYTHON

包括牛顿法，阻尼牛顿法，变尺度算法，最速下降法的优化算法程序。(Newton' s method, damped Newton method, variable metric algorithm, the steepest descent method optimization algorithm.)