
Lecture 5 of 39 · Behavioural Theory of Systems
Debasattam Pal
Behavioural Theory of Systems · 39 lectures
39 lectures
1: Introduction
2: Dynamical systems in the behavioural setting
3: Ordinary differential and difference equations
4: Equivalent kernel representations
5: Unimodular transformations, equivalent behaviours
6: Polynomial matrices: Aryabhatta-Bezout identity
7: Example- solution of system of differential equations using
8: Solving scalar ordinary differential equations
9: Solving multivariable system of differential equations
10: Equivalent behaviours: necessary condition for autonomous
11: Equivalent Behaviours: non-autonomous systems proof
12: Annihilator submodule and associated behaviour
13: Elimination Theory introduction
14: Proof of Fundamental principle of algebraic analysis
15: Proof revisited: Fundamental principle of Algebraic analysis
16: Elimination Theory proof with example
17: Elimination examples
18: Controllability definition in the behavioural framework
19: Equivalent conditions for controllability proof
20: More equivalent conditions for controllability
21: Moving from controllability to observability
22: Observability Continued
23: Behavioural Pole Placement
24: Identification Basics
25: The Most Powerful Unfalsified Model (MPUM)
26: MPUM for LTI systems: Uniqueness and construction approach
27: Construction approach of MPUM continued
28: MPUM construction recalled
29: Some simple numerical examples
30: Finding annhilators and hence kernel representation matrix
31: Identification of the behaviour using a single trajectory
32: Single finite length trajectory based identification
33: More discussions on single finite length trajectory based
34: Proof of fundamental lemma of data-driven control
35: Proof of fundamental lemma continued
36: Some consequences of fundamental lemma discussed
37: Finding low rank approximations of data Hankel matrices
38: Towards data-driven simulation
39: Data-driven simulation continued & data-driven stability