登录
首页 » matlab » Matlabansys

Matlabansys

于 2008-04-09 发布 文件大小:259KB
0 126
下载积分: 1 下载次数: 61

代码说明:

  Matlab有限元分析与应用,很好很重要(Matlab finite element analysis and applications, very good is very important)

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

发表评论


0 个回复

  • UWB4
    UWB,超宽带信号分析必用的子函数,第4部分!(UWB, ultra-wideband signal analysis will be used for Functions, Part 4!)
    2010-07-05 13:20:34下载
    积分:1
  • GCPanneal2
    图论研究中的图着色问题的matlab程序,非常好用啊!(Study of Graph Theory Graph Coloring Problem of matlab program, very easy to use ah!)
    2008-07-21 08:21:59下载
    积分:1
  • random_classifier
    这是中心近邻分类器的算法,采用的算子是LBP,数据库采用的是CK数据库。(This is the center of neighbor classifier algorithm, is the LBP operator is used, the database USES a CK database. )
    2013-11-18 17:27:03下载
    积分:1
  • Configurable-Simulink-Model-for-DC-DC-Converters-
    Configurable Simulink Model for DC-DC Converters with PWM PI Control
    2015-03-13 05:51:20下载
    积分:1
  • 201112191637
    I am a third year master major in automation at Shanghai Jiao Tong University, P. R. China. With tremendous interest in Industrial Engineering, I am writing to apply for acceptance into your Ph.D. graduate program.
    2013-12-30 13:02:54下载
    积分:1
  • power allocatin
    noma的固定算法和树形算法的matlab仿真,可以直接运行。(Matlab simulation of fixed algorithm and tree algorithm of noma can run directly.)
    2020-07-01 21:20:02下载
    积分:1
  • imageprocessing
    课件详细的讲解了关于图像处理和分析的相关知识(Detailed explanation of courseware on image processing and analysis knowledge)
    2010-12-11 00:23:24下载
    积分:1
  • Dijkstra
    说明:  最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解,但由于它遍历计算的节点很多,所以效率低。   Dijkstra算法是很有代表性的最短路算法,在很多专业课程中都作为基本内容有详细的介绍,如数据结构,图论,运筹学等等。 (The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
    2008-11-26 22:27:45下载
    积分:1
  • Time-Domain-codes
    有限时域差分算法计算Mie散射有限时域差分算法计算Mie散射(Finite-difference time-domain algorithm to calculate the Mie scattering)
    2013-05-16 21:49:45下载
    积分:1
  • che_zai_ni_bian_qi
    车载并联均流型逆变器的设计与实现.前级高频升压采用推挽软开关技术。(Onboard parallel pattern and realize the inverter design. )
    2014-08-13 09:39:26下载
    积分:1
  • 696518资源总数
  • 105471会员总数
  • 21今日下载