Professional Documents
Culture Documents
Introduction
Introduction
Introduction
Introduction
10
11
in Q = (0; T );
on @ (0; T );
(1)
t = 0; x P ;
1
where u P LI (Q ); v P L2 (Q ); y0 P H0 (). Control
functions u ; v satisfy the following constraints :
= fu (x ; t ) j 0
= fv (x ; t ) j 0
Lu u (x ; t ) Uu ; u P LI (Q )g; (2)
Lv v (x ; t ) Uv ; v P L2 (Q )g; (3)
where L() and U() are physical lower and upper bounds,
respectively.
Dr. S. B. Nimse, R. B. Sonawane
1
2
(y
yd )
dQ +
u 2 dQ +
v 2 dQ ;
(4)
u P ;v P
Preliminaries
hyt ; i + ry rdx =
(ii)
uy dx +
v dx ;
y (0) = y0 ;
1
where h; i is the duality pairing of H 1 () and H0 ().
Dr. S. B. Nimse, R. B. Sonawane
Preliminaries
sup
t T
ky (t )kH () + ky (t )kL ()
1
0
+ kyt kL
C;
where C is a constant.
Dr. S. B. Nimse, R. B. Sonawane
Theorem
There exists optimal controls u P ; v P , which
minimize the objective functional J (u ; v ) for u P ; v
P .
(5)
x t
i =0 j =0
pij (yij
j
ydi )2 +
x t
x t
2
qij (u j )2
i =0 j =0
m
rij (vij )2 ;
i =0 j =0
(6)
(1 2 + tuij 1 )yij 1 +
(y j 1 + y j +1 ) + tv j 1 ;
i +1
i 1
i
yij = 0
y0 i ;
where =
1
if 2 .
t
(x )2
1 i
i = 0;
i = k;
0 i
k 1; 1 j
1 j m;
0 j m;
k ; j = 0;
m;
(7)
k 1 m
i =1 j =1
1
1
[(1 2 + tuij 1 )yij 1 + (yij+1 + yij1 )+
tvij 1 ]wij +
k
i =0
i wi0 :
wij =
(1 2 + tuij +1 )wij +1 +
(w j +1 + w j +1 )+
i +1
i 1
t (y j +1 y j +1 );
0
0 ;
di
1 i
i = 0;
i = k;
0 i
k 1; 0 j
0 j m;
0 j m;
k ; j = m:
m 1;
t xu j ;
dE
i
j =
dui t xuij ;
t xu j ;
i
j +1
twi + t xvij ;
dE t xvij ;
=
dvij t xvij ;
t xv j ;
i
Dr. S. B. Nimse, R. B. Sonawane
i = 0;
i = k;
0 i
1 i
i = 0;
i = k;
0 i
k 1; 0 j
0 j m;
0 j m;
k ; j = m;
k 1; 0 j
0 j m;
0 j m;
k ; j = m:
m1
m1
dE (0) (0)
dE
dE 0) (0)
; dv ; Su = du ; Sv = dv
Step 1 Let n = 0.
Step 2 Select (n) such that
(
J u (n) + (n) Sun) ; v (n) + (n) Sv(n)
J u (n) ; v (n) .
Step 3 Let
(
u (n+1) = u (n) + (n) Sun) ; v (n+1) = v (n) + (n) Sv(n) :
(0)
(0)
Step 4
dE (n+1)
du
Q
(n) =
dE (n)
du
Q
dQ +
2
dE (n+1) dQ
dv
2
dE (n) dQ
dv
dQ + Q
Step 6 Calculate the direction of descent :
dE (n+1)
dE (n+1)
(
(
(
(
Sun+1) =
+ (n) Sun) ; Sv n+1) =
+ (n) Sv n)
du
dv
Step 7 If u (n+1) ; v (n+1) are optimum, then stop the process.
Otherwise, take n = n + 1 and go to step 2.
Dr. S. B. Nimse, R. B. Sonawane
Numerical Simulation
Let
u (0) (x ; t ) = v (0) (x ; t ) = sin(x =2)e t ,
yd (x ; t ) = sin(x )e t , y0 (x ) = x 2 ,
= = 1.
Numerical Simulation
Numerical Simulation
Numerical Simulation
Numerical Simulation
References
References
References
???
Thank You.