登录
首页 » matlab » super-MATLAB

super-MATLAB

于 2011-09-10 发布 文件大小:610KB
0 184
下载积分: 1 下载次数: 4

代码说明:

  很实用的教程,和大家一起分享,内含多所高校数学建模培训内容(Very useful tutorial to share with everyone, many colleges and universities included mathematical modeling training)

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

发表评论

0 个回复

  • iirtest
    用双线性变换法设计IIR数字滤波器,程序,用图形显示(Bilinear transformation method of IIR digital filter design, procedures, graphical display)
    2011-06-29 20:59:37下载
    积分:1
  • Jacobi
    Advanced Numerical Methods Jacobi
    2011-11-05 16:39:36下载
    积分:1
  • yuanzhen
    圆形阵波束形成仿真,包括声压噪声的和矢量圆形阵的仿真图(Simulation of circular array beamforming, including sound pressure noise circular array and vector map of the simulation)
    2009-06-11 19:39:29下载
    积分:1
  • Calculator
    Calculator is used to verify the arithmetic results using matlab
    2015-03-02 16:57:51下载
    积分:1
  • Matlab_Simulink
    Matlab Simulink通信系统建模与仿真实例分析.rar(Matlab Simulink Communication System Modeling and Simulation Case Study. Rar)
    2009-02-28 19:14:01下载
    积分:1
  • EgressRouter
    code of an egress router for a mail management system
    2009-12-11 17:28:33下载
    积分:1
  • Fiber_modes
    说明:  本压缩包中还有13个程序,模拟了光在光纤中传输时的模式。希望能够给大家一点帮助(The compression package also 13 procedures, simulation of optical transmission in fiber mode. Want to give us some help)
    2008-10-20 21:33:42下载
    积分:1
  • GeneradorGumbelM
    to generate number gumbel random (hidrology)
    2015-03-16 05:56:02下载
    积分:1
  • matlabhanshusucha
    matlab函数速查手机,非常有用matlab工具(matlab function Handbook for mobile phones, a very useful tool matlab)
    2010-08-08 10:34:11下载
    积分:1
  • GraphTheoryAlgorithmMATLAB
    说明:  图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)
    2010-03-28 15:39:29下载
    积分:1
  • 696516资源总数
  • 106562会员总数
  • 4今日下载