학술논문

Computation of the General $(J,J^{\prime})$-Lossless Factorization
Document Type
Periodical
Author
Source
IEEE Transactions on Automatic Control IEEE Trans. Automat. Contr. Automatic Control, IEEE Transactions on. 56(3):710-717 Mar, 2011
Subject
Signal Processing and Analysis
Poles and zeros
Matrix decomposition
Riccati equations
Polynomials
Software algorithms
Eigenvalues and eigenfunctions
Descriptor systems
generalized eigenvalue problems
+%24%28J%2CJ^{%5Cprime}%29%24<%2Ftex><%2Fformula>-lossless+and+spectral+factorizations%22"> $(J,J^{\prime})$-lossless and spectral factorizations
Language
ISSN
0018-9286
1558-2523
2334-3303
Abstract
The $(J,J^{\prime})$ -lossless factorization problem for a generalized state-space system whose transfer matrix is completely general is investigated. The main novelty is that we remove all restrictive hypotheses and allow for arbitrary normal rank, poles and zeros on the imaginary axis, or at infinity. The numerically-sound formulas for the solution bear the same nice expressions and striking simplicity of the inner-outer factorization and may be equally well applied for the $(J,J^{\prime})$-spectral factorization.