登录
首页 » matlab » gm1n

gm1n

于 2021-04-29 发布 文件大小:1KB
0 207
下载积分: 1 下载次数: 15

代码说明:

  多变量灰色模型(Multivariable Grey Model,MGM)MGM(1,n)是研究复杂灰色系统的典型模型,其形式是n元一阶常微分方程组,是单点GM(1,1)模型在多点情况的扩展。(Multivariable grey model MGM (1, n) is a typical model for studying complex grey system. Its form is n n first order ordinary differential equations. It is the expansion of single point GM (1,1) model in multi-point case.)

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

发表评论

0 个回复

  • c语言编码技术介绍
    c语言编码技术介绍-Technology
    2023-07-28 03:15:05下载
    积分:1
  • C++面试试题,值得一看
    C++面试试题,值得一看-C interview questions, the eye-catcher
    2022-03-06 19:41:08下载
    积分:1
  • Order to map any of the distance between two nodes, (2) with two
    求图的任两结点间的距离,(2) 用二维数组存放C和A ,C是原成本矩阵,A 是求出的距离矩阵 (3) 算法采用三重循环,其中最外层的循环变量必须代表中间结点,中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变,最外层的循环变量仍代表中间结点,而中层循环变量代表尾结点,内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q
    2022-04-20 12:55:19下载
    积分:1
  • 经典矩阵运算问题求解
    经典矩阵运算问题求解-classic problem solving matrix operations
    2022-08-10 01:37:35下载
    积分:1
  • 算法,aoe ,图的最小代价路径检索。
    数据结构算法,aoe ,图的最小代价路径检索。-data structure algorithms, aoe, for the minimal cost path retrieval.
    2023-08-07 13:20:03下载
    积分:1
  • tt0202
    1.建立两个有序得链表(带表头,用头插法); //2.写一算法在单链表上实现线性表的ListLength(L)运算。 写一算法将单链表中值重复的结点删除,使所得的结果表中各结点值均不相同。 (1. The establishment of two ordered lists too (with header, with the first interpolation) // 2. To write a method to achieve a single linked linear form of ListLength (L) operations. Write an algorithm to list the value of a single node to delete the duplicate, so the results in the table are not the same as the value of each node.)
    2010-09-10 10:26:46下载
    积分:1
  • 求出任意两个序列的最长公共子序列,使用了动态规划的方法
    求出任意两个序列的最长公共子序列,使用了动态规划的方法-Obtained the longest sequence of any two common sub-sequences, the use of dynamic programming methods
    2022-06-19 05:34:21下载
    积分:1
  • 库管理系统,是一个管理学生学籍的
    数据库管理系统,是一个管理学生学籍的-database management system, is a management student behind the expulsion of
    2022-07-14 10:35:41下载
    积分:1
  • This is a good lesson plans down
    这是一本好教案落-This is a good lesson plans down
    2022-08-02 14:43:25下载
    积分:1
  • 经典的哲学家就餐问题的C语言版本
    经典的哲学家就餐问题的C语言版本-Power wilt die of hunger laugh mold cavity open string问Questions cavity C Pang Sung-linked版
    2022-04-01 07:48:11下载
    积分:1
  • 696518资源总数
  • 105949会员总数
  • 22今日下载