Computation ofJ-inner-outer factorizations of rational matrices
For a transfer-function matrix (TFM) \(G(\lambda)\) of a linear time-invariant system, the authors compute a factorization as a product of a square and a proper \(J\)-lossless factor \(G_i\) with a stable, minimum-phase factor \(G_0\), i.e. \(G=G_iG_0\), where \(J\) is an indefinite signature matrix. The algorithm can be also used to determine a more general factorization where the factor \(G_i\) is not constrained to be \(J\)-lossless. The proposed method avoids solving Riccati equations. The details of the main computations are explained in three Lemmas and two examples are included.
- Computation of inner-outer factorization of rational matrices
- Inner-outer factorization for strictly proper functions with j\(\omega\)- axis zeros
- Computation of general inner-outer and spectral factorizations
- Spectral and Inner-Outer Factorizations of Rational Matrices
- Computation of the (J,J')-Lossless Factorization for General Rational Matrices
- Computation of coprime factorizations of rational matrices
- An extended inner-outer factorisation algorithm based on the structure of a transfer function matrix inverse
- scientific article; zbMATH DE number 475384 (Why is no real title available?)
- Computation of inner-outer factorization of rational matrices
- scientific article; zbMATH DE number 778043 (Why is no real title available?)
- (J,J')-lossless factorization for discrete-time systems
- Computation of the (J,J')-Lossless Factorization for General Rational Matrices
This page was built for publication: Computation ofJ-inner-outer factorizations of rational matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4212598)