jobshop

极小 算法（Min-Min）、极大极小算法(Max-Min)、最大时间跨度算法（Max-Int）三种典型的映射算法的算法原理以及计算程序(Minimal algorithm (Min-Min), max-min algorithm (Max-Min), maximum time-span algorithm (Max-Int) three typical mapping algorithm and the algorithm of the calculation program)

包括管道和边界层的大涡模拟fortran95原代码(Including pipelines and large eddy simulation of boundary layer source code fortran95)

说明：  主要用于Fluent 中风剖面、湍流剖面以及耗散率剖面的开发，应用的是日本的规范。(It is mainly used for the development of fluent stroke profile, turbulence profile and dissipation rate profile, and it is applied to the specifications of Japan.)

最小二乘法拟合曲线C++代码，任意的M个数据，任意的次数N(N不易太高)。输出拟合曲线的表达式(Least Squre For ...)

feap 有限元程序，国外某大学的开源程序(feap finite element program)

求解二维平面等熵涡的matlab程序，计算流体力学，MacCormack格式，均匀网格(Solving two-dimensional plane isentropic vortex matlab program, computational fluid dynamics, MacCormack format, uniform grid)

fluent软件UDF，用于焊接过程模拟，是高斯分布的面热源。(weld heart source)

abaqus二次开发UMAT在损伤方面的应用(ABAQUS two development of UMAT in the application of damage)

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

frotran输入矩阵自编小程序，可以生成任意大小矩阵，并写入制定文件(frotran input matrix composing small program that can generate any size matrix, developed and written documents)