(J,J')-lossless factorization for discrete-time systems (Q4955070)

This paper considers the \((J,J')\)-lossless factorization problem for discrete-time systems, which plays an important role in \(H_\infty\) control theory. The authors use a bilinear transformation approach. Necessary and sufficient conditions for the existence of the \((J,J')\)-lossless factorization are given in terms of two discrete-time algebraic Riccati equations whose solvability can readily be checked. Apart from a completely different and more concise derivation, the state-space realizations for the \((J, J')\)-lossless factors obtained in this paper are of a simpler form than those of \textit{W. Kongprawechnon} and \textit{H. Kimura} [Int. J. Control 65, No. 5, 867-884 (1996; Zbl 0868.93036)]. For a continuous-time transfer matrix \(G(s)\) with a realization \(G(s)= D+C(sI-A)^{-1}\), the results does not require the non-singularity of \(A\), and does not need to make the assumption that \(D\) is full rank. The problem that the bilinear transformation may proclude systems with poles at \(-1\) can readily be handled by relocating the singular point of the bilinear transformation to some other point on the unit circle.