登录
首页 » matlab » dynamics

dynamics

于 2010-04-24 发布 文件大小:1KB
0 219
下载积分: 1 下载次数: 0

代码说明:

说明:  动力系统中的分支程序,主要研究动力系统的周期(Branch of dynamical systems program, the main research cycle power system)

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

发表评论

0 个回复

  • Projet_RLS
    RLS matlab program, very good
    2009-03-29 13:11:52下载
    积分:1
  • AspectsofengineeringforprogramMATLABGUI
    说明:  工程供配电方面的MATLAB GUI程序(Aspects of engineering for program MATLAB GUI )
    2010-04-18 14:53:13下载
    积分:1
  • Wavelet_Decomposition_For_Images-(1)
    matlab codes for project
    2014-09-02 00:43:38下载
    积分:1
  • 2
    说明:  第2章 线性方程组求解 (jingtong matlab kexue jisuan )(Chapter 2 Solving linear equations (jingtong matlab kexue jisuan))
    2008-10-23 17:15:54下载
    积分:1
  • med
    最小熵解卷积(MED),是一种自适应滤波器设计方法,可以提取冲击成分(Minimum entropy deconvolution (MED), is an adaptive filter design method that can extract the impact of component)
    2013-10-09 15:53:16下载
    积分:1
  • mm-tools
    matlab中处理视频的库文件,可以对各种格式的视频进行读、写操作(matlab libraries to handle the video, you can read or write various formats of video)
    2010-11-15 18:35:31下载
    积分:1
  • UKF
    这是关于UKF(无味卡尔曼滤波算法)算法的matlab程序(This is on the UKF algorithm matlab program)
    2013-08-13 14:59:13下载
    积分:1
  • pathsim10
    Pathsim相关资料,基于watterson信道模型。希望有所帮助。(Pathsim relevant information, based watterson channel model. Hope that helps.)
    2021-04-23 22:28:48下载
    积分:1
  • untitled
    光伏电池内部模型,simulink仿真光伏电池内部结构(The internal model of photovoltaic cells)
    2015-04-19 16:42:29下载
    积分:1
  • path_discovery
    自己编写的利用matlab实现无线自组织网AODV仿真的算法源码。 为由50个节点构成的网络。在50m×50m大小的区域内,随机的产生50个节点。由用户指定源节点和目的节点,程序负责给出从源节点到目的节点的最小路径和此路径的跳数。各个节点之间设定为只要在自己直接通信范围内的其它节点,均一跳可达。(Write your own realization of the use of matlab simulation of wireless self-organizing network algorithms AODV source. The grounds of a network of 50 nodes. Size of 50m × 50m in area, randomly generated 50 nodes. By the user to specify the source node and destination node, the program responsible for the given node from the source node to the destination path and this path is the minimum number of hops. Set between each node to communicate directly as long as within the scope of their other nodes, all jump up.)
    2021-04-15 16:08:55下载
    积分:1
  • 696518资源总数
  • 106148会员总数
  • 10今日下载