shuzhijisuan

用C++编写的一维和二维快速傅里叶变换程序(Prepared with C++ one-dimensional and two-dimensional fast Fourier transform procedure)

自己写了一个二维Euler方程的间断有限元程序 上次发了一个三角形单元的程序 因为不是曲边单元 所以在圆柱后面容易形成涡 现在把程序改为曲边四边形单元了 没有涡出现 单元是8节点四边形单元 节点编号顺序是 1 5 2 6 3 7 4 8 也就是四个角点依次 是1 2 3 4 然后是边的中点编号 5 6 7 8. 时间推进采用 Runge-Kutta 方法 数值通量采用全局Lax-Friedrichs通量 仍然不能捕捉激波 因为没有做重构或者加人工粘性 等这个做出来了 再发一次。 程序没有进行优化 比如说内存的消耗没有优化 比如直边单元的边界积分仍然采 用了曲边的积分方法 增加了计算量 比如面积分、线积分都是采用的是Gauss- Legendre-Lobatto积分 积分精度会比一般的Gauss-Legendre积分精度低一阶 等 等问题。 二维的 纯属交流性质 就没有考虑这些问题 ^_^ 如果物面全部是直边 那么只要改变一个参数N 就可以获得不同的计算精度 且具 有谱精度 因为单元的节点是Gauss-Legendre-Lobatto积分点。 其实就是谱元法 （物面是曲边的情况我不清楚是不是也可以通过提高基函数的阶数 也就是增加N 来提高计算精度）(Wrote a two-dimensional Euler equations with discontinuous finite element program Last made ​ ​ a triangular element of the program, not curved edge unit is so easy to form a vortex in the cylinder behind the Program to curved edge quadrilateral element vortices appear Unit is the order of 8-node quadrilateral element node number is 15,263,748 which is the four corners of the points in turn Is 1234 and then the side of the midpoint of the number 5678. Time promote the use of Runge-Kutta method Numerical flux of the overall situation of Lax-Friedrichs, flux Still can not capture the shock wave did not do the reconstruction or artificial viscosity do it Zaifayici. The program is not optimized for example, memory consumption is not optimized such as straight-edge boundary integral of the unit is still mining Integral method to increase the amount of computation such as surface integral with a curved edge, the line integral using the Gauss- The Legendr)

混合储能，风机，光伏，柴油机之间的优化配置的仿真分析程序(Optimize the allocation of mixed storage, wind, solar, diesel between Simulation Software)

湍流模型re计算流体力学软件udf 可以用于修改UDF文件(turbulence model FLUENT)

C语言实现多项式的最小二乘拟合，可用于在区间上对函数进行拟合(C language polynomial least squares fitting, can be used to fit the function on the interval)

格子boltzmann方法模拟2D圆柱绕流程序 C++程序d2Q9模型(Lattice boltzmann simulation program 2D flow around a cylinder model of C++ program d2Q9)

FFT DIF 分裂基的C语言代码，比较好的说明了整个流程(FFT DIF split the base of the C language code, better explains the entire process)

最小二乘法拟合进行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)

完成了复数矩阵的计算,采用了并行算法原理，较快速的处理了稀疏矩阵方程结构。(Completed a complex matrix computation, parallel algorithm principle, more rapid processing of the sparse matrix equation structure.)

这是用C++编写的 用高斯方法求解方程的方法 我想对与计算机数学的同学来说 可能会有用(It is written with C++ method for solving equations using Gaussian approach I want to mathematics and computer may be useful for the students)