Abstract :
The inverse of a Toeplitz matrix Tn can be represented in different ways by Gohberg-Semencul-type formulas as the sum of products of upper and lower triangular Toeplitz matrices. If we have given such a formula, we can solve every equation Tnξ = b in O(n log n) steps. There are three main questions arising with such representations of Tn−1: (1) which special linear equations can be solved in order to get generating vectors for Gohberg-Semencul-type formulas, (2) which algorithm we want to apply to solve these questions, and (3) which special Gohberg-Semencul-type formula we want to use for evaluating Tn−1b. In this paper we present an elementary approach to derive all Gohberg-Semencul-type formulas. Then we introduce representations of Tn−1 with special properties. In particular we prove that there exists a Gohberg-Semencul-type formula such that the generating vectors are pairwise orthogonal. Finally, based on the previous results, we give new fast and stable algorithms for solving linear Toeplitz systems that can be used to compute generating vectors for Gohberg-Semencul-type formulas. In the case of a breakdown or near-breakdown in the kth step, the new method introduces a perturbation in the kth entry tk of Tn such that the perturbed submatrix T̂k is well conditioned. By using the Sherman-Morrison-Woodbury formula it is possible to recover the original problem as soon as the corresponding submatrix Tk + r is again nonsingular.
