实阵和有理阵的一些快算复杂性

THE TIME COMPLEXITY OF COMPUTING DETEMINANT FOR REAL AND REASONABLE AND THE REVERSE FOR REASONABLE MATRICES

给出在Ｓｔｒａｓｓｅｎ矩阵乘法基础上的不同于文献［１］所提出的方法，但同样是的实阵行列式求值的快速算法，有理阵行列式求值的Ｏ（ｎ￣２）的快速算法和有理三角阵求逆的Ｏ（ｎ￣２）的快速算法等。

Fast algorithms for copmuting determiant for real and reasonable matrices withand O(n￣2)respectively,and for compuling the reverse of triangular reasonablematrices wiht O(n￣2)are given, which are different from the algorithms presented in Ref,[1]