登录
首页 » matlab » motor_controller_id

motor_controller_id

于 2013-12-17 发布 文件大小:18KB
0 256
下载积分: 1 下载次数: 19

代码说明:

  永磁同步电机的id=0控制方法,欢迎大家下载(PMSM id = 0 control, please download)

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

发表评论

0 个回复

  • eclipse
    动态实现循环码的译码!! 只要求输入信息序列!(Dynamic implementation of cyclic codes decoding! ! Only requires input information sequence!)
    2011-06-21 14:28:23下载
    积分:1
  • Leachc
    It consists of matlab code of leach-c protocol along with description of each line of code and other background details.
    2013-01-31 01:48:34下载
    积分:1
  • ch02
    matlab编程的一些例子,仅供初学者参考(matlab programming examples for beginners reference)
    2009-03-27 17:03:08下载
    积分:1
  • chap01_12
    先进pid matlab 仿真 刘金琨 第版 第一章程序 pid matlab simulink liujinkunc hap01_12.rar
    2009-07-17 21:27:24下载
    积分:1
  • shuzhifanxi
    说明:  MATLAB编写的数值分析实验的一些小程序(MATLAB prepared by the numerical analysis of a number of small experimental procedure)
    2006-05-14 09:21:38下载
    积分:1
  • shili96
    制作运用最速下降法解线性方程组的用户界面(Making use of the steepest descent method solving linear equations of the user interface )
    2011-06-28 10:30:06下载
    积分:1
  • BigDataWhitePaper
    Big Data White Paper
    2014-09-15 16:06:22下载
    积分:1
  • DipoleAntenna
    半波振子的MATLAB仿真 电流 方向性图 立体图 阻抗 增益(Half-wave oscillator of the MATLAB simulation of the current pattern Stereogram impedance gain)
    2008-05-31 21:05:32下载
    积分:1
  • danchunxingfa
    单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )
    2011-01-17 21:01:44下载
    积分:1
  • gatbx
    Sheffield工具箱的简单例子,有作者修改,其中doc文件为介绍(the example of Sheffield GA)
    2013-05-08 10:54:03下载
    积分:1
  • 696516资源总数
  • 106913会员总数
  • 8今日下载