A modification of the Dewilde-van der Veen method for inversion of finite structured matrices

Y. Eidelman*, I. Gohberg

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We study a class of block structured matrices R={Rij}i,j=1N with a property that the solution of the corresponding system Rx=y of linear algebraic equations may be performed for O(N) arithmetic operations. In this paper for finite invertible matrices we analyze in detail factorization and inversion algorithms. These algorithms are related to those suggested by P.M. Dewilde and A.J. van der Veen (Time-varying Systems and Computations, Kluwer Academic Publishers, New York, 1998) for a class of finite and infinite matrices with a small Hankel rank. The algorithms presented here are more transparent and are a modification of the algorithms from the above reference. The approach and the proofs are essentially different from those in the above-mentioned reference. The paper contains also analysis of complexity and results of numerical experiments.

Original languageEnglish
Pages (from-to)419-450
Number of pages32
JournalLinear Algebra and Its Applications
Volume343
DOIs
StatePublished - 1 Mar 2002

Keywords

  • Factorization algorithms
  • Inversion algorithms
  • Linear complexity algorithms
  • Solution of linear equations
  • Structured matrices

Fingerprint

Dive into the research topics of 'A modification of the Dewilde-van der Veen method for inversion of finite structured matrices'. Together they form a unique fingerprint.

Cite this