#### Filter Results:

#### Publication Year

2005

2010

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

— A simple necessary and sufficient algebraic condition is given to detect zeros at infinity in a polynomial matrix.

A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can have zeros along the imaginary axis. The key assumption is that the finite zeros of the input polynomial matrix are given as input data. The algorithm is based on numerically… (More)

In this paper we present an improved algorithm to compute the minimal null-space basis of polynomial matrices, a problem which has many applications in control and systems theory. This algorithm takes advantage of the block Toeplitz structure of the Sylvester matrix associated with the polynomial matrix. The analysis of algorithmic complexity and numerical… (More)

- ‹
- 1
- ›