登录
首页 » matlab » fft

fft

于 2020-06-29 发布 文件大小:1KB
0 163
下载积分: 1 下载次数: 81

代码说明:

  信号提取,fft变换,模态分析,互相关分析(fft)

文件列表:

fft.m

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • gszz
    考虑直齿轮热弹耦合,计算啮合刚度及齿轮摩擦热(To thermoelastic coupling calculation consider spur gear meshing stiffness and gear frictional heat)
    2020-07-03 11:00:02下载
    积分:1
  • Moving-Least-Square-Method
    用于多学科设计优化中代理模型技术,移动最小二乘法是代理模型方法的一种(For multidisciplinary design optimization in the agent model, the moving least squares method is a kind of agent model)
    2020-11-12 09:39:43下载
    积分:1
  • gauss
    本程序实现利用高斯全选主元法解矩阵方程,即高斯-约旦法解方程(This program Gaussian Select the primary element method for solving matrix equation, that Gauss- Jordan method of solving equations)
    2012-10-08 09:16:36下载
    积分:1
  • ykb
    用雅可比方法求矩阵的特征值和特征向量的FORTRAN程序(Method using Jacobian matrix of eigenvalues and eigenvectors of the FORTRAN program)
    2007-12-25 10:36:27下载
    积分:1
  • IGA
    基于matlab的人工免疫遗传算法的编程(附注释)希望可以帮到大家 (Based on artificial immune genetic algorithm matlab programming (with comments) the desire to help people)
    2011-04-26 11:08:43下载
    积分:1
  • Riemannmain
    用Roe格式求解黎曼激波管问题的Fortran源代码。可以通过MUSCL插值来提高求解精度。适合计算流体力学的初学者参考学习。(Riemann shock tube problem with Roe scheme. You cam improve the accuracy by MUSCL interpolation. This code is suitable for CFD beginners.)
    2020-12-31 09:48:58下载
    积分:1
  • FEM--CFD
    有限元方法和计算流体力学的经典教材,内容很不错(Finite Element Method- Fluid Dynamics- Zienkwicz and Taylor)
    2014-12-05 10:11:28下载
    积分:1
  • IBVS-master
    MATLAB 下的视觉伺服算法,主要是基于图像的视觉伺服(visual servo alrigritho,mainly is the image based visual servo)
    2020-11-21 19:09:35下载
    积分:1
  • ansys-structure
    ansys 求解桥梁结构弯矩响线的命令流,非常实用(ansys solving the stream of the bridge structure bending ring line command is very useful)
    2012-05-30 12:04:18下载
    积分: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
  • 696518资源总数
  • 105885会员总数
  • 31今日下载