A multi-step algorithm for Hankel matrices

DOI10.1006/jcom.1994.1006zbMath0801.65023OpenAlexW2076657322MaRDI QIDQ1319357

Georg Heinig, Adam W. Bojanczyk

Publication date: 4 December 1994

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1994.1006

zbMATH Keywords

inversiontriangularizationSchur complementsSchur-type algorithmHankel matrices with singular principal minorslook-ahead strategy

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Stable factorization for Hankel and Hankel‐like matrices, A lookahead algorithm for the solution of block Toeplitz systems, Look-ahead methods for block Hankel systems, A stabilized superfast solver for indefinite Hankel systems, Solving Toeplitz systems after extension and transformation, Fast and stable computation of the barycentric representation of rational interpolants, Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems, A fast Hankel solver based on an inversion formula for Loewner matrices