On the Stability of the Generalized Schur Algorithm

The generalized Schur algorithm (GSA) is a fast method to compute the Cholesky factorization of a wide variety of structured matrices. The stability property of the GSA depends on the way it is implemented. In [15] GSA was shown to be as stable as the Schur algorithm, provided one hyperbolic rotation in factored form [3] is performed at each iteration. Fast and efficient algorithms for solving Structured Total Least Squares problems [14,15] are based on a particular implementation of GSA requiring two hyperbolic transformations at each iteration. In this paper the authors prove the stability property of such implementation provided the hyperbolic transformations are performed in factored form [3].

[1]  S. Chandrasekaran,et al.  A Fast Stable Solver for Nonsymmetric Toeplitz and Quasi-Toeplitz Systems of Linear Equations , 1998 .

[2]  Ali H. Sayed,et al.  Stabilizing the Generalized Schur Algorithm , 1996, SIAM J. Matrix Anal. Appl..

[3]  Ali H. Sayed,et al.  Displacement Structure: Theory and Applications , 1995, SIAM Rev..

[4]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[5]  Sabine Van Huffel,et al.  Fast Structured Total Least Squares Algorithm for Solving the Basic Deconvolution Problem , 2000, SIAM J. Matrix Anal. Appl..

[6]  T. Kailath,et al.  Generalized Displacement Structure for Block-Toeplitz,Toeplitz-Block, and Toeplitz-Derived Matrices , 1994 .

[7]  Thomas Kailath.  Displacement structure and array algorithms , 1999 .

[8]  Richard P. Brent,et al.  A Note on Downdating the Cholesky Factorization , 1987 .

[9]  T. Kailath,et al.  Fast Parallel Algorithms for QR and Triangular Factorization , 1987 .

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

[11]  Thomas Kailath,et al.  Fast reliable algorithms for matrices with structure , 1999 .

[12]  M. Morf,et al.  Displacement ranks of matrices and linear equations , 1979 .

[13]  Gene H. Golub,et al.  Matrix computations , 1983 .

[14]  Michael A. Stewart,et al.  Stability Issues in the Factorization of Structured Matrices , 1997, SIAM J. Matrix Anal. Appl..

[15]  Paul E. Saylor,et al.  Use of the Singular Value Decomposition with the Manteuffel Algorithm for Nonsymmetric Linear Systems , 1980 .

[16]  Adam W. Bojanczyk,et al.  On the stability of the Bareiss and related Toeplitz factorization algorithms , 2010, SIAM J. Matrix Anal. Appl..