Fast inversion of triangular Toeplitz matrices

Fu Rong Lin*, Wai Ki Ching, Michael K. Ng

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

26 Citations (Scopus)

Abstract

In this paper, we present an approximate inversion method for triangular Toeplitz matrices based on trigonometric polynomial interpolation. To obtain an approximate inverse of high accuracy for a triangular Toeplitz matrix of size n, our algorithm requires two fast Fourier transforms (FFTs) and one fast cosine transform of 2n-vectors. We then revise the approximate method proposed by Bini (SIAM J. Comput. 13 (1984) 268). The complexity of the revised Bini algorithm is two FFTs of 2n-vectors.

Original languageEnglish
Pages (from-to)511-523
Number of pages13
JournalTheoretical Computer Science
Volume315
Issue number2-3
DOIs
Publication statusPublished - 6 May 2004

Scopus Subject Areas

  • Theoretical Computer Science
  • General Computer Science

User-Defined Keywords

  • Fast cosine transform
  • Fast Fourier transform
  • Interpolation
  • Triangular Toeplitz matrix

Fingerprint

Dive into the research topics of 'Fast inversion of triangular Toeplitz matrices'. Together they form a unique fingerprint.

Cite this