We use a two-step Durbin method rather than the single step version in the
even-odd split Levinson algorithm for strongly nonsingular real symmetric T
oeplitz systems with arbitrary right-hand side, thereby slightly reducing t
he complexity of this algorithm to 19/8n(2) + O(n) flops on a sequential ma
chine. We also present extensive numerical results comparing several Levins
on-type methods. (C) 2001 Elsevier Science Inc. All rights reserved.