Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (30): 1-4.DOI: 10.3778/j.issn.1002-8331.2010.30.001

• 博士论坛 • Previous Articles     Next Articles

Fast algorithm for Moore-Penrose inverse of Toeplitz-type matrices

AN Xiao-hong,XU Zhong,LU Quan,WANG Shu-xun   

  1. College of Science,Northwestern Polytechnical University,Xi’an 710072,China
  • Received:2010-05-10 Revised:2010-09-06 Online:2010-10-21 Published:2010-10-21
  • Contact: AN Xiao-hong

行满秩Toeplitz型矩阵Moore-Penrose逆的快速算法

安晓虹,徐 仲,陆 全,王树勋   

  1. 西北工业大学 理学院,西安 710072

  • 通讯作者: 安晓虹

Abstract: A new fast algorithm for Moore-Penrose inverse of Toeplitz-type matrices with full row rank is presented by forming a symmetric block matrix.The computational complexity of this algorithm is Omn)+Om2),while solving T+ from TT(TT T-1 needs Om2n)+O(m3).Examples show the efficiency of the fast algorithm.

Key words: Toeplitz-type matrix, Moore-Penrose inverse, symmetric, fast algorithm

摘要: 通过构造对称分块矩阵给出了秩为mm×n阶Toeplitz型矩阵Moore-Penrose逆的快速算法。该算法计算复杂度为Omn)+Om2),而由TTTTT-1直接求解所需运算量为Om2n)+O(m3)。数值算例表明了该快速算法的有效性。

关键词: 06Toeplitz型矩阵, Moore-Penrose逆, 对称化, 快速算法

CLC Number: