On the computation of the null space of Toeplitz-like matrices

zbMATH Open1188.65026MaRDI QIDQ964070FDOQ964070

Authors: Nicola Mastronardi, Marc van Barel, Raf Vandebril 

Publication date: 14 April 2010

Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/223762

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• An improved Toeplitz algorithm for polynomial matrix null-space computation
• The generalized Schur algorithm and some applications
• Publication:4952723
• Publication:3471632
• Efficient algorithm for Toeplitz plus Hankel matrices

zbMATH Keywords

kernelnumerical examplesToeplitz matrixHankel matrixnull spacegeneralized Schur algorithm

Mathematics Subject Classification ID

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

Cited In (5)

• Recursive Algorithms to Update a Numerical Basis Matrix of the Null Space of the Block Row, (Banded) Block Toeplitz, and Block Macaulay Matrix
• A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
• An improved Toeplitz algorithm for polynomial matrix null-space computation
• Linear spaces of Toeplitz and nilpotent matrices
• The generalized Schur algorithm and some applications

This page was built for publication: On the computation of the null space of Toeplitz-like matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964070)