CHP 7
CHP 7
• Boundedness
• Spaces
• Stability
• Robustness
1
• Input/Output Representation
2
• Input/Output Representation
• Could be Linear/Nonlinear
3
• Input/Output Representation
• Could be Linear/Nonlinear
4
• Input/Output Representation
• Could be Linear/Nonlinear
• Static/Dynamic
5
• Input/Output Representation
• Could be Linear/Nonlinear
• Static/Dynamic
6
• Input/Output Representation
• Could be Linear/Nonlinear
• Static/Dynamic
7
• If input is “bounded”, does the output exist?
8
• If input is “bounded”, does the output exist?
9
• If input is “bounded”, does the output exist?
10
• If input is “bounded”, does the output exist?
11
• If input is “bounded”, does the output exist?
12
• If input is “bounded”, does the output exist?
• Important Ones :
13
• If input is “bounded”, does the output exist?
• Important Ones :
14
• If input is “bounded”, does the output exist?
• Important Ones :
15
• Examples :
16
• Examples :
17
• Examples :
18
• Examples :
19
• Examples :
• NORM :
20
• FACT : with p-norm is a Banach Space,
21
• FACT : with p-norm is a Banach Space,
22
• FACT : with p-norm is a Banach Space,
23
• EXTENDED SPACES
• TRUNCATION FUNCTION :
24
• EXTENDED SPACES
• TRUNCATION FUNCTION :
25
• EXTENDED SPACES
• TRUNCATION FUNCTION :
26
• is a Linear Vector Space
27
• is a Linear Vector Space
28
• is a Linear Vector Space
29
• is a Linear Vector Space
• A mapping is called if :
30
• is a Linear Vector Space
• A mapping is called if :
31
• is a Linear Vector Space
• A mapping is called if :
32
• is a Linear Vector Space
• A mapping is called if :
33
• Example : LTI systems
STABLE
34
• Example : LTI systems
STABLE
35
• Example : LTI systems
STABLE
36
• Example : LTI systems
STABLE
PARSEVAL EQUALITY
37
• Example : LTI systems
STABLE
PARSEVAL EQUALITY
38
• Example : LTI systems
STABLE
PARSEVAL EQUALITY
39
40
• FACT :
• An LTI system is stable for one
42
• FACT :
• An LTI system is stable for one
43
•
•
?
•
• NOT STABLE
44
•
•
?
•
• NOT STABLE
• STABLE…
45
• FEEDBACK SYSTEMS
46
• FEEDBACK SYSTEMS
47
• FEEDBACK SYSTEMS
48
• FEEDBACK SYSTEMS
49
• FEEDBACK SYSTEMS
50
• FEEDBACK SYSTEMS
51
• BASIC QUESTIONS :
• BASIC QUESTIONS :
• BASIC QUESTIONS :
• BASIC QUESTIONS :
• BASIC QUESTIONS :
• BASIC QUESTIONS :
57
• BASIC QUESTIONS :
58
• BASIC QUESTIONS :
• RESULT : IF
59
• BASIC QUESTIONS :
• RESULT : IF
60
61
62
63
64
65
66
67
68
69
70
71
• REMARKS :
72
• REMARKS :
73
• REMARKS :
74
• REMARKS :
75
• SMALL GAIN THEOREM (INCREMENTAL FORM)
76
• SMALL GAIN THEOREM (INCREMENTAL FORM)
77
• SMALL GAIN THEOREM (INCREMENTAL FORM)
• are Lipschitz
78
• SMALL GAIN THEOREM (INCREMENTAL FORM)
• are Lipschitz
79
80
81
• FIXED POINT PROBLEM !
82
83
84
85
• AN APPLICATION : LTI SYSTEMS
86
• AN APPLICATION : LTI SYSTEMS
• AN APPLICATION : LTI SYSTEMS
88
• AN APPLICATION : LTI SYSTEMS
89
• AN APPLICATION : LTI SYSTEMS
90
• ADD A NONLINEAR PERTURBATION
91
• ADD A NONLINEAR PERTURBATION
92
• ADD A NONLINEAR PERTURBATION
93
• ADD A NONLINEAR PERTURBATION
94
• ADD A NONLINEAR PERTURBATION
95
96
97
98
99
100
101
• INPUT/OUTPUT STABILITY vs . LYAPUNOV STABILITY
• A : Stable, f : continuous
102
• INPUT/OUTPUT STABILITY vs . LYAPUNOV STABILITY
• A : Stable, f : continuous
103
• INPUT/OUTPUT STABILITY vs . LYAPUNOV STABILITY
• A : Stable, f : continuous
104
• INPUT/OUTPUT STABILITY vs . LYAPUNOV STABILITY
• A : Stable, f : continuous
105
• INPUT/OUTPUT STABILITY vs . LYAPUNOV STABILITY
• A : Stable, f : continuous
106
• If A is a stable matrix and f does not contain any linear term,
then by linearization x=0 is locally asymptotically stable.
109
• If A is a stable matrix and f does not contain any linear term,
then by linearization x=0 is locally asymptotically stable.
110
• If A is a stable matrix and f does not contain any linear term,
then by linearization x=0 is locally asymptotically stable.
111
112
113
114
115
116
117
118
119
120
121
122
123
124