-
lyapunov_wolf
lyapunov指数求解，采用wolf法，计算速度极快(lyapunov Index solving, using wolf law, the calculation speed)
- 2007-10-08 09:49:07下载
- 积分：1
-
Viscoelastic
粘弹正演程序和模型实例,2维数值模拟正演，适应于粘弹介质，(This program can be two-dimensional numerical simulation of acoustic wave equation, Viscoelastic isotropic media.)
- 2013-12-09 15:07:58下载
- 积分：1
-
constantDeqn
常微分方程及其方程组的求解. 运用数值计算方法进行计算的完整函数,可以方便的调用.编程语言C-C(Ordinary Differential Equations and their equations. The use of numerical method to calculate the complete function, can easily call. Programming language CC)
- 2008-01-01 13:47:38下载
- 积分：1
-
rr440
计算多重分形非趋势波动分析matlab程序,包括脚本文件和函数文件形式，AHP层次分析法计算判断矩阵的最大特征值。( Calculation multifractal detrended fluctuation analysis matlab program, Including script files and function files in the form, Calculate the maximum eigenvalue judgment matrix of AHP.)
- 2020-12-11 09:09:18下载
- 积分：1
-
shenliu
有限元计算基本程序，为毕业论文时编写的局部渗流计算程序。(Finite element method the basic procedures for the thesis prepared by local seepage calculation procedures.)
- 2007-08-20 14:00:54下载
- 积分：1
-
ta-ansys
这是一段杆塔建模的命令流，可用于ansys有限元分析(This is a tower of order flow modeling, finite element analysis can be used to ansys)
- 2021-04-20 16:58:50下载
- 积分：1
-
HGT
WRF模拟结果气象要素的检验对比，包含均方根误差，偏差和相关系数等(WRF simulation test results comparing meteorological elements, including the root mean square error, deviations and correlation coefficients)
- 2021-03-17 15:29:21下载
- 积分：1
-
kriging
kriging方法源程序，用于kriging方法构建近似模型，方便易懂(kriging method source，Kriging method used to construct an approximate model, easy to understand)
- 2021-04-26 10:08:45下载
- 积分：1
-
graphAnalysis
该文件是用matlab开发的图论分析工具箱，
里面有使用时的详细说明，pdf说明文档。
绝对实用对于图论的研究者(The document was developed with matlab graph theory analysis toolbox, which are used when a detailed explanation, pdf documentation. Absolutely useful for researchers in graph theory)
- 2008-12-31 13:20:25下载
- 积分：1
-
KFFT
计算离散傅里叶变换的一种快速算法，简称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.)
- 2013-12-18 22:32:50下载
- 积分：1
