A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Efficient algorithms for the solution of block linear systems with Toeplitz entries
1993
Linear Algebra and its Applications
This paper is concerned with the development of fast solvers for block linear systems with Toeplitz entries. Two algorithms are described. The first utilizes block permutations to unravel the nesting structure of the associated matrix. The second has a block Schur type format and features highly parallel potential.
doi:10.1016/0024-3795(93)90322-f
fatcat:rpm2epx56rfmxan4tp4zb7ywy4