快速判别H矩阵的计算复杂性

THE TIME COMPLEXITY OF DETERMINATIONOF A NONSINGULAR H-MATRIX

Ｈ矩阵在工程技术和经济学等研究中具有广泛用途，然而，其判别是困难的，关于Ｈ阵判别的研究，已受到高度重视，通过研究Ｈ阵的特征，利用二分递推技术研究其快速判别，证明了计算复杂性为Ｏ（ｎ￣（ｌｏｇ２７））。

H-matrices are very important in application fields, and to determinate a matrixif it is a H-matrix is diffcult. This paper investigates the characters of H-matrices, and thetime complexity O of a fast algorithm for the determination for a n×n H-matrix isproved.