登录
首页 » matlab » shuankuifadianjibingwang

shuankuifadianjibingwang

于 2018-07-20 发布 文件大小:20KB
0 171
下载积分: 1 下载次数: 35

代码说明:

  风力发电 双馈发电机 并网 仿真 策略 电流滞环控制 锁相环(matlab DFIG dianliu fangzhen suoxianghuan zhihuan)

文件列表:

shuankuifadianjibingwang.mdl, 152742 , 2018-07-20

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

发表评论

0 个回复

  • 该程序以回溯算法为基础 完成后对算法的学习与设计有重要意义...
    该程序以回溯算法为基础 完成后对算法的学习与设计有重要意义-back to the program algorithm based on the completion of the study and algorithm design significance
    2022-11-18 20:20:03下载
    积分:1
  • 经典问题:母牛问题,只是一个作业,希望能对初学者有点帮助...
    经典问题:母牛问题,只是一个作业,希望能对初学者有点帮助-Classic problem: cow problem, is just a job, hoping to be helpful for beginners
    2022-03-06 06:33:56下载
    积分:1
  • 2d CS
    用VB编写的2DCS小游戏,适合新手学习(2DCS, written by VB, is suitable for novice)
    2018-05-27 08:26:13下载
    积分:1
  • omp
    omp算法,经典的相关omp匹配正交追踪算法,很好很强大,比较好用。(OMP algorithm, the classic correlation OMP matching orthogonal tracking algorithm, very good, very powerful, relatively easy to use.)
    2017-10-31 22:18:24下载
    积分:1
  • 雷达成像算法 压缩感知
    雷达成像算法,用于更加清晰的图片重构,是成像算法的鼻祖,这个算法很是地道(radar imaging algorithm)
    2021-04-23 18:48:47下载
    积分:1
  • tanhaoqiangdiwuzhang
    谭浩强c++课件第五章 是一个很好的C++学习课件 值得拥有(Hemopurification c++ courseware fifth chapter is a good learning courseware deserve C++)
    2014-01-14 11:40:14下载
    积分:1
  • Unlimited beautiful three
    漂亮的无极限三层架构,用ajax自动分页,很不错,值得学习!-Unlimited beautiful three-tier structure, with automatic paging ajax, very good, it is worth learning!
    2022-07-07 06:47:30下载
    积分:1
  • ssc_lithium_cell_1RC
    锂离子电池模型 基于simscape平台开发 一阶RC等效电路模型(lithiumBattery model)
    2021-03-12 12:39:25下载
    积分:1
  • 本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序,使得所有的点是按x坐标从小到大排好序的(x坐标相同时y坐标小的排前),然后取下标小...
    本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序,使得所有的点是按x坐标从小到大排好序的(x坐标相同时y坐标小的排前),然后取下标小于n/2属于左边的点集PL,取下标大于n/2属于右边的点集PR,即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法,分别求出PL和PR中的最近点对,最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.
    2022-01-25 16:01:13下载
    积分:1
  • Harris
    区域生长算法,能够提供比较完美的区域生长结果!(Region growing algorithm, can provide the results of region growing more perfect!)
    2009-12-27 19:48:14下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载