## 24 Citations

Block pivoting implementation of a symmetric Toeplitz solver

- Computer ScienceJ. Parallel Distributed Comput.
- 2014

A fast block Hankel solver based on an inversion formula for block Loewner matrices

- Mathematics
- 1996

We propose a newO(p3n2) algorithm for solving complexnp×np linear systems that have block Hankel structure, where the blocks are square matrices of sizep×p. Via FFTs the block Hankel system is…

A Stabilized Superfast Solver for Nonsymmetric Toeplitz Systems

- Computer ScienceSIAM 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.

Look-ahead schemes for block Toeplitz systems and formal orthogonal matrix polynomials

- Mathematics, Computer Science
- 1997

From these two matrix polynomi-als, all other right FOMPs of block n of a system of block biorthogonal matrixPolynomials with respect to the block Toeplitz moment matrix can be computed in an eecient way.

The Inverses of Block Toeplitz Matrices

- Mathematics, Computer Science
- 2013

It is shown that the inverses of block Toeplitz matrices can be decomposed as a sum of products of block circulant matrices and the inverse formulas are proved to be numerically forward stable.

An Efficient Parallel Algorithm to Solve Block–Toeplitz Systems

- Computer ScienceThe Journal of Supercomputing
- 2005

This algorithm parallelizes the Generalized Schur Algorithm to obtain the semi-normal equations and reduces the communication cost and optimizes the memory access.

A STABILIZED SUPERFAST SOLVER FOR NONSYMMETRIC

- Computer Science
- 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.

Look-ahead methods for block Hankel systems 1

- Mathematics
- 2003

In this paper, the updating formulas used by three look-ahead methods for solving Hankel systems are generalized to the square block case. Each of the original methods was described in the literature…

## References

SHOWING 1-10 OF 40 REFERENCES

A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems

- Computer ScienceSIAM J. Matrix Anal. Appl.
- 1992

An extension of Levinson’s algorithm for solving linear systems with symmetric indefinite Toeplitz matrices is presented. This new algorithm is able to “look ahead” and, if necessary, use block…

A look-ahead Levinson algorithm for general Toeplitz systems

- Computer ScienceIEEE Trans. Signal Process.
- 1992

The authors present an extension of Levinson's algorithm that is guaranteed to be weakly stable for a large class of general Toeplitz matrices, namely, those that do not have many consecutive…

A look-ahead Bareiss algorithm for general Toeplitz matrices

- Computer Science
- 1994

An extension of the Bareiss algorithm to general Toeplitz systems is presented, and 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.

Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems

- Computer Science
- 1993

Look-ahead Levinson and Schur algorithms for non-Hermitian
Toeplitz systems

- Computer Science
- 1995

These generalizations of the nonsymmetric Levinson and Schur algorithms for non-Hermitian Toeplitz matrices with some singular or ill-conditioned leading principal submatrices can be combined with recursive doubling so that an O(N \log^2 N) algorithm results.

Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Teoplitz systems

- Computer Science
- 1993

A Block Toeplitz Look-ahead Schur Algorithm

- Computer Science
- 1995

This paper gives a look-ahead Schur algorithm for nding the symmetric factorization of a Hermitian block Toeplitz matrix. The method is based on matrix operations and does not require any relations…

A look-ahead Schur algorithm

- Computer Science
- 1994

This paper proposes a look-ahead scheme for such matrices and presents empirical results which demonstrate the improvement over the classical Schur algorithm for symmetric Toeplitz matrices with ill-conditioned principal minors.