On the computation of the nullspace of Toeplitz-like matrices
Nicola Mastronardi, Marc Van Barel, Raf Vandebril · Lirias · 2008
The knowledge of the nullspace and its size of some structured matrices, like Hankel and Toeplitz matrices, is important in many applications arising in system theory. In this paper we describe an algorithm to compute the kernel of Toeplitz and Hankel matrices based on the generalized Schur algorithm.