NSGA-II

说明：  模糊指数平滑算法源程序,进行预测 计算.(fuzzy exponential smoothing algorithm source for projection.)

浮点复数基2时分FFT完成适当的FFT，输出改写输入缓冲器。(floating-point complex FFT-based two hours to complete the FFT output rewritten input buffer.)

说明：  矩阵的转置，相乘及界面的面换稀疏矩阵的三元组相加(Sum of the transpose of the matrix, multiplying, and interfacial surface replacing the sparse matrix triples)

C语言实现Matlab中interp1和interp2中的功能。(Interp1 and interp2 in Matlab, C language the function.)

最小二乘法和总体最小二乘法，来自《矩阵分析与应用》(Least squares and total least squares method the Matrix Analysis and Applications )

用乔里斯基分解法求系数矩阵为对称正定右端为常向量的方程组(Demand coefficient matrix with the Cholesky decomposition method for symmetric positive definite the right end of the constant vector equations)

最小二乘法拟合进行n次多项式拟合，N用来控制拟合的次数，例如N=5时进行4次多项式拟合，还回的是拟合系数(Least squares fit polynomial n times, N is used to fit the number of control, e.g., N = 5 When quartic polynomial fitting, further back are fitting coefficients)

说明：  Description 设a[0…n-1]是一个包含n个数的数组，若在ia[j]，则称(i, j)为a数组的一个逆序对（inversion）。 比如 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。 一个n个元素序列的逆序对个数由三部分构成： （1）它的左半部分逆序对的个数，（2）加上右半部分逆序对的个数，（3）再加上左半部分元素大于右半部分元素的数量。 其中前两部分（1）和（2）由递归来实现。要保证算法最后效率O(nlogn)，第三部分（3）应该如何实现？ 此题请勿采用O(n^2)的简单枚举算法来实现。 并思考如下问题： （1）怎样的数组含有最多的逆序对？最多的又是多少个呢？ （2）插入排序的运行时间和数组中逆序对的个数有关系吗？什么关系？ 输入格式 第一行：n，表示接下来要输入n个元素，n不超过10000。 第二行：n个元素序列。 输出格式 逆序对的个数。 输入样例 5 2 3 8 6 1 输出样例 5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array. For example, has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency. The number of inverse pairs of a sequence of n elements consists of three parts: (1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half. The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented? Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)

可实现Dijkstra算法，显示起始点到其它各节点的最短距离和路径(Dijkstra algorithm can be implemented to show the shortest distance and path from the starting point to other nodes.)

一个abaqus梁单元的UEL，配套了理论和inp文件，可以完美运行(A abaqus UEL beam element, supporting the theory and inp file, you can run perfectly)