Structure and arithmetic complexity of products and inverses of Toeplitz matrices
DOI10.1016/0024-3795(91)90293-6zbMATH Open0722.15006OpenAlexW2080375645WikidataQ59341876 ScholiaQ59341876MaRDI QIDQ755830FDOQ755830
Authors: 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
Recommendations
computational complexityinverseboundsproductToeplitz matricesnumber of multiplicationsTrench formula
Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20) Theory of matrix inversion and generalized inverses (15A09)
Cites Work
- Superfast Solution of Real Positive Definite Toeplitz Systems
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Title not available (Why is that?)
- A New Algorithm for Inner Product
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Stability of Methods for Solving Toeplitz Systems of Equations
- Title not available (Why is that?)
- On algebras of Toeplitz matrices
- New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices
- Title not available (Why is that?)
- On the stability of solution methods for band Toeplitz systems
- Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications
- The lower bound of the number of multiplication operations for calculating the product of hankel matrices
- Algebraic Complexity Theory
Cited In (3)
This page was built for publication: Structure and arithmetic complexity of products and inverses of Toeplitz matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q755830)
