Classical foundations of algorithms for solving positive definite Toeplitz equations
From MaRDI portal
Publication:1127938
DOI10.1007/BF02575711zbMATH Open0904.65032OpenAlexW2042949957MaRDI QIDQ1127938FDOQ1127938
Authors: G. S. Ammar 
Publication date: 26 January 1999
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02575711
Recommendations
- scientific article; zbMATH DE number 1974610
- A new algorithm for solving Toeplitz systems of equations
- The multistage methods for solving symmetric positive definite Toeplitz systems
- A fast algorithm for solving a Toeplitz system
- A numerical algorithm for finding positive solutions for classes of \(p\)-Laplacian equations
- Toeplitz methods in completeness and spectral problems
- A fast algorithm for solving a Toeplitz system of equations
- Publication:3490848
- scientific article; zbMATH DE number 4098609
- SYSTOLIC ALGORITHMS FOR THE SOLUTION OF TOEPLITZ MATRICES
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Superfast Solution of Real Positive Definite Toeplitz Systems
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Displacement Structure: Theory and Applications
- Algebraic methods for Toeplitz-like matrices and operators
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Numerical experience with a superfast real Toeplitz solver
- Matrix decompositions using displacement rank and classes of commutative matrix algebras
- The Fitting of Time-Series Models
- A new algorithm for solving Toeplitz systems of equations
- Algebras of higher dimension for displacement decompositions and computations with Toeplitz plus Hankel matrices
- A Variant of the Gohberg–Semencul Formula Involving Circulant Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
- Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
- Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
- Displacement ranks of matrices and linear equations
- Complexity of multiplication with vectors for structured matrices
- Generalized Displacement Structure for Block-Toeplitz, Toeplitz-Block, and Toeplitz-Derived Matrices
- On the Use of Certain Matrix Algebras Associated with Discrete Trigonometric Transforms in Matrix Displacement Decomposition
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Displacement operator based decompositions of matrices using circulants or other group matrices
- Condition and Accuracy of Algorithms for Computing Schur Coefficients of Toeplitz Matrices
Cited In (6)
- An exact solution to the Fourier transform of band-limited periodic functions with nonequispaced data and application to non-periodic functions
- Multigrid with FFT smoother for a simplified 2D frictional contact problem
- A fast algorithm for the inversion of general Toeplitz matrices
- A stabilized superfast solver for indefinite Hankel systems
- Optimal polynomial approximants in \(L^p\)
- High-performance processing of covariance matrices using GPU computations
This page was built for publication: Classical foundations of algorithms for solving positive definite Toeplitz equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127938)
