Fast algorithm for Moore-Penrose inverse of Toeplitz-type matrices
Shuxun Wang · Computer Engineering and Applications Journal · 2010
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 O(mn)+O(m2),while solving T+ from TT(TTT)-1 needs O(m2n)+O(m3).Examples show the efficiency of the fast algorithm.