A Toeplitz algorithm for polynomial J-spectral factorization

Authors:
Juan Carlos ZúñIga;Didier Henrion
Affiliations:
LAAS-CNRS, 7 Avenue du Colonel Roche, 31077 Toulouse, France;LAAS-CNRS, 7 Avenue du Colonel Roche, 31077 Toulouse, France and Department of Control Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Technická 2, 16627 ...
Venue:
Automatica (Journal of IFAC)
Year:
2006

Citing 7
Cited 1

The Riccati equation

The Riccati equation
Factorization of Matrix Polynomials with Symmetries

SIAM Journal on Matrix Analysis and Applications
J-spectral factorization and equalizing vectors

Systems & Control Letters
The Quadratic Eigenvalue Problem

SIAM Review
Computer algorithm for spectral factorization of rational matrices

IBM Journal of Research and Development
Brief Polynomial J-spectral factorization in minimal state space

Automatica (Journal of IFAC)
Brief Necessary and sufficient conditions for existence of J-spectral factorization for para-Hermitian rational matrix functions

Automatica (Journal of IFAC)

Fiedler Companion Linearizations and the Recovery of Minimal Indices

SIAM Journal on Matrix Analysis and Applications

Quantified Score

Hi-index	22.14

Visualization

Abstract

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 reliable operations only, namely computation of the null-spaces of related block Toeplitz matrices, polynomial matrix factor extraction and linear polynomial matrix equations solving.