A look-ahead block schur algorithm for diagonal plus semiseparable matrices

Y. Eidelman, I. Gohberg

Research output: Contribution to journalArticlepeer-review

Abstract

A look-ahead recursive algorithm for the block triangular factorization of matrices represented as a sum of diagonal and semiseparable ones is derived. This factorization is used for fast solving of the corresponding linear system. For the case of sizes of diagonal blocks not depending on dimension of original matrix, the algorithm obtained has linear complexity. For a wide class of matrices, the algorithm exhibits stable behavior.

Original languageEnglish
Pages (from-to)25-34
Number of pages10
JournalComputers and Mathematics with Applications
Volume35
Issue number10
DOIs
StatePublished - May 1998

Keywords

  • Block Schur algorithm
  • Fast algorithm
  • Linear equations
  • Look-ahead algorithm
  • Semiseparable matrices

Fingerprint

Dive into the research topics of 'A look-ahead block schur algorithm for diagonal plus semiseparable matrices'. Together they form a unique fingerprint.

Cite this