Efficient algorithms for the solution of block linear systems with Toeplitz entries

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Glentis, G. O., & Kalouptsidis, N. (1993). Efficient algorithms for the solution of block linear systems with Toeplitz entries. Linear Algebra and Its Applications, 179(C), 85–104. https://doi.org/10.1016/0024-3795(93)90322-F

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free