Record Details

State space approach to behavioral systems theory: the Dirac-Bergmann algorithm

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title State space approach to behavioral systems theory: the Dirac-Bergmann algorithm
 
Creator SULE, VR
 
Subject linear-systems
realization
behavioral systems theory
state space models
pencil representation
matrix pencils
constrained dynamics
controllability
observability
 
Description This paper develops an approach to behavioral systems theory in which a state space representation of behaviors is utilised. This representation is a first order hybrid representation of behaviors called pencil representation. An algorithm well known after Dirac and Bergmann (DB) is shown to be central in obtaining a constraint free and observable (CFO) state space representation of a behavior. Results and criteria for asymptotic stability, controllability, inclusions and Markovianity of behaviors are derived in terms of the matrices of this representation which involve linear algebraic processes in their computation. (C) 2003
 
Publisher ELSEVIER SCIENCE BV
 
Date 2011-07-26T18:59:21Z
2011-12-26T12:55:39Z
2011-12-27T05:41:52Z
2011-07-26T18:59:21Z
2011-12-26T12:55:39Z
2011-12-27T05:41:52Z
2003
 
Type Article
 
Identifier SYSTEMS & CONTROL LETTERS, 50(2), 149-162
0167-6911
http://dx.doi.org/10.1016/S0167-6911(03)00151-8
http://dspace.library.iitb.ac.in/xmlui/handle/10054/6998
http://hdl.handle.net/10054/6998
 
Language en