Look-ahead methods for block Hankel systems
- 1 November 1997
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 86 (1) , 311-333
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- High performance algorithms for Toeplitz and block Toeplitz matricesLinear Algebra and its Applications, 1996
- Optimized look-ahead recurrences for adjacent rows in the Padé tableBIT Numerical Mathematics, 1996
- Fast Gaussian elimination with partial pivoting for matrices with displacement structureMathematics of Computation, 1995
- The stability of inversion formulas for Toeplitz matricesLinear Algebra and its Applications, 1995
- A Multi-step Algorithm for Hankel MatricesJournal of Complexity, 1994
- A look-ahead algorithm for the solution of general Hankel systemsNumerische Mathematik, 1993
- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systemsLinear Algebra and its Applications, 1993
- Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Teoplitz systemsLinear Algebra and its Applications, 1993
- A look-ahead Levinson algorithm for general Toeplitz systemsIEEE Transactions on Signal Processing, 1992
- Linear complexity parallel algorithms for linear systems of equations with recursive structureLinear Algebra and its Applications, 1987