Computation of Inner-Outer Factorizations of Rational Matrices
نویسنده
چکیده
In this paper we propose a new numerically reliable computational approach to determine the inner-outer factorization of a rational transfer matrix G of a linear descriptor system. In contrast to existing computationally involved “one-shot” methods which require the solution of Riccati or generalized Riccati equations, the new approach relies on an efficient recursive zeros dislocation technique. The resulting inner and outer factors have always minimal order descriptor representations. The proposed approach is completely general being applicable whenever G is proper/strictly proper or not, or of full column/row rank or not.
منابع مشابه
A note on computing range space bases of rational matrices
We discuss computational procedures based on descriptor state-space realizations to compute proper range space bases of rational matrices. The main computation is the orthogonal reduction of the system matrix pencil to a special Kronecker-like form, which allows to extract a full column rank factor, whose columns form a proper rational basis of the range space. The computation of several types ...
متن کاملComputation of general inner-outer and spectral factorizations
In this paper we solve two problems in linear systems theory: the computation of the inner–outer and spectral factorizations of a continuous–time system considered in the most general setting. We show that these factorization problems rely essentially on solving for the stabilizing solution a standard algebraic Riccati equation of order usually much smaller than the McMillan degree of the trans...
متن کاملRational and Polynomial Matrices
where λ = s or λ = z for a continuousor discrete-time realization, respectively. It is widely accepted that most numerical operations on rational or polynomial matrices are best done by manipulating the matrices of the corresponding descriptor system representations. Many operations on standard matrices (such as finding the rank, determinant, inverse or generalized inverses, nullspace) or the s...
متن کاملRecursive computation of coprime factorizations
We propose general computational procedures based on descriptor state-space realizations to compute coprime factorizations of rational matrices with minimum degree denominators. Enhanced recursive pole dislocation techniques are developed, which allow to successively place all poles of the factors into a given “good” domain of the complex plane. The resulting McMillan degree of the denominator ...
متن کاملComputation of J-inner{outer Factorizations of Rational Matrices
A new numerically reliable computational approach is proposed to compute the facto-rization of a rational transfer function matrix G as a product of a J-lossless factor with a stable, minimum-phase factor. In contrast to existing computationally involved \one-shot" methods which require the solution of Riccati or generalized Riccati equations, the new approach relies on an eecient recursive pol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997