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

Avtomat. i Telemekh., 2011 Issue 1, Pages 27–41 (Mi at1266)

This article is cited in 18 papers

Deterministic Systems

On full controllability criteria of a descriptor system. The polynomial solution of a control problem with checkpoints

S. P. Zubova

Voronezh State University, Voronezh, Russia

Abstract: We derive full controllability criteria for a stationary dynamical system described by an algebro-differential relation with rectangular matrix coefficient. The derivation is done by multistage splitting of the spaces into subspaces in special and general cases. We construct a polynomial control and state of the descriptor system in case the system trajectory passes an arbitrary finite amount of checkpoints without projectors.

Presented by the member of Editorial Board: A. P. Kurdyukov

Received: 26.12.2008


 English version:
Automation and Remote Control, 2011, 72:1, 23–37

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026