scientific article; zbMATH DE number 1300122
From MaRDI portal
Publication:4248670
The authors present two considerations in \((J,J')\)-lossless factorization: (1) They give a sufficient and necessary condition so that the matrix equation \(X^T J_{p,q}X=S\) has a solution \(X\) and an algorithm for solving the above equation. (2) The existence of the matrix \(D_{\pi}\) in the chain scattering description (CSD) method implies the satisfaction of a condition in the classical DGKF method which was given by \textit{J. C. Doyle, K. Glover, P. P. Khargonekar} and \textit{B. A. Francis}, IEEE Trans. Autom. Control 34, No. 8, 831-847 (1989; Zbl 0698.93031).
Recommendations
- On extended (J,J')-lossless factorization
- Computation of the General $(J,J^{\prime})$-Lossless Factorization
- Discrete (J,J')-lossless factorization
- \((J,J')\)-lossless factorization based on conjugation
- Computation of the (J,J')-Lossless Factorization for General Rational Matrices
- Singular (J, J')-lossless factorization for strictly proper functions
- (J,J')-lossless factorization for descriptor systems
- On J-Lossless coprime factorizations andH∞ control
- scientific article; zbMATH DE number 475384
- (J,J')-lossless factorization for discrete-time systems
Cited in
(8)- Analytic system problems and J-lossless coprime factorization for infinite-dimensional linear systems
- On extended (J,J')-lossless factorization
- On J-Lossless coprime factorizations andH∞ control
- Chain-scattering solution to the -DF problem: a Popov function approach
- Strongly \((J,J')\)-lossless rational matrices and \(\mathcal{H}_\infty\) problem
- Computation of the (J,J')-Lossless Factorization for General Rational Matrices
- Computation of the General $(J,J^{\prime})$-Lossless Factorization
- Parametrized family of 2-D non-factorable FIR lossless systems and Gröbner bases
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4248670)
