-
Gaussianeliminationmethod
用C语言来求解n维线性方程组的解，即高斯消元法求解线性方程组(Gaussian elimination method with n-dimensional linear equations)
- 2010-07-14 21:27:06下载
- 积分：1
-
传递熵的计算方法jidt-master
多种传递熵的计算方法，包括离散和连续信号的传递熵计算，包括多种核函数(JIDT: An information-theoretic to olkit for studying the dynamics of complex systems)
- 2016-07-07 10:04:22下载
- 积分：1
-
Delany_Bazley
纤维状多孔材料的D_B吸声模型，用于计算高孔隙率的刚性多孔材料的吸声系数(D_B absorption model fibrous porous material for sound absorption coefficient high porosity rigid porous material)
- 2021-03-13 10:09:25下载
- 积分：1
-
shaungtuoqiu
用于焊接模拟的fluent的双椭球体热源UDF程序。(For welding simulation fluent double ellipsoid heat source UDF program.)
- 2016-03-13 14:38:49下载
- 积分：1
-
pso
粒子群算法，也称粒子群优化算法或鸟群觅食算法（Particle Swarm Optimization），缩写为 PSO。它具有精度高，收敛快等优点，广泛用于系统辨识、函数优化等领域。文件pso.m是粒子群算法辨识程序，在此基础上，需要自行编写目标函数计算程序以实现不同系统的参数辨识。(Particle swarm optimization (PSO), also known as particle swarm optimization algorithm or bird swarm foraging algorithm (Particle Swarm Optimization), abbreviated as PSO. It has the advantages of high precision and fast convergence. It is widely used in system identification, function optimization and other fields. The document pso.m is a particle swarm algorithm identification program. On this basis, it is necessary to write an object function calculation program to realize the parameter identification of different systems.)
- 2017-09-29 12:52:29下载
- 积分：1
-
kde
给定样本点，采用高斯核密度估计，求出概率密度分布函数。(It is good to use this method to evaluate pdf)
- 2017-08-17 10:40:57下载
- 积分：1
-
fft_change
快速傅立叶变换的程序，附有试验用数据，希望对大家有所帮助(Fast Fourier Transform procedure, with test data, and they hope to help everyone)
- 2008-02-01 12:14:16下载
- 积分：1
-
The-UDF-for-phase-change-of-water
Fluent 中短语模拟水的受热蒸发相变的UDF程序代码(the UDF for phase change of water)
- 2014-01-06 19:38:21下载
- 积分：1
-
Kalman3
卡尔曼滤波程序，完成一维数据卡尔曼数据滤波(Kalman filtering process, the completion of one-dimensional data Kalman filter data)
- 2009-01-09 20:01:18下载
- 积分：1
-
program
FFT A计权 倍频程分析 三分之一倍频程分析(F F T A w eight o c tave a n al o n e t hird o ctave)
- 2011-12-07 14:02:04下载
- 积分：1
