-
FFT
提供函数能进行1维2维的FFT，输入输出的序列长度应为2的整数次方倍(Provides functions can be one-dimensional two-dimensional FFT, sequence length input and output should be an integer power of 2 times)
- 2014-01-07 22:10:34下载
- 积分：1
-
rili
计算日期时间，可以显示不同颜色，主要用以计算上班日期，换班日期，十分方便。(Daliy Calc)
- 2015-05-04 13:37:15下载
- 积分：1
-
FFT_Original
FFT/IFFT 变换程序----------------(FFT/IFFT transformation process----------------)
- 2010-07-14 19:48:13下载
- 积分：1
-
shaungtuoqiu
用于焊接模拟的fluent的双椭球体热源UDF程序。(For welding simulation fluent double ellipsoid heat source UDF program.)
- 2016-03-13 14:38:49下载
- 积分：1
-
synthesis-of-mechanism
对于给定的一组轨迹点，用优化方法实现铰链四杆机构轨迹复演。优化方法为共轭梯度法。(For a set of track points,we use a optimization method to optimize the track of Hinge four-bar mechanism. The optimization method is conjugate gradient.)
- 2011-06-23 15:42:20下载
- 积分：1
-
calculator
用mfc实现计算器的基本操作，支持键盘输入，并保留xp风格,可计算平方，幂，时间显示等操作(With mfc achieve the basic operation of the calculator, support for keyboard input, and retain xp style, calculates the square, power, time display and other operations)
- 2013-10-23 15:22:24下载
- 积分：1
-
tianwen
说明： VC实现，天文导航算法及实现
包括数据的获取、加工、处理、保存为文件(VC, astronomy, navigation algorithm and implementation including data acquisition, processing, handling, preservation of documents)
- 2020-09-29 16:17:44下载
- 积分：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
-
TouYing
主要功能是进行高斯正算，高斯反算及透视方位投影的显示。(Main function is to be considered are Gaussian, inverse Gaussian and the perspective projection display position.)
- 2009-05-06 08:38:45下载
- 积分：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
