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

DOI10.1109/78.98001MaRDI QIDQ3986218zbMATH OpenOpenAlexFDO

Authors 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 algorithmsfour-term recurrenceSchur algorithmssplit Levinson algorithmToeplitz-plus-Hankel systems

Mathematics Subject Classification ID

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

Recommendations

• New Fast Algorithms for Toeplitz-Plus-Hankel Matrices
• Fast algorithms for Toeplitz and Hankel matrices
• Publication:4207515
• scientific article; zbMATH DE number 2201223

Cited in

(19)

• On the HSS iteration methods for positive definite Toeplitz linear systems
• Fast triangular factorization of the sum of quasi-Toeplitz and quasi- Hankel matrices
• A new type of matrix splitting and its applications
• Split algorithms for Hermitian Toeplitz matrices with arbitrary rank profile
• Averaging operators for exponential splittings
• New splitting iteration methods for Toeplitz-plus-Hankel systems
• Comments on “Multiway Splitting Method for Toeplitz Matrix Vector Product”
• Split algorithms for centrosymmetric Toeplitz-plus-Hankel matrices with arbitrary rank profile
• Split algorithms for symmetric Toeplitz matrices with arbitrary rank profile
• A Schur algorithm and linearly connected processor array for Toeplitz-plus-Hankel matrices
• scientific article; zbMATH DE number 4128294 (Why is no real title available?)
• Fast algorithms for close-to-Toeplitz-plus-Hankel systems and two-sided linear prediction
• New Fast Algorithms for Toeplitz-Plus-Hankel Matrices
• DCT- and DST-based splitting methods for Toeplitz systems
• A class of iteration methods based on the HSS for Toeplitz systems of weakly nonlinear equations
• Chebyshev-Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices
• Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile
• Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications
• Efficient algorithms for perturbed symmetrical Toeplitz-plus-Hankel systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986218)