Structure and arithmetic complexity of products and inverses of Toeplitz matrices
From MaRDI portal
Publication:755830
DOI10.1016/0024-3795(91)90293-6zbMath0722.15006OpenAlexW2080375645WikidataQ59341876 ScholiaQ59341876MaRDI QIDQ755830
Elliot Linzer, Martin Vetterli
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/33913
computational complexityproductboundsinverseToeplitz matricesnumber of multiplicationsTrench formula
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
On the stability of solution methods for band Toeplitz systems ⋮ Product rules for the displacement of near-Toeplitz matrices
Cites Work
- New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices
- On algebras of Toeplitz matrices
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- On the stability of solution methods for band Toeplitz systems
- Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications
- Stability of Methods for Solving Toeplitz Systems of Equations
- Superfast Solution of Real Positive Definite Toeplitz Systems
- The lower bound of the number of multiplication operations for calculating the product of hankel matrices
- Algebraic Complexity Theory
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- A New Algorithm for Inner Product
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Structure and arithmetic complexity of products and inverses of Toeplitz matrices
