Quarter

采用随机数产生2到10阶的随机矩阵，并实现了矩阵的相关运算，比如：加减，乘除，求逆，求行列式(Using random Numbers generated random matrix from 2 to 10 order , and achieving relative to the implementation of the matrix operations, such as: add and subtract, multiple and divided, inverse and determinant)

用ANSYS对梁进行优化设计，分为优化分析文件，优化控制文件，求解方法几个方面。(Using ANSYS to optimize the design of the beam, divided into optimization analysis files, optimize the control file, the method for solving aspects.)

Fortran编写的用来计算集中力在三维半空间弹性体中下表面应力的程序。(Written in Fortran is used to calculate the stress concentration at the surface in three-dimensional space of half an elastomer program.)

说明：  应用改进的CC法求取时间延迟和嵌入维数，效果不错(The modified CC method to strike a time delay and embedding dimension, good results)

J2000坐标系与WGS84坐标系之间的转换矩阵计算。(The matrix between J2000 and WGS84 coordinat system)

说明：  采用Lax-Friedrichs通量分裂，使用C++编写程序，有限差分法(Lax-Friedrichs flux splitting, C ++ programming, finite difference method)

一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems. Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)

弗洛伊德算法最短距离的实现，输入为邻接矩阵，输出为最短距离矩阵。(Freud' s realization of the algorithm for the shortest distance, enter the adjacency matrix output for the shortest distance matrix.)

利用有限元法计算悬臂梁的实例，包含详细说明，适合用于课程设计。(Using the finite element method to calculate the cantilever instance, contains a detailed description, suitable for curriculum design.)

分别采用GMM和KDE对Iris数据集进行密度建模，并进行对比。通过EM算法来确定GMM参数，通过交叉验证来确定K值(GMM and KDE respectively Iris data set of density modeling, and compared. GMM by EM algorithm to determine the parameters of K determined by the value of cross-validation)