登录
首页 » matlab » MATLAB书的例题程序

MATLAB书的例题程序

于 2020-06-18 发布 文件大小:1542KB
0 233
下载积分: 1 下载次数: 0

代码说明:

  本书是比较好的matlab学习资料 可以帮助初学者掌握基本的编程,里边也包含了程序源是很方便的。(This book is a good matlab learning material to help beginners master the basic programming, which also contains the program source is very convenient.)

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

发表评论

0 个回复

  • BayVAR
    Bayesian Vector Autoregression Modeling: BayVAR
    2010-06-13 23:14:31下载
    积分:1
  • 64QAM_system
    64QAM调制解调的MATLAB仿真程序(64QAM modulation and demodulation of the MATLAB simulation program)
    2021-03-31 19:59:09下载
    积分:1
  • MATLAB-bp
    是1-n-1和2-n-1型的基于MATLAB的标准BP算法程序,加入了动量项,以便获得更好的训练效果(Is 1-n-1, and 2-n-1 type of standards-based BP algorithm MATLAB process of accession to the momentum in order to obtain better training results)
    2009-05-25 13:08:56下载
    积分:1
  • RCLS
    在最小二乘参数估计值的基础上,引进补偿项σW2C-1D Ø 0,则获得了参数的无偏估计。针对模型噪声来说,RCLS算法的适应能力比RLS更好。(In the least squares estimation parameters, on the basis of introduction of compensation term σ W2C- 1 d Ø 0, then get the parameters of the unbiased estimation. According to the model for noise, RCLS algorithm adaptive RLS better than.)
    2012-12-28 15:57:51下载
    积分:1
  • 05
    说明:  基于kpca以及pca,dpls流形发的程序,应用于故障检测与故障诊断,还有故障识别,识别的效果很好,对象为cstr,程序简单(Based on kpca and pca, DPLS manifold hair of program, used in the fault detection and fault diagnosis, and fault recognition, identification of the good effect, the object for CSTR, procedure is simple)
    2011-12-26 10:27:59下载
    积分:1
  • FISTA_Radon
    一个用于压缩感知理论的快速随机变换的代码(A fast random code conversion for compressing perceived)
    2014-04-23 14:41:56下载
    积分:1
  • 2
    说明:  首先,对复杂振动信号进行EMD分解,得到各个频率分量,接着,对各分量进行Hilbert变换,得到瞬时频率(END resolve,hilbert chang,evry imf,instantaneous frequency)
    2014-07-15 18:33:33下载
    积分:1
  • 500
    500个零件4台车床加工,用动态规划逆序方法求需要的最短时间(dynamic programming backward)
    2011-05-01 19:54:52下载
    积分:1
  • huangjinfengedian
    黄金分割点的matlab程序,希望对莘莘学子有用哦(matlab progress)
    2012-04-28 20:10:51下载
    积分:1
  • ACA_TSP
    旅行商问题(Travelling Salesman Problem, 简记TSP):假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 此处使用蚁群算法求解TSP问题(Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.Here,we use the procedure of ant colony algorithm to work out the TSP.)
    2013-09-19 22:37:38下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载