登录
首页 » matlab » RobustControl

RobustControl

于 2009-05-06 发布 文件大小:660KB
0 259
下载积分: 1 下载次数: 47

代码说明:

  Robust自动控制讲义,有练习和matlib的例题,自学Robust控制的好教材!(Robust Automatic Control notes, there are exercises and examples of matlib, Robust control of a good self-study materials!)

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

发表评论

0 个回复

  • Interpolation
    包含了Lagrang和Newton两种插值方法,便于数据的处理(Contains two Lagrang and Newton interpolation method to facilitate the processing of data)
    2013-11-29 22:41:27下载
    积分:1
  • second_task
    课程作业:中心极限定理的仿真~希望有所帮助(The simulation of the central limit theorem)
    2015-04-14 09:52:08下载
    积分:1
  • CPFSK
    MATLAB仿真CPSFK,请大家参考。(MATLAB simulation CPSFK, please refer to.)
    2008-12-12 19:06:37下载
    积分:1
  • CreateDiagram
    This is a Matlab program. It creates the checkerbox images for image processing and test applications.
    2009-09-25 00:40:19下载
    积分:1
  • waveletnn352
    关于小波神经网络的源程序,对研究小波神经网络非常有帮助(on wavelet neural network source, the study wavelet neural network has been very helpful)
    2006-07-15 21:44:56下载
    积分:1
  • matlab_impl_constr
    optimization using matlab
    2012-03-26 13:38:29下载
    积分:1
  • 新建文件夹
    该程序可以实现对于信号的时域参数提取以及信号的包络分析(The program can realize time domain parameter extraction of signals and envelope analysis of signals)
    2019-01-23 17:10:01下载
    积分:1
  • MawSuballo
    Subcarrier allocation in mimo-ofdma
    2011-10-10 03:43:48下载
    积分:1
  • Prize_Collecting_Steiner_Tree
    最小生成树遍历反面的matlab代码,可以参考的,如果需要的话,可以下载啦(Minimum spanning tree traversal negative matlab code, you can refer to, if necessary, you can download it)
    2021-03-23 14:49:15下载
    积分:1
  • GraphTheoryAlgorithmMATLAB
    说明:  图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)
    2010-03-28 15:39:29下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载