On the computation of the nullspace of Toeplitz–like matrices
نویسندگان
چکیده
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.
منابع مشابه
Block Toeplitz Algorithms for Polynomial Matrix Null-space Computation
In this paper we present new algorithms to compute the minimal basis of the nullspace of polynomial matrices, a problem which has many applications in control. These algorithms take advantage of the block Toeplitz structure of the Sylvester matrix associated with the polynomial matrix. The analysis done in both aspects, algorithmic complexity and numerical stability, shows that the algorithms a...
متن کاملGeneric degree structure of the minimal polynomial nullspace basis: a block Toeplitz matrix approach
This paper formulates the problem of determining the degrees of all polynomial entries in a minimal polynomial basis of a polynomial matrix by using only the degree structure of the given matrix. Using a block Toeplitz matrix structure corresponding to the given polynomial matrix, it is shown that the degrees of the elements in its minimal polynomial basis, in the generic case, depend only on t...
متن کاملAn application of Fibonacci numbers into infinite Toeplitz matrices
The main purpose of this paper is to define a new regular matrix by using Fibonacci numbers and to investigate its matrix domain in the classical sequence spaces $ell _{p},ell _{infty },c$ and $c_{0}$, where $1leq p
متن کاملComputing Popov Form of Ore Polynomial Matrices
We show that the computation of the Popov form of Ore polynomial matrices can be formulated as a problem of computing the left nullspace of such matrices. While this technique is already known for polynomial matrices, the extension to Ore polynomial matrices is not immediate because multiplication of the matrix entries is not commutative. A number of results for polynomial matrices are extended...
متن کاملComputing Popov Form of General Ore Polynomial Matrices
We show that the computation of the Popov form of Ore polynomial matrices can be formulated as a problem of computing the left nullspace of such matrices. While this technique is already known for polynomial matrices, the extension to Ore polynomial matrices is not immediate because multiplication of the matrix entries is not commutative. A number of results for polynomial matrices are extended...
متن کامل