# A Superfast Toeplitz Solver with Improved Numerical Stability

@article{Stewart2003AST,
title={A Superfast Toeplitz Solver with Improved Numerical Stability},
author={Michael Stewart},
journal={SIAM J. Matrix Anal. Appl.},
year={2003},
volume={25},
pages={669-693}
}
• M. Stewart
• Published 1 March 2003
• Computer Science
• SIAM J. Matrix Anal. Appl.
This paper describes a new O(n log3(n)) solver for the positive definite Toeplitz system Tx=b. Instead of computing generators for the inverse of T, the new algorithm adjoins b to T and applies a superfast Schur algorithm to the resulting augmented matrix. The generators of this augmented matrix and its Schur complements are used by a divide-and-conquer block back-substitution routine to complete the solution of the system. The goal is to avoid the well-known numerical instability inherent in…
37 Citations

## Tables from this paper

### Consiglio Nazionale delle Ricerche Superfast solution of Toeplitz-like systems

• Computer Science
• 2011
A new O ( N log 3 N ) solver for N × N Toeplitz-like systems, based on a divide and conquer technique, is presented, which relies on the triangular factorization and back-substitution formula for the system seen as a 2 × 2 block system with blocks of half size.

### A superfast solver for real symmetric Toeplitz systems using real trigonometric transformations

• Mathematics
Numer. Linear Algebra Appl.
• 2005
A new superfast O(n log2n) complexity direct solver for real symmetric Toeplitz systems is presented and an interpretation of the equations as a tangential interpolation problem is solved via a divide and conquer strategy and fast DCT.

### Modify Levinson algorithm for symmetric positive definite Toeplitz system

• Computer Science
Numerical Algorithms
• 2015
A new O(N32log(N) solver for the symmetric positive definite Toeplitz system TNxN = bN, based on the block QR decomposition of TN accompanied with Levinson algorithm and its generalized version for solving Schur complements Sm of size m.

### Algorithms for Toeplitz Matrices with Applications to Image Deblurring

The O(n log 2 n) superfast linear least squares Schur algorithm (sflsschur) is presented, which solves a ill-conditioned Toeplitz-like system using Tikhonov regularization and shows the effect of choice of the regularization parameter on the quality of the image reconstruction.

### A Divide and Conquer Algorithm for the Superfast Solution of Toeplitz-like Systems

• Computer Science
SIAM J. Matrix Anal. Appl.
• 2012
A new solver for Toeplitz-like systems, based on a divide and conquer technique, which relies on the triangular factorization and back-substitution formula for the system seen as a $2\times 2$ block system with blocks of half size.

### A fast solver for linear systems with displacement structure

• Computer Science
Numerical Algorithms
• 2010
A fast solver for linear systems with reconstructible Cauchy-like structure, which requires O(rn2) floating point operations and O (rn) memory locations, based on the application of the generalized Schur algorithm to a suitable augmented matrix.

## References

SHOWING 1-10 OF 20 REFERENCES

### A Stabilized Superfast Solver for Nonsymmetric Toeplitz Systems

• Computer Science
SIAM J. Matrix Anal. Appl.
• 2001
A stabilized superfast solver for nonsymmetric Toeplitz systems Tx=b is presented, expressed in such a way that the matrix-vector product T^-1b can be calculated via FFTs and Hadamard products.

### On the stability of the Bareiss and related Toeplitz factorization algorithms

• Computer Science
SIAM J. Matrix Anal. Appl.
• 1995
A numerical stability analysis of factorization algorithms for computing the Cholesky decomposition of symmetric positive definite matrices of displacement rank 2 shows that the Bareiss algorithm for factorizing a symmetricpositive definite Toeplitz matrix is in the class and hence the BareISS algorithm is stable.

### Stabilizing the Generalized Schur Algorithm

• Mathematics, Computer Science
SIAM J. Matrix Anal. Appl.
• 1996
A perturbation analysis is used to indicate the best accuracy that can be expected from a finite-precision algorithm that uses the generator matrix as the input data and shows that the modified Schur algorithm is backward stable for a large class of structured matrices.

### Superfast solution of real positive definite toeplitz systems

• Computer Science
• 1988
An implementation of the generalized Schur algorithm for the superfast solution of real positive definite Toeplitz systems of order n where n = 2^\nu and t is the number of positive definite systems.

### On Hyperbolic Triangularization: Stability and Pivoting

• Mathematics
• 1998
This paper treats the problem of triangularizing a matrix by hyperbolic Householder transformations. The stability of this method, which finds application in block updating and fast algorithms for

### Hyperbolic householder transforms

• Computer Science
• 1988
A class of transformation matrices is developed with a nonorthogonal property designed to permit the efficient deletion of data from least-squares problems, which are shown to effect deletion, or simultaneous addition and deletion, of data with much less sensitivity to rounding errors than for techniques based on normal equations.

### Stability Issues in the Factorization of Structured Matrices

• Computer Science
• 1997
An error analysis of the generalized Schur algorithm of Kailath and Chun is provided, finding 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 generalizedSchur algorithm will be stable.