Split algorithms for Hermitian Toeplitz matrices with arbitrary rank profile
From MaRDI portal
Publication:1887505
DOI10.1016/j.laa.2004.06.011zbMath1063.65025OpenAlexW2166054973MaRDI QIDQ1887505
Publication date: 26 November 2004
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2004.06.011
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile
- Algebraic methods for Toeplitz-like matrices and operators
- Parallel and superfast algorithms for Hankel systems of equations
- DFT representations of Toeplitz-plus-Hankel Bézoutians with application to fast matrix-vector multiplication
- Linear algebra, rational approximation and orthogonal polynomials
- The Even-Odd Split Levinson Algorithm for Toeplitz Systems
- A Stabilized Superfast Solver for Nonsymmetric Toeplitz Systems
- Fast Triangular Factorization and Inversion of Hermitian, Toeplitz, and Related Matrices with Arbitrary Rank Profile
- Split algorithms for symmetric Toeplitz matrices with arbitrary rank profile
- Immitance-Type Three-Term Schur and Levinson Recursions for Quasi-Toeplitz Complex Hermitian Matrices
- Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices
- Inversion of Toeplitz Matrices which are not Strongly Non-singular
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Chebyshev-Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices
- A two-step even-odd split Levinson algorithm for Toeplitz systems
This page was built for publication: Split algorithms for Hermitian Toeplitz matrices with arbitrary rank profile
