登录
首页 » matlab » gm11

gm11

于 2014-02-07 发布 文件大小:1KB
0 176
下载积分: 1 下载次数: 16

代码说明:

  灰色预测gm(1-1)算法,用于短期时间序列预测,包含残差检验等各种必要检验(Gray predicted all the necessary inspection gm (1-1) algorithm for short-term time series prediction, including residuals inspection)

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

发表评论

0 个回复

  • 3Drebuild
    三维图像重建的matlab实现,将输入图像还原成三维形式并显示。(3d rebuild)
    2011-04-28 18:43:21下载
    积分:1
  • example
    图形图像处理方面的一些经典例子,其中包含了8个具有指导意义的图形图像范例。(Graphic image processing aspects of some of the classic examples.)
    2012-05-23 17:55:06下载
    积分:1
  • MSC
    对近红外光谱图进行处理,主要是消除颗粒分布不均匀及颗粒大小产生的散射影响。(To deal with the near infrared spectra, mainly eliminate the uneven distribution of particles and the scattering effects of particle size. )
    2013-10-03 23:03:33下载
    积分:1
  • comm_eg_constgray
    Plot a 16-QAM signal constellation with annotations that indicate the mapping from integers to constellation points. The solution uses the scatterplot function to create the plot and the text function in MATLAB to create the annotations.
    2012-10-16 19:55:06下载
    积分:1
  • INDICES_SOBRESUB
    funcion para determinar indices de desempe帽o
    2013-12-11 09:45:21下载
    积分:1
  • LFLuo_1
    power system distribution load flow(lou method1)
    2015-01-04 17:38:04下载
    积分:1
  • 技术分析指标工具箱(民间版)
    K线图以及常用技术指标的MATLAB实现(Realization of K-Line Diagram and Common Technical Indicators by MATLAB)
    2020-07-03 00:00:01下载
    积分:1
  • imu_calibratio
    通过9位置法进行加速度标定,采集旋转数据进行陀螺仪标定以及磁力计的标定,以达到减小误差为后续姿态跟踪或解算提高精度(IMU calibration)
    2020-12-22 22:49:07下载
    积分: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
  • M2_FSK_Digital_Modulation
    simulink files for fsk modulation and demodulation
    2012-12-03 23:35:22下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载