Fast algorithms for Toeplitz and Hankel matrices

From MaRDI portal
Publication:2431168





The paper presents a self-contained survey of fast algorithms for solving linear systems of equations with Toeplitz or Hankel coefficient matrices. The authors discuss algorithms of Levinson-type and Schur-type. In the case in which the matrices have additional symmetry properties, the authors develop split algorithms.



Cites work


Cited in
(41)








This page was built for publication: Fast algorithms for Toeplitz and Hankel matrices

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