RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 2007 Issue 9, Pages 96–105 (Mi at1051)

This article is cited in 3 papers

Deterministic Systems

Finding the strongly rank-minimizing solution to the linear matrix inequality

M. M. Chaikovskii

Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

Abstract: Consideration is given to an nonstrict linear matrix inequality and associated Riccati equation that occurs on solving problems of analysis and synthesis of linear stationary discrete time systems. The strongly rank-minimizing solution to the considered linear matrix inequality also satisfies the associated Riccati equation. In this paper, a sufficient condition for finding this strongly rank-minimizing solution is represented.

PACS: 02.30.Yy

Presented by the member of Editorial Board: A. I. Kibzun

Received: 05.10.2006


 English version:
Automation and Remote Control, 2007, 68:9, 1559–1567

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026