📄 469.txt
字号:
发信人: fervvac (高远), 信区: DataMining
标 题: Re: matrix calculation
发信站: 南京大学小百合站 (Thu Oct 24 16:23:00 2002), 站内信件
What does your min() means?
According to your definition, it seems A^n contains values x at cell(i,j)
s.t., x is the shortest path from i to j via (n-1) node. Therefore, if
ytour min() is to take min() among all corresponding cells in the matrix
array, then it should be the shortest distance between i, and j and that is
a classic problem.
【 在 helloboy (hello) 的大作中提到: 】
: I am devoting myself into a shortest path solution problem.
: In my research, I came up with a hard problem which slow down
: my research progress. If you are interested in such a kind of problem
: Research together with me. I am anticipating your response.
: In my another paper, I use matrix A to represent linkage matrix.
: When I calculates M=A+A^2+A^3+.....+A^n+......, I use
: (E-A)M=E for fast calculation.
: But in my this new article , I redefined the A^2 as
: A^2(i,j)=min(A(i,k)+A(k,j))
: k
: I also testify that A^(m+n)=A^m+A^n
: So I now need to calculate M=min(A,A^2,A^3,...).
: Note that the meaning of A^n is different from the traditional matrix multip
: lication.
: I can't use E-A any more. What else can I use? I am confused.
--
※ 来源:.南京大学小百合站 bbs.nju.edu.cn.[FROM: 143.89.41.4]
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -