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. © 1993.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below