A look-ahead Bareiss algorithm for general Toeplitz matrices

Summary. The Bareiss algorithm is one of the classical fast solvers for systems of linear equations with Toeplitz coefficient matrices. The method takes advantage of the special structure, and it computes the solution of a Toeplitz system of order~ $N$ with only~ $O(N^2)$ arithmetic operations, instead of~ $O(N^3)$ operations. However, the original Bareiss algorithm requires that all leading principal submatrices be nonsingular, and the algorithm is numerically unstable if singular or ill-conditioned submatrices occur. In this paper, an extension of the Bareiss algorithm to general Toeplitz systems is presented. Using look-ahead techniques, the proposed algorithm can skip over arbitrary blocks of singular or ill-conditioned submatrices, and at the same time, it still fully exploits the Toeplitz structure. Implementation details and operations counts are given, and numerical experiments are reported. We also discuss special versions of the proposed look-ahead Bareiss algorithm for Hermitian indefinite Toeplitz systems and banded Toeplitz systems.

[1]  Roland W. Freund,et al.  Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Teoplitz systems , 1993 .

[2]  R. W. Freund,et al.  The Look-Ahead Lanczos Process for Large Nonsymmetric Matrices and Related Algorithms , 1993 .

[3]  Richard P. Brent,et al.  Stability of Bareiss algorithm , 1991, Optics & Photonics.

[4]  G. Baxter.  Polynomials defined by a difference system , 1960 .

[5]  M. Morf.  Fast Algorithms for Multivariable Systems , 1974 .

[6]  Per Christian Hansen,et al.  A look-ahead Levinson algorithm for general Toeplitz systems , 1992, IEEE Trans. Signal Process..

[7]  Shalhav Zohar,et al.  Toeplitz Matrix Inversion: The Algorithm of W. F. Trench , 1969, JACM.

[8]  Ilse C. F. Ipsen.  Systolic Algorithms for the Parallel Solution of Dense Symmetric Positive-Definite Toeplitz Systems , 1988 .

[9]  D. Sweet,et al.  The use of pivoting to improve the numerical performance of algorithms for Toeplitz matrices , 1993 .

[10]  T. Kailath.  A Theorem of I. Schur and Its Impact on Modern Signal Processing , 1986 .

[11]  Systolic Algorithms for the Parallel Solution of Dense Symmetric Positive-Definite Toeplitz Systems , .

[12]  Claude Guéguen,et al.  Linear prediction in the singular case and the stability of eigen models , 1981, ICASSP.

[13]  H. Zha,et al.  A look-ahead algorithm for the solution of general Hankel systems , 1993 .

[14]  E. Bareiss.  Numerical solution of linear equations with Toeplitz and Vector Toeplitz matrices , 1969 .

[15]  Ilse C. F. Ipsen,et al.  Parallel solution of symmetric positive definite systems with hyperbolic rotations , 1986 .

[16]  U. Grenander,et al.  Toeplitz Forms And Their Applications , 1958 .

[17]  W. F. Trench.  An Algorithm for the Inversion of Finite Toeplitz Matrices , 1964 .

[18]  Martin H. Gutknecht,et al.  Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems , 1993 .

[19]  James R. Bunch,et al.  Stability of Methods for Solving Toeplitz Systems of Equations , 1985 .

[20]  Sun-Yuan Kung,et al.  A highly concurrent algorithm and pipeleined architecture for solving Toeplitz systems , 1983 .

[21]  Franklin T. Luk,et al.  A Systolic Array for the Linear-Time Solution of Toeplitz Systems of Equations , 1982 .

[22]  B. Anderson,et al.  Asymptotically fast solution of toeplitz and related systems of linear equations , 1980 .

[23]  Werner Henkel.  An extended Berlekamp-Massey algorithm for the inversion of Toeplitz matrices , 1992, IEEE Trans. Commun..

[24]  G. Szegő,et al.  On the Eigen-Values of Certain Hermitian Forms , 1953 .

[25]  Shalhav Zohar,et al.  The Solution of a Toeplitz Set of Linear Equations , 1974, JACM.

[26]  Yasuo Sugiyama,et al.  An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm , 1986, IEEE Trans. Inf. Theory.

[27]  Georg Heinig,et al.  Algebraic Methods for Toeplitz-like Matrices and Operators , 1984 .

[28]  James Durbin,et al.  The fitting of time series models , 1960 .

[29]  N. Levinson.  The Wiener (Root Mean Square) Error Criterion in Filter Design and Prediction , 1946 .

[30]  J. Rissanen.  Algorithms for triangular decomposition of block Hankel and Toeplitz matrices with application to factoring positive matrix polynomials , 1973 .

[31]  Christopher J. Zarowski,et al.  Schur algorithms for Hermitian Toeplitz, and Hankel matrices with singular leading principal submatrices , 1991, IEEE Trans. Signal Process..

[32]  Philippe Delsarte,et al.  A generalization of the Levinson algorithm for Hermitian Toeplitz matrices with any rank profile , 1985, IEEE Trans. Acoust. Speech Signal Process..

[33]  S. Barnett,et al.  Inversion of Toeplitz Matrices which are not Strongly Non-singular , 1985 .

[34]  N. Wiener.  The Wiener RMS (Root Mean Square) Error Criterion in Filter Design and Prediction , 1949 .

[35]  W. Gragg,et al.  The generalized Schur algorithm for the superfast solution of Toeplitz systems , 1987 .

[36]  D. Pal.  Fast algorithms for structured matrices with arbitrary rank profile , 1990 .

[37]  J. L. Roux,et al.  A fixed point computation of partial correlation coefficients , 1977 .