Abstract
We present some recurrences that are the basis for an algorithm to invert an n× n Toeplitz system of linear equations with computational complexity O( n log 2 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
