Abstract
We briefly describe the generalized Schur algorithm for the superfast solution of positive definite Toeplitz systems of equations and its relationship with Schur's algorithm and the Szegö recursions. We then present some experimental results obtained with our FORTRAN implementation of this superfast Toeplitz solver. The algorithm displays favorable behavior in that the growth rates of the resulting residuals and errors are comparable with those of the Szegö recursions.
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
