Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile
From MaRDI portal
Publication:598217
DOI10.1016/j.tcs.2004.01.003zbMath1060.65033OpenAlexW2077222805MaRDI QIDQ598217
Publication date: 6 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.01.003
Levinson algorithmSchur algorithmsplit algorithm\(WZ\)-factorization\(ZW\) factorizationskewsymmetric Toeplitz matrix
Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (2)
Split algorithms for Hermitian Toeplitz matrices with arbitrary rank profile ⋮ Topics in the numerical linear algebra of Toeplitz and Hankel matrices
Cites Work
- Algebraic methods for Toeplitz-like matrices and operators
- DFT representations of Toeplitz-plus-Hankel Bézoutians with application to fast matrix-vector multiplication
- Centro-symmetric and centro-skewsymmetric Toeplitz matrices and Bézoutians
- Existence and uniqueness of WZ factorization
- Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
- Split algorithms for symmetric Toeplitz matrices with arbitrary rank profile
- A parallel linear system solver
- Chebyshev-Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices
- A two-step even-odd split Levinson algorithm for Toeplitz systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile