登录
首页 » Windows_Unix » stator_current

stator_current

于 2012-05-06 发布 文件大小:2KB
0 239
下载积分: 1 下载次数: 2

代码说明:

  trace stotor current in matlab simulation

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

发表评论

0 个回复

  • platformalignment
    平台惯导初始对准程序仿真 (platform alignment)
    2010-02-23 20:00:50下载
    积分:1
  • Firefly-algorithm-with-chaos
    firefly algorithm with chaos in matlab
    2015-01-06 23:23:58下载
    积分:1
  • myfirprogram
    这是一个用matalb语言实现的FIR滤波器的源代码,直接可以运行,已经经过本人调试通过,对于信号处理的同行有帮助。(this is a matlab program that compute the fir filter and it was been tested by myself.)
    2012-01-16 21:43:55下载
    积分:1
  • armada
    是一个matlab包,主要用于关联分析,可以进行简单关联(association rule)
    2010-12-05 12:44:21下载
    积分:1
  • matlab-aircraft
    Matlab_Simulink 无人机的控制和建模(Using matlab/simulink to control the unmanable aircraft )
    2012-05-16 20:17:27下载
    积分:1
  • 20190829MCMC
    说明:  马尔科夫链蒙特卡洛方法的一个小例子,给了具体的数据和示例(a matlab code for MCMC application)
    2020-02-11 10:30:42下载
    积分:1
  • MatlabPlot
    matlab作图程序总汇,相当的好,包含matlab 源程序与课件(matlab plot summary procedure, rather good, and courseware that contains the source code matlab)
    2009-05-13 19:39:11下载
    积分:1
  • PMSM-speed-sensorless-control-method
    Permanent magnet synchronous motor speed sensorless control method 永磁同步电机的无速度传感器控制策略(Permanent magnet synchronous motor speed sensorless control method)
    2013-05-04 00:39:28下载
    积分:1
  • xiashan
    MATLAB 牛顿下山法的一个小程序,原理就不详细说了。因牛顿迭代法受初值选取的限制,为防止迭代发散,对迭代过程再附加一项要求:|f(x(k+1))|<|f(x(k))|,将牛顿法迭代的结果:x(k+1) =x(k)-f(x(k))/f (x(k))和前一近似值x(k)适当加权平均做为新的改进值:x(k+1)=u*x(k+1) +(1-u)*x(k),其中u(0<> 迭代时u取1开始,逐次减半计算,直至附加要求符合为止。实例计算中x(k)=x(0)不变,只更新u和x(k+1),直至:|f(x(k+1))|<|f(x(k))|(即|f(x(1))|<|f(x(0))|),然后更新下山因子为u=1,继续以牛顿法迭代。(MATLAB Newton-down a small program, the principle is not explained in detail. Newton iteration by the initial value of the selected limit, in order to prevent additional iterative divergence, the iterative process a request: | f (x (k+1)) | < | f (x (k)) | Newton iteration Results: x (k+1) ' = X (k)-f (x (k))/f' (x (k)) and a previous approximation x (k), appropriately weighted average as a new improved value: x (k+1 ) = u* x (k+1) ' + (1-u)* x (k), where u (0 < u> iteration take successive calculated at 50 until the additional requirements found so far. examples of calculation of X ( k) = x (0) unchanged profile u and x (k+1, hungry) until: | f (x (k+1)) | < | f (x (k)) | (i.e. | f (x (1)) | < | f (x (0)) |), then profile downhill factor for u = 1, to continue to Newton iteration.)
    2013-05-15 08:52:09下载
    积分:1
  • DOTNET--Finger-Print-Authentication-Using-Biometr
    DOTNET- Finger Print Authentication Using Biometric Systems
    2015-04-14 09:59:42下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载