Classical foundations of algorithms for solving positive definite Toeplitz equations
From MaRDI portal
Publication:1127938
DOI10.1007/BF02575711zbMath0904.65032OpenAlexW2042949957MaRDI QIDQ1127938
Publication date: 26 January 1999
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02575711
Related Items
Optimal polynomial approximants in \(L^p\) ⋮ A stabilized superfast solver for indefinite Hankel systems ⋮ High-performance processing of covariance matrices using GPU computations ⋮ Multigrid with FFT smoother for a simplified 2D frictional contact problem ⋮ An exact solution to the Fourier transform of band-limited periodic functions with nonequispaced data and application to non-periodic functions ⋮ A fast algorithm for the inversion of general Toeplitz matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices
- Algebraic methods for Toeplitz-like matrices and operators
- Displacement operator based decompositions of matrices using circulants or other group matrices
- A new algorithm for solving Toeplitz systems of equations
- Displacement ranks of matrices and linear equations
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Complexity of multiplication with vectors for structured matrices
- Numerical experience with a superfast real Toeplitz solver
- Matrix decompositions using displacement rank and classes of commutative matrix algebras
- Algebras of higher dimension for displacement decompositions and computations with Toeplitz plus Hankel matrices
- Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
- The Fitting of Time-Series Models
- Superfast Solution of Real Positive Definite Toeplitz Systems
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- A Variant of the Gohberg–Semencul Formula Involving Circulant Matrices
- Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
- Generalized Displacement Structure for Block-Toeplitz, Toeplitz-Block, and Toeplitz-Derived Matrices
- Condition and Accuracy of Algorithms for Computing Schur Coefficients of Toeplitz Matrices
- On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
- On the Use of Certain Matrix Algebras Associated with Discrete Trigonometric Transforms in Matrix Displacement Decomposition
- Displacement Structure: Theory and Applications
- An Algorithm for the Inversion of Finite Toeplitz Matrices
