利用Hankel矩阵的位移性质,得到了矩阵为Hankel矩阵的充要条件.从该充要条件出发,得到了求Hankel矩阵之逆矩阵的快速算法,计算复杂度为O(n2),而一般n阶矩阵求逆的复杂度为O(n3).
[1] PAL D, KAILATH T. Fast triangular factorization and inversion of Hankel and related matrices with arbitrary rank profile [J]. SIAM Journal on Matrix Analysis and Applications 1994, 15.
[2] RISSANEN J. Solution of linear equations with Hankel and Toeplitz matrices [J]. NUMERISCHE MATHEMATIK 1974, 22.
[3] BAREISS E H. Numerical solution of linear equation with Hankel and vector Hankel matrices [J]. NUMERISCHE MATHEMATIK 1969, 13.
[4] GOHBERG I, KAILATH T, KOLTRACHT I. Efficient solution of linear systems of equations with recursive structure [J]. Linear Algebra and Its Applications 1986, 80.
[5] KAIKE H A, BLOCK. Hankel matrix inversion [J]. SIAM Journal on Applied Mathematics 1973, 24.
[6] FREUND R W, ZHA H. A look-ahead algorithm for the solution of general Hankel systems [J]. Numerische Mathematik 1993, 64.
[7] TRENCH W F. An algorithm for the inversion of finite Hankel matrices [J]. Journal of the society for Industrial and Applied Mathematics 1965, 13.
[8] 徐仲, 张凯院, 陆全. Toeplitz矩阵类的快速算法 [M]. 西安:西北工业大学出版社 1999.
