登录
首页 » matlab » three_level_diode_clamped_single_phase_pwm

three_level_diode_clamped_single_phase_pwm

于 2010-12-03 发布 文件大小:11KB
0 63
下载积分: 1 下载次数: 139

代码说明:

  A Multilevel inverter topology based on spwm.

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

发表评论

0 个回复

  • matlab-image-segmentation
    在图像处理时,有时需要用到图像分割。上述资料可以作为使用matlab进行图像分割的参考资料。(In the image processing, and sometimes need to use the image segmentation. The above information can be used as image segmentation using matlab reference.)
    2014-12-10 17:22:13下载
    积分:1
  • SSC_1.0
    Sparse Subspace clustering, an algorithm which is useful for subspace segmentation and motion tracking--
    2014-02-03 13:26:53下载
    积分:1
  • mfsetup
    说明:  用C语言编的wimax 信道模型,绝对原创!(Wimax compiled by C language channel model, the absolute original!)
    2011-02-25 15:31:17下载
    积分:1
  • digitalImageProcessingGONZALEZ
    冈萨雷斯 数字图像处理(matlab) 用图 非常适合学习matlab数字图像处理的人(Gonzalez Digital Image Processing (Matlab) using maps very suitable for the study of digital image Matlab the people)
    2007-05-15 10:00:30下载
    积分:1
  • Lyapunov
    求解非线性系统的李雅普诺夫指数的MATLAB程序(Lyapunov index of the nonlinear system of MATLAB)
    2015-03-19 20:14:32下载
    积分:1
  • LABVIEW(WAVELET)
    修改后的LABVIEW小波(调用MATLAB)(LABVIEW modified wavelet (call MATLAB))
    2008-12-23 11:39:40下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • Gaussian-eliminat
    高斯消元法MATLAB实现,小报告形式展现(Gaussian elimination MATLAB implementation)
    2013-10-14 17:06:12下载
    积分:1
  • doa_cs_zhangjihong
    基于压缩感知的均匀线阵波达方向估计matlab代码(Estimation matlab code is based on compressed sensing uniform linear array DOA)
    2020-09-21 20:07:52下载
    积分:1
  • Boost
    说明:  boost电路仿真,元件采用的是igbt,用触发脉冲触发的(boost simuliation The components are IGBT and triggered by trigger pulse.)
    2020-06-20 18:00:02下载
    积分:1
  • 696522资源总数
  • 104045会员总数
  • 50今日下载