Extension of the rissanen algorithm to the factorization of block-Hankel matrices for solving systems of linear equations

DOI10.1515/dma-2017-0008zbMath1376.65030OpenAlexW2607512057MaRDI QIDQ1675528

Mikhail A. Cherepnev

Publication date: 2 November 2017

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2017-0008

zbMATH Keywords

block-Hankel matricesblock-Toeplitz matricesRissanen algorithmsolvers of linear equations

Mathematics Subject Classification ID

Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Toeplitz, Cauchy, and related matrices (15B05)

Related Items (1)

Modification of Rissanen's method in linear memory

Cites Work

• A fast Hankel solver based on an inversion formula for Loewner matrices
• Solution of linear equations with Hankel and Toeplitz matrices
• The Inverses of Block Hankel and Block Toeplitz Matrices
• Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials

This page was built for publication: Extension of the rissanen algorithm to the factorization of block-Hankel matrices for solving systems of linear equations