A Look-Ahead Block Schur Algorithm for Toeplitz-Like Matrices

DOI10.1137/S0895479892232649zbMath0824.65010MaRDI QIDQ4835402

Ali H. Sayed, Thomas Kailath

Publication date: 13 November 1995

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

displacement structurecomplexity of the algorithmblock Schur algorithmmatrix displacement rankSchur reductionToeplitz- like matrix

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (9)

A stabilized superfast solver for indefinite Hankel systems ⋮ High performance algorithms for Toeplitz and block Toeplitz matrices ⋮ Schur functions and their realizations in the slice hyperholomorphic setting ⋮ Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems ⋮ On a class of matrices with low displacement rank ⋮ On the computation of the rank of block bidiagonal Toeplitz matrices ⋮ Fast Computation of the Matrix Exponential for a Toeplitz Matrix ⋮ Fast cholesky factorization algorithm for s. p. d block-Toeplitz matrices ⋮ A look-ahead block Schur algorithm for diagonal plus semiseparable matrices

This page was built for publication: A Look-Ahead Block Schur Algorithm for Toeplitz-Like Matrices