On the stability of a two-sided sweep algorithm

A two-sided sweep algorithm is proposed for numerical solution of systems of linear equations with nonsingular tridiagonal $n\times n$-matrices, whose arithmetical cost is about $18n$ operations. We prove the componentwise backward stability of the algorithm.