Numerical Stabilization of the Banded Levinson Algorithm
Donald T. Gavel · 1990
This paper presents a numerically stable algorithm for solving banded Toeplitz systems of n linear equations. The algorithm is "fast" in that it requires only O(nq) operations, where q is the bandwidth of the matrix. An earlier version of the banded Toeplitz algorithm presented in the literature suffers from numerical instability.