登录
首页 » matlab » AC_DC

AC_DC

于 2014-01-09 发布 文件大小:7KB
0 232
下载积分: 1 下载次数: 6

代码说明:

  整流器模型mdl模型,希望对初学者理解整理过程有用(Mdl model rectifying model, I hope useful for beginners to understand the process)

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

发表评论

0 个回复

  • StevenSecant
    说明:  两个关于数值分析的matlab演示,十分有用(2 on Numerical Analysis matlab demo, very useful)
    2010-04-16 16:57:39下载
    积分:1
  • pso1
    particle swarm optimization for loss reduction
    2013-12-13 17:33:19下载
    积分:1
  • Perceptron
    Perceptron mono couche
    2015-04-14 02:01:17下载
    积分:1
  • 复杂网络
    说明:  求网络图中各节点的度及度的分布曲线, 聚类系数及整个网络的聚类系数,和复杂网络中两节点的距离以及平均路径长度(Find the degree and degree distribution curve of each node in the network graph, the clustering coefficient and the clustering coefficient of the whole network, the distance between two nodes in the complex network and the average path length)
    2020-04-10 19:53:55下载
    积分:1
  • Broad-Band-Antenna
    利用matlab对超宽带天线进行建模分析设计(Using matlab modeling of UWB antenna analysis and design)
    2010-10-21 21:16:44下载
    积分:1
  • overlapaddmethod
    OVERLAP ADD METHOD FOR CALCULATING THE CONVOLUTION OF LONG SEQUENCE
    2012-08-09 15:58:40下载
    积分:1
  • wendaolianghuatouzi
    本书主要讲述以MATLAB为分析工具的量化投资,有 MATLAB入门 、“MATLAB量化投资基础”和“MATLAB量化投资相关函数详解”3篇组成。(This book focuses on MATLAB as analytical tools to quantify investment, " MATLAB Started" , " MATLAB-based quantitative investment" and " MATLAB Detailed quantitative investment related functions" three components.)
    2020-09-11 00:08:00下载
    积分:1
  • rayleigh_channel
    一个很好的产生瑞利分布信道的matlab程序(Rayleigh channel matlab program)
    2013-12-14 15:35:03下载
    积分:1
  • simulink
    simulink的仿真基础 内容详尽 讲解具体适用于simulink4.0以上版本(simulink simulation on the basis of specific detailed above apply to simulink4.0)
    2008-05-31 20:39:53下载
    积分:1
  • Question1
    说明:  C++源代码,递归实现。原问题描述:鼓上蚤时迁到一个山洞里去盗宝,里面有n件宝贝,价值分别是a1,a2......an,并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包,能装的东西最大价值是K,他只能进洞一次,请问他最多能带出多少? 要求:输入K,n,a1,a2......an 输出:他能最多带出的宝物价值 (C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)
    2008-12-02 21:07:25下载
    积分:1
  • 696518资源总数
  • 106155会员总数
  • 8今日下载