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

  • Glentis G
  • Kalouptsidis N
  • 4

    Readers

    Mendeley users who have this article in their library.
  • 2

    Citations

    Citations of this article.

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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • George Othon Glentis

  • Nicholas Kalouptsidis

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free