登录
首页 » matlab » svdnew

svdnew

于 2006-12-09 发布 文件大小:4KB
0 259
下载积分: 1 下载次数: 291

代码说明:

  PMSM直接转矩控制系统的空间辨识,辨识出系统介次,和状态空间模型,从而调节控制器参数(PMSM Direct Torque Control System Identification, identify system Kaiji, and the state-space model, adjust the controller parameters)

文件列表:

svdnew.m

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

发表评论

0 个回复

  • WindowsFormsApplication3
    混合编程matlab与C#,帮助你学习混合编程(matlab and C# hybrid programming)
    2013-12-27 09:00:49下载
    积分:1
  • Transformer-diagnose
    说明:  用matlab实现变压器的故障诊断,信号的采集,分析,级诊断结果的显示(Transformer with a matlab implementation of fault diagnosis, signal acquisition, analysis, display of level diagnosis)
    2011-02-27 10:52:38下载
    积分:1
  • HW5
    My own Fletcher Rieves Optimization engine
    2014-02-24 08:37:13下载
    积分:1
  • MATLAB--GUI
    这些文档里包含了大量MATLAB GUI的实例和方法对GUI图形界面编程很有帮助(These documents contain MATLAB GUI examples and methods to help the GUI graphical interface programming)
    2012-07-06 10:55:39下载
    积分:1
  • BPSK
    Matlab code of volterra series.This is useful in generating volterra series identification toolbox in matlab.There are linked files for generating volterra series.
    2013-04-25 17:12:53下载
    积分:1
  • gold_code_gen
    Communication modeling for Gold code
    2009-11-04 22:02:00下载
    积分:1
  • tsp_nn
    旅行商问题(TSP)的最近邻(NN)算法 近邻算法产生不同的结果,取决于选择哪个城市作为起点。此功能决定近邻路线为多个出发点,并返回这些航线的最佳。 (TSP_NN Traveling Salesman Problem (TSP) Nearest Neighbor (NN) Algorithm The Nearest Neighbor algorithm produces different results depending on which city is selected as the starting point. This function determines the Nearest Neighbor routes for multiple starting points and returns the best of those routes)
    2012-04-06 20:27:45下载
    积分:1
  • svrForEMD-
    基于支持回归向量机的端点延拓程序解决EMD端点效应,包括向左延拓和向后延拓。(EMD solve end effect based on support vector machine regression endpoint extension programs, including the left rear extension and extension.)
    2020-10-19 12:07:25下载
    积分:1
  • Distance_F
    %% 求复杂网络中两节点的距离、平均最短路径长度以及节点间最短路径条数 %% 采用Floyd算法计算任意两节点的距离,并求最短路径条数用于计算介数(Finding the distance between two nodes in a complex network, the average shortest path length, and the number of shortest paths between nodes Calculate the distance between any two nodes using the Floyd algorithm, and find the shortest path number for calculating the in- termediacy)
    2018-05-17 19:53:21下载
    积分:1
  • differential_code
    传号、空号差分码的simulink模拟产生程序(Mark, simulink simulation empty number Differential Code Generator)
    2015-01-08 14:40:59下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载