Efficient algorithms for the solution of block linear systems with Toeplitz entries (Q1208301): Difference between revisions

A system of linear equations with a positive definite block matrix is studied. The blocks are Toeplitz matrices (all elements on the same diagonal are equal). Two fast algorithms are given. The first one has a block Levinson structure, the second one reduces the process time to \(O(kp)\) time units in parallel processing where \(k\) is the block order of the system and \(p\) is the dimension of the largest submatrix.