Minimal cascade factorization of real and complex rational transfer matrices
- 1 May 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 28 (5) , 390-400
- https://doi.org/10.1109/tcs.1981.1085000
Abstract
A cascade factorization R ()= RI (,). R 2(x) .. () of an nXn nonsingular rational matrix R( X) is said to be minimal when the McMillan degrees of the factors add up to the McMillan degree of the original matrix. In this paper we give necessary and sufficient conditions for such a factorization to exist in terms of a state-space realization for R (2X). Next, we focus on numerical and algorithmic aspects. We discuss the numerical conditioning of the problem and we give algorithms to compute degree one factorizations and real degree two factorizations. Finally, we discuss the special case where R(X) is a para J-unitary matrixKeywords
This publication has 20 references indexed in Scilit:
- Factorization of Operator-valued Transfer FunctionsPublished by Springer Nature ,1999
- The generalized eigenstructure problem in linear system theoryIEEE Transactions on Automatic Control, 1981
- Factorizations of Transfer FunctionsSIAM Journal on Control and Optimization, 1980
- On the determination of the Smith-Macmillan form of a rational matrix from its Laurent expansionIEEE Transactions on Circuits and Systems, 1979
- UNITARY OPERATOR COLLIGATIONS AND THEIR CHARACTERISTIC FUNCTIONSRussian Mathematical Surveys, 1978
- Matrix Eigensystem Routines — EISPACK GuideLecture Notes in Computer Science, 1976
- On the factorization of a nonsingular rational matrixIEEE Transactions on Circuits and Systems, 1975
- Equivalence Relations for the Algebraic Riccati EquationSIAM Journal on Control, 1973
- Least squares stationary optimal control and the algebraic Riccati equationIEEE Transactions on Automatic Control, 1971
- Introduction to Formal Realizability Theory-IIBell System Technical Journal, 1952