登录
首页 » LabView » sound-speed

sound-speed

于 2011-12-01 发布 文件大小:9KB
0 89
下载积分: 1 下载次数: 14

代码说明:

  通过换能器测量得到材料的信号到达时间,根据一些已知条件以及声学公式计算材料的声速(Measured by the transducer signal arrival time of the material, according to some known conditions, and calculated acoustic velocity materials)

文件列表:

声速测试.vi,10588,2010-11-26

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

发表评论

0 个回复

  • FiniteElementMethod
    有限元方法与C程序设计 介绍有限元方法原理和如何设计C程序,书后有相关代码。(Finite element method with the C programming)
    2010-01-01 16:10:54下载
    积分:1
  • fortran
    圆柱绕流的数值模拟(基于有限体积法),Fortran程序(Numerical simulation of flow around a cylinder (based on the finite volume method), Fortran program)
    2009-11-21 18:21:30下载
    积分:1
  • lyb
    对于应用数学专业学习非线性混沌控制的学生非常有用,可以下载并尝试自己动手改变后半部分,就能应用于新系统中(For students applied mathematics learning nonlinear chaotic control is very useful, you can download and try yourself to change the second half, will be able to be applied to the new system)
    2012-11-28 14:25:14下载
    积分:1
  • 差分法
    电磁场数值计算中的差分法在matlab中的实现(The realization of difference method in numerical calculation of electromagnetic field in matlab)
    2018-07-01 20:29:03下载
    积分:1
  • 实验1
    说明:  利用不动点迭代和牛顿迭代求解非线性方程解的理论(Theory of Solving Nonlinear Equations by Fixed Point Iteration and Newton Iteration)
    2019-05-07 16:56:30下载
    积分:1
  • practice6_17
    用矩阵法求定积分1/(1+x^2)dx,区间是(-4,4)(Definite Integral Matrix Method)
    2010-05-17 01:34:47下载
    积分:1
  • Gauss
    matlab中高斯迭代法使用的m文件,可以用于方程组近似值的求解。(m file matlab Gauss iterative method can be used for approximation of solving equations.)
    2012-06-04 18:55:14下载
    积分:1
  • 01
    说明:  此文件为源代码,经过多次验证可行。将代码输入lingo就可以运行(Immune algorithm to solve the maximum clique problem source code of this file, feasible after several validation. Matlab code input can run.)
    2013-02-01 16:58:53下载
    积分:1
  • matlabtoolbox
    说明:  matlab的时频分析工具箱,含全部工具箱程序(Matlab time-frequency analysis toolbox, including all toolbox programs)
    2019-02-21 09:32:46下载
    积分: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
  • 696524资源总数
  • 103945会员总数
  • 46今日下载