Estimation of VAR Models: Computational Aspects
Computational Economics
On the Stability of the Generalized Schur Algorithm
NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
An Efficient Parallel Algorithm to Solve Block-Toeplitz Systems
The Journal of Supercomputing
Fast robust regression algorithms for problems with Toeplitz structure
Computational Statistics & Data Analysis
On the computation of the rank of block bidiagonal Toeplitz matrices
Journal of Computational and Applied Mathematics
Stability of the Levinson Algorithm for Toeplitz-Like Systems
SIAM Journal on Matrix Analysis and Applications
| Hi-index | 0.00 |
This paper provides an error analysis of the generalized Schur algorithm of Kailath and Chun [SIAM J. Matrix Anal. Appl., 15 (1994), pp. 114--128]---a class of algorithms which can be used to factorize Toeplitz-like matrices, including block-Toeplitz matrices, and matrices of the form $T^{T}T$, where $T$ is Toeplitz. The conclusion drawn is that if this algorithm is implemented with hyperbolic transformations in the factored form which is well known to provide numerical stability in the context of Cholesky downdating, then the generalized Schur algorithm will be stable. If a more direct implementation of the hyperbolic transformations is used, then it will be unstable. In this respect, the algorithm is analogous to Cholesky downdating; the details of implementation of the hyperbolic transformations are essential for stability. An example which illustrates this instability is given. This result is in contrast to the ordinary Schur algorithm for which an analysis by Bojanczyk, Brent, De Hoog, and Sweet [SIAM J. Matrix Anal. Appl., 16 (1995), pp. 40--57] shows that the sta- bility of the algorithm is not dependent on the implementation of the hyperbolic transformations.