Complexity of Inversion of Block Triangular Toeplitz Matrices and Solution of Block Triangular Toeplitz Linear Systems
Received:December 16, 1986  
Key Words:   
Fund Project:
Author NameAffiliation
You Zhaoyong Xi'an Jiaotong University 
Lu Hao Xi'an Jiaotong University 
Hits: 2461
Download times: 918
      In this paper, it is showed that the computational complexity of inversion of block triangular Toeplitz matrix U= (U0, U1,…, Un-1 ) is O (m2nlogn + m3), as well as solution of block triangla r Toeplitz linear systems, where U 's are m×m mat rices. By using this results, we reduce arithmetic operations of division of polynomials from O(nlog2n) to O(nlogn).
View Full Text  View/Add Comment  Download reader