New analogs of split algorithms for arbitrary Toeplitz-plus-Hankel matrices

DOI10.1109/78.98001zbMath0739.65026OpenAlexW2023261023MaRDI QIDQ3986218

Andrew E. Yagle

Publication date: 27 June 1992

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/78.98001

zbMATH Keywords

fast algorithmsSchur algorithmsfour-term recurrencesplit Levinson algorithmToeplitz-plus-Hankel systems

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (4)

Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications ⋮ A class of iteration methods based on the HSS for Toeplitz systems of weakly nonlinear equations ⋮ On the HSS iteration methods for positive definite Toeplitz linear systems ⋮ Fast triangular factorization of the sum of quasi-Toeplitz and quasi- Hankel matrices

This page was built for publication: New analogs of split algorithms for arbitrary Toeplitz-plus-Hankel matrices