-
fourier_trans
傅立叶变换的C语言实现，可在Turbo C以及Visual C++下实现。(Fourier Transform C language, in Turbo C and Visual C under.)
- 2006-12-31 11:06:45下载
- 积分：1
-
catch
用于求解线性方程组的追赶法！！！程序经过优化处理，运行速度快，且注释完全易于阅读，欢迎大家下载！！(Solving linear equations for the law to catch up! ! ! Optimized procedures to deal with, fast, and completely easy-to-read notes, welcome you to download! !)
- 2009-05-16 11:56:39下载
- 积分：1
-
Optimal-solution-back-to-France-0-1
最优解回溯法0-1问题，为了构造最优解，必须在算法中记录与当前最优值相应的当前最优解。(The optimal solution backtracking 0-1 must be recorded in the algorithm, in order to construct the optimal solution, corresponding to the current optimal value, the current optimal solution.)
- 2012-04-11 23:41:56下载
- 积分：1
-
jokdr
由散点插值生成等值线,并且提供颜色选择工具,共有三种插值方法(Generating isolines from scattered interpolation and providing a color selection tool, there are three interpolation methods)
- 2018-11-21 16:03:28下载
- 积分：1
-
Euler_DG_Quadrilateral_2D
自己写了一个二维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)
- 2021-01-29 12:58:40下载
- 积分：1
-
grid_adaptation_structure
CFD数值计算中关于求解激波问题的基于非结构网格的自适应网格方法相关代码(CFD numerical calculation of the shock problem based on the unstructured grid method of adaptive grid method)
- 2015-09-18 10:27:23下载
- 积分：1
-
Gauss
高斯消元法、高斯列主元消元法解线性方程组。程序由本人独立完全独立完成。版权所有！(Gaussian elimination method out PCA Gaussian elimination method for solving linear equations. I am independent program consists entirely independently. All rights reserved!)
- 2013-08-10 12:31:59下载
- 积分：1
-
fft
一个短时傅里叶变换的C语言实现，对3万个数据进行加窗、FFT处理(A short time Fourier transform of C language, for 30,000 data windowing, FFT processing)
- 2020-08-15 18:58:26下载
- 积分：1
-
PMV-VB
PMV，的热舒适指标计算程序VB编码，可供参考(PMV, thermal comfort index calculation program VB code, for reference)
- 2020-11-17 16:09:40下载
- 积分：1
-
na7
Orthogonal Polynomials Approximation
数值分析，计算正交基多项式的系数
(Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance.
Format of function
int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps )
where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial.
Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)
- 2011-11-27 11:47:21下载
- 积分：1
