A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A new algorithm for solving Toeplitz systems of equations
1987
Linear Algebra and its Applications
Preserved Fulltext
We present some recurrences that are the basis for an algorithm to invert an n x n Toeplitz system of linear equations with computational complexity 0( n log2 n). The recurrences used are closely related to the Zohar-Trench and Bareiss algorithms but do not have any obvious connection with other asymptotically fast algorithms for the inversion of Toeplitz systems. LINEAR ALGEBRA AND ZTS APPLICATIONS 88/89:123-138 (1987) 123 0
doi:10.1016/0024-3795(87)90107-8
fatcat:hxpiry6mbbdjfhbn2y76t262y4