发信人: helloboy (hello), 信区: DataMining
标 题: matrix calculation
发信站: 南京大学小百合站 (Thu Oct 24 09:19:06 2002), 站内信件
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: 202.38.215.15]
