Split algorithms for Hermitian Toeplitz matrices with arbitrary rank profile (Q1887505): Difference between revisions

The main aim of this work is to design split Levinson and Schur algorithms for Hermitian Toeplitz matrices with an arbitrary rank profile. The Levinson-type algorithm can be seen as a generalization of the algorithms proposed by \textit{B. Krishna} and \textit{H. Krishna} [SIAM J. Appl. Math. 49, No. 4, 1275--1282 (1989; Zbl 0679.65030)] and by \textit{H. Krishna} and \textit{S. Morgera} [IEEE Trans. Acoust. Speech Signal Process. 35, 839--848 (1987)] algorithms to general nonsingular Hermitian Toeplitz matrices.