𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stability analysis and fast algorithms for triangularization of Toeplitz matrices

✍ Scribed by Haesun Park; Lars Eldén

Publisher
Springer-Verlag
Year
1997
Tongue
English
Weight
197 KB
Volume
76
Category
Article
ISSN
0029-599X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for the inversion of ge
A fast algorithm for the inversion of general Toeplitz matrices
✍ P.G. Martinsson; V. Rokhlin; M. Tygert 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 590 KB

we propose a "fast" algorithm for the construction of a data-sparse inver'~ of a general Toeplitz matrix. The computational cost for inverting an N × N Toeplitz matrix equals the cost of four length-N FFTs plus an O(N)-term. This cost should be compared to the O(Nlog2N) cost of previously published

Fast algorithm for matrix–vector multipl
Fast algorithm for matrix–vector multiply of asymmetric multilevel block-Toeplitz matrices in 3-D scattering
✍ Benjamin E. Barrowes; Fernando L. Teixeira; Jin A. Kong 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

## Abstract A new __O__(__N__ log __N__) FFT‐based method to expedite matrix–vector multiplies involving multilevel block‐Toeplitz (MBT) matrices is presented. The method is also a minimal memory method with __O__(__N__) memory requirements because only nonredundant entries of the MBT matrix are st

Timing analysis of a parallel algorithm
Timing analysis of a parallel algorithm for Toeplitz matrices on a MIMD parallel machine
✍ I. Gohberg; I. Koltracht; A. Averbuch; B. Shoham 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 644 KB

Gohberg, I., I. Koltracht, A. Averbuch and B. Shoham, Timing analysis of a parallel algorithm for Toeplitz matrices on a MIMD parallel machine, Parallel Computing 17 (1991) 563-577\_ In this paper performance analysis of a parallel Levinson-type algorithm for Toeplitz matrices is given. A modified