Out-of-band quasiseparable matrices

Y. Eidelman*, I. Gohberg

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

We study structured matrices which consist of a band part and quasiseparable parts below and upper the band. We extend algorithms known for quasiseparable matrices, i.e. for the case when the band consists of the main diagonal only, to a wider class of matrices. The matrices which we consider may be treated as an usual quasiseparable matrices with larger orders of generators. Hence one can apply the methods developed for usual quasiseparable matrices and obtain various linear complexity O (N) algorithms. However in this case the coefficients in N in the complexity estimates turns out to be quite large. In this paper we use the structure more accurately by division of the matrix into three parts in which the middle part is the band instead of diagonal as it is used for usual quasiseparable matrices. This approach allows to use better the structure of the matrix in order to improve the coefficients in N in the complexity estimates for the algorithms. This method works for algorithms which keep invariant the structure.

Original languageEnglish
Pages (from-to)266-289
Number of pages24
JournalLinear Algebra and Its Applications
Volume429
Issue number1
DOIs
StatePublished - 1 Jul 2008

Keywords

  • Linear complexity algorithms
  • Quasiseparable matrices
  • Structured matrices

Fingerprint

Dive into the research topics of 'Out-of-band quasiseparable matrices'. Together they form a unique fingerprint.

Cite this