登录
首页 » Others » fdtd_1d_code

fdtd_1d_code

于 2013-09-26 发布 文件大小:1KB
0 99
下载积分: 1 下载次数: 1

代码说明:

  基于fdtd算法的一维程序,采用matlab进行编写,简单易懂(Fdtd algorithm based on one-dimensional program, using matlab to prepare, easy to understand)

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

发表评论

0 个回复

  • LEACH.wsnlab.ir
    这是我们实验所使用的LEACH算法代码。在m=1时,相同的代码可以用于FIAR(This is the LEACH code we have used. The same code can be used for FAIR if m=1 )
    2012-07-24 10:02:20下载
    积分:1
  • perkecsudut1
    deltafrek1 is example plot figure in matlab from simulink to bode using toworkspace
    2012-11-29 05:19:34下载
    积分:1
  • HLRF_method
    一次可靠度的HLRF算法。随机向量的概率模型采用Nataf分布,考虑变量相关性。验算点搜寻采用U空间的梯度迭代算法。(This is a first-order reliability method based on HLRF algorithm. A multivariate distribution model,Nataf model,is used to generate the random variables. To search the design point in indenpent standard Gauss space, a kind of gradient iterative algorithm is adopted.)
    2020-11-09 20:09:46下载
    积分:1
  • WPDV-HOP 粒子群算法与dv-hop算法的改进
    wpdv-hop算法,dvhop算法的一种改进,粒子群算法与dv-hop算法的改进(Improved wpdv-hop algorithm, dvhop algorithm, PSO algorithm with dv-hop Improvement)
    2020-09-20 21:47:54下载
    积分:1
  • plota_EEG
    the plot of EEG power spectral values
    2010-07-19 03:30:10下载
    积分:1
  • getFormantData
    matlab code for getting formant frequencies
    2009-12-14 11:23:58下载
    积分:1
  • ejidaolib
    基于LQR控制算法的二级倒立摆Simulink仿真模型(the double inverted pendulum Simulink simulation model based on LQR control algorithm)
    2021-03-09 16:09:27下载
    积分:1
  • matlab-sources
    说明:  matlab经典算法源程序,包括插值与拟合、规划问题、绘图、解方程、数据分析等(classical algorithm matlab source, including interpolation and fitting, programming, drawing, solving equations, data analysis, etc.)
    2011-03-25 13:14:29下载
    积分:1
  • sanweichongjian
    一种基于快速空间频域算法和位相解包裹的三维重建算法。(Spatial frequency domain based on fast phase unwrapping algorithms and three-dimensional reconstruction algorithm.)
    2011-06-16 17:28:41下载
    积分:1
  • Floyd
    从任意一条单边路径开始。所有两点之间的距离是边的权,或者无穷大,如果两点之间没有边相连。   2,对于每一对顶点 u 和 v,看看是否存在一个顶点 w 使得从 u 到 w 再到 v 比己知的路径更短。如果是更新它。   3,不可思议的是,只要按排适当,就能得到结果。(A unilateral path from any start. All the distance between two points is the right side, or infinity, if there is no edge between two points connected. 2, for each pair of vertices u and v, to see if there is a vertex w from u to w and then to make than the known path v shorter. If you are updating it. 3, incredibly, just press the appropriate row, you can get results.)
    2011-09-02 23:33:33下载
    积分:1
  • 696518资源总数
  • 104432会员总数
  • 16今日下载