Internal Controllability of First Order Quasi-linear Hyperbolic Systems with a Reduced Number of Controls
read more
Citations
Indirect controllability of some linear parabolic systems of m equations with m − 1 controls involving coupling terms of zero or first order
Null controllability of a parabolic system with a cubic coupling term
Internal Observability for Coupled Systems of Linear Partial Differential Equations
Control of Three Heat Equations Coupled with Two Cubic Nonlinearities
A Kalman rank condition for the indirect controllability of coupled systems of linear operator groups
References
Control and Nonlinearity
Global asymptotic stabilization for controllable systems without drift
Related Papers (5)
Indirect controllability of some linear parabolic systems of m equations with m − 1 controls involving coupling terms of zero or first order
Frequently Asked Questions (13)
Q2. What is the simplest way to define a linear system?
Note that the kind of boundary conditions the authors consider is nonlocal but, as already noticed in [CBdN08] (see also [LRW10]), it can always be reduced to more standard (i.e. local) boundary conditions by introducing the enlarged system satisfied by (y, ỹ) where ỹ(t, x) = y(t, L− x).
Q3. what is the t a b l?
Rm is the distributed control at time t ∈ [0, T ], that the authors look subject to the constraintsuppΘ ⊂ [0, T ]× [a, b], (2.2)where here, and in what follows, the interval [a, b], with 0 ≤ a < b ≤ L, is fixed.
Q4. What is the controllability of (2.7) with constraints?
The authors want to characterize the controllability of (2.7) with the following additional constraint on the controls:ψ ≡ 0 in [0, T ]\\(M ⋃i=1[ai, bi]), (2.8)where 0 ≤ ai < bi ≤ T are such that bi ≤ ai+1 for every i ∈ J1,M − 1K.
Q5. what is the proof of Proposition 2.5?
the controllability of (2.7)-(2.8) is equivalent to the algebraic conditionrank [A : B ] = n,where the n× nm matrix [A : B ] is defined by[A : B ] def = [B|AB|A2B| · · · |An−1B]. (2.10)Proposition 2.5.
Q6. What is the definition of a semilinear system?
Assume that the linearization of system (2.19) around the trajectory (ỹ, Θ̃), that is the linear system yt + yx = ∂f∂y( ỹ(t, x), Θ̃(t, x) ) y + ∂f∂Θ( ỹ(t, x), Θ̃(t, x) ) Θ, (t, x) ∈ [0, T ]× [0, L],y(t, L) = y(t, 0), t ∈ [0, T ],y(0, x) = y0(x), x ∈ [0, L],is exactly controllable at time T > 0.
Q7. What is the simplest solution to (2.19)?
The authors say that System (2.19) is locally exactly controllable around the trajectory (ỹ, Θ̃) at time T > 0 if, for every ε > 0, there exists µ > 0 such that, for every y0, y1 ∈ C1L([0, T ]× [0, L]) n with‖y0 − ỹ(0, ·)‖C1 ≤ µ, ‖y 1 − ỹ(T, ·)‖C1 ≤ µ,there exists a control Θ ∈ C1L([0, T ] × [0, L]) m that satisfies (2.2) and a classical solution y ∈ C1L([0, T ]× [0, L]) n to (2.19) such thaty(T, x) = y1(x), ∀x ∈ [0, L], (2.20a)‖y − ỹ‖C1 ≤ ε, (2.20b)‖Θ− Θ̃‖C1 ≤ ε. (2.20c)Then, the authors have the following result.
Q8. What is the simplest definition of the extended characteristics?
For 0 ≤ a < b ≤ L, the authors list below some properties of these functions, under the essential assumption that every extended characteristic X crosses the domain [0, T ]× [a, b] at some time, that isT > L− (b− a).1. kmin(x, b) ≤ kmax(x, a).
Q9. how do the authors solve the equation g1?
The equation L(ỹ,Θ̃)(y,Θ) = (g1, g2) rewrites asut + λ1(ỹ)ux + a11u+ a12v −Θ = g1, in Q,vt + λ2(ỹ)vx + a21u+ a22v = g2, in Q.By definition of A, the authors havea21(t, x) 6= 0, ∀(t, x) ∈ Q. (3.20)In this case, the algebraic solvability is not very difficult: the authors first putv = 0, (3.21)so that the second equation simply becomes a21u = g2.
Q10. What is the simplest way to solve a system?
Writing y along the extended characteristic X(·, x), the authors see that t ∈ [0, T ] 7→ y(t,X(t, x)) solves (2.4) with z0 = y0(x) (at least in the weak sense W 1,∞(0, T )n).
Q11. What is the simplest way to control the map?
Let T, L > 0 and 0 ≤ a < b ≤ L. System (2.1) is exactly controllable at time T if, and only if, the following 2 conditions hold: (H1) T > L− (b− a). (H2) For every x ∈ [0, L), the following ODE is controllable:d dt z(t) = −Ax(t)z(t) + Bx(t)ψ(t), ∀t ∈ [0, T ], z(0) = z0 ∈ Rn, (2.4)with controls ψ such thatψ ≡ 0 in [0, T ]\\kmax(x,a) ⋃k=kmin(x,b)[τk(x, a), τk(x, b)] .
Q12. what is the proof of the theorem 3.1?
2. Algebraic solvability: for every z ∈ Ad+s def = A ∩Cd+s(Q)p, the authors haveLz ◦ Mz = IdCr+s(Q)q ,The proof of Theorem 3.1 is based on the following result [Gro86, Section 2.3.2, Main Theorem]:Theorem 3.5. Let A ⊂ Cd(Q)p be a nonempty open differential relation of order d. Assume that D admits an infinitesimal inversion of order s over A. Letσ0 > max(d, 2r + s) (3.13)ν ∈ (0,+∞) (3.14)Then, there exist a family of sets Bz ⊂ C σ0+s(Q)q and a family of operators D−1z :
Q13. What is the controllability of linear ODE with constraints?
Let us consider the n× n ODE d dt z(t) = −A(t)z(t) +B(t)ψ(t), ∀t ∈ [0, T ], z(0) = z0 ∈ Rn, (2.7)with A ∈ C1([0, T ])n×n, B ∈ C1([0, T ])n×m.