-
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
-
拟合
说明: 可以进行平面拟合,基于matlab语言,简单易懂(It can be used for plane fitting. It is simple and easy to understand based on MATLAB language.)
- 2020-06-21 02:20:01下载
- 积分:1
-
Sllcorrelation
分析两时间序列之间的超前和之后关系,计算滞时长度,多用于水文气象方面分析研究(Analysis ahead of and after the relationship between the two time series, calculating the lag length, used for the analysis of hydrometeorological)
- 2020-07-10 10:08:55下载
- 积分:1
-
J2000toWGS84
J2000坐标系与WGS84坐标系之间的转换矩阵计算。(The matrix between J2000 and WGS84 coordinat system)
- 2021-05-16 18:30:07下载
- 积分:1
-
Second-Order-Runge-Kutta-Code
二阶微分方程组,采用龙格库塔法求解,将二阶降为一阶之后在求解。(Second-order differential equations, using the Runge-Kutta method to solve the second-order reduced to an order after solving.)
- 2020-09-22 17:07:50下载
- 积分:1
-
mech_stewartplatform
用于计算stewart 六自由度运动平台的正解问题(this program is designed for stewart platform。)
- 2012-08-02 15:02:47下载
- 积分:1
-
Roughset_GetRules
关于粗糙集对属性进行约简,一个很好的计算工具(On rough set of attributes about Jane, a very good tool)
- 2007-11-26 15:30:37下载
- 积分:1
-
nenkiu_v58
仿真效率很高的,小波包分析提取振动信号中的特征频率,实现用SDRAM运行nios,同时用SRAM保存摄像头数据。( High simulation efficiency, Wavelet packet analysis to extract vibration signal characteristic frequency, Implemented with SDRAM run nios, while saving camera data SRAM.)
- 2016-10-12 23:00:01下载
- 积分:1
-
2DUDFSTOKES
该程序为fluent软件进行速度入口造波数值模拟,波浪为二阶stokes波(The program for the FLUENT software simulation of wave speed entrance numerical, two order Stokes wave)
- 2014-07-11 15:40:02下载
- 积分:1
-
jacobi
对于方程组AX=b,当系数矩阵非奇异时,对原方程进行改写,利用公式X^k=BX^(k+1)+g进行迭代求解。(For equations AX = b, when the coefficient matrix is nonsingular, rewriting the original equation, using the formula X ^ k = BX ^ (k+1)+g for iterative solution.)
- 2013-10-26 10:11:06下载
- 积分:1