Solving linear systems with a Levinson-like solver

In this paper we will present a general framework for solving linear systems of equations. The solver is based on the Levinson idea for solving Toeplitz systems of equations. We will consider a general class of matrices, defined as the class of simple (p1 , p2 )-Levinson conform matrices. This class incorporates for instance semiseparable, band, companion, arrowhead and many other matrices. For this class of we will derive a solver of complexity O(p1 p2 n). The system solver is written inductively, and uses in every step k, the solutions of so called kth order Yule-Walker-like equation. The first obtained algorithm has complexity O(p1 p2 n 2). Based, however on the specific structure of the simple (p1 , p2 )-Levinson conform matrices, we will be able to further reduce the complexity of the presented method, and get an order O(p1 p2 n) algorithm. Different examples of matrices are given admitting this algorithm. Examples are presented for: general dense matrices, upper triangular matrices, higher order generator semiseparable matrices, quasiseparable matrices, Givens-Vector representable semiseparable matrices, band matrices, companion matrices, confederate matrices, arrowhead matrices, fellow and many more. Finally, the relation between this method and an upper triangular factorization of the original matrix are given and also details concerning possible look–ahead methods are presented.nrpages: 27status: publishe