New Fast Algorithms for Toeplitz-Plus-Hankel Matrices

DOI10.1137/S0895479802410074zbMATH Open1062.65032MaRDI QIDQ4650962FDOQ4650962

Authors: G. Heinig, Karla Rost 

Publication date: 21 February 2005

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Recommendations

• New analogs of split algorithms for arbitrary Toeplitz-plus-Hankel matrices
• A Schur algorithm and linearly connected processor array for Toeplitz-plus-Hankel matrices
• Fast algorithms for Toeplitz and Hankel matrices
• Publication:4207515
• scientific article; zbMATH DE number 766243

zbMATH Keywords

fast algorithmLevinson algorithmSchur algorithmToeplitz-plus-Hankel matrixWZ-factorizationZW-factorization

Mathematics Subject Classification ID

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

Cited In (19)

• A Schur algorithm and linearly connected processor array for Toeplitz-plus-Hankel matrices
• Topics in the numerical linear algebra of Toeplitz and Hankel matrices
• Title not available (Why is that?)
• Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices
• Efficient algorithm for Toeplitz plus Hankel matrices
• Fast algorithms for centro-symmetric and centro-skewsymmetric Toeplitz-plus-Hankel matrices
• Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications
• Efficient solution of a Toeplitz-plus-Hankel coefficient matrix system of equations
• Fast iterative methods for solving Toeplitz-plus-Hankel least squares problems
• Fast algorithms for Toeplitz and Hankel matrices
• Fast algorithms for close-to-Toeplitz-plus-Hankel systems and two-sided linear prediction
• Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
• Title not available (Why is that?)
• Efficient algorithms for perturbed symmetrical Toeplitz-plus-Hankel systems
• Title not available (Why is that?)
• Schur algorithms for Hermitian Toeplitz, and Hankel matrices with singular leading principal submatrices
• Computing the characteristic polynomial of generic Toeplitz-like and Hankel-like matrices
• Fast inversion algorithms of Toeplitz-plus-Hankel matrices
• A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials

This page was built for publication: New Fast Algorithms for Toeplitz-Plus-Hankel Matrices

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