For3d

这个程序用来计算四阶累计量，程序中有详细说明(This procedure used to calculate the fourth-order cumulant, the program in detail)

利用元胞自动机以及蒙特卡洛法模拟晶粒生长、凝固相变的一些源程序，以及对两种方法的一些简单文字介绍(The use of cellular automata and Monte Carlo simulation of grain growth, solidification phase change some of the source code, as well as two methods some simple text description)

用于利用最大熵法求解数据资料服从的分布类型。并应用最小二乘法求解模型以得到最优解(Using the maximum entropy method for solving the data distribution type of obedience. And apply the least squares method to obtain the optimal solution to solve the model)

有限体积法求解流动和传热问题的经典源代码(Classic source code finite volume method for solving the problem of flow and heat transfer)

传热计算，有限差分法对传导方程进行离散，纯隐式差分(numerical heat transfer)

矩阵转换问题 行与列的个数均为n 的矩阵称为n 阶方阵。假定矩阵中的每个元素的值在0到9之间，则可以将矩阵中的所有元素按行依次排列得到一个“单行矩阵字符串”。(Matrix conversion, the number of rows and columns of the matrix n are called n-order square. Assume that each element of matrix value in the 0 to 9, you can press all the elements of the matrix rows in order of priority for a " single matrix string." )

应用遗传算法做电网规划，把遗传算法应用于输电网络规划，提出了基于遗传算 法的输电网络规划模型，以新建线路的投资费用和系统年运 行费用之和最小为目标函数，建立了输电网络规划的数学模型。该模型还考虑了“N-1”事故检验，使得规划方案更加合理。以Garver-6节点系统为例进行优化规划(The application of genetic algorithms to do network planning)

四阶龙格库塔法解一阶二元微分方程 应用于数值计算(Fourth-order Runge-Kutta method for solving a class of binary differential equations for numerical calculation)

ANSYS中关于车桥耦合的接触法命令流，车辆模型为二分之一车(About the vehicle.the contact method in ANSYS command stream, with half vehicle model car)

计算离散傅里叶变换的一种快速算法，简称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.)