Loading [MathJax]/jax/output/SVG/jax.js

Well-posedness and approximate controllability of neutral network systems

  • Received: 01 February 2021 Revised: 01 May 2021 Published: 01 July 2021
  • Primary: 35F46, 93B05; Secondary: 93C20

  • In this paper, we study the concept of approximate controllability of retarded network systems of neutral type. On one hand, we reformulate such systems as free-delay boundary control systems on product spaces. On the other hand, we use the rich theory of infinite-dimensional linear systems to derive necessary and sufficient conditions for the approximate controllability. Moreover, we propose a rank condition for which we can easily verify the conditions of controllability. Our approach is mainly based on the feedback theory of regular linear systems in the Salamon-Weiss sense.

    Citation: Yassine El Gantouh, Said Hadd. Well-posedness and approximate controllability of neutral network systems[J]. Networks and Heterogeneous Media, 2021, 16(4): 569-589. doi: 10.3934/nhm.2021018

    Related Papers:

    [1] Yassine El Gantouh, Said Hadd . Well-posedness and approximate controllability of neutral network systems. Networks and Heterogeneous Media, 2021, 16(4): 569-589. doi: 10.3934/nhm.2021018
    [2] Zhong-Jie Han, Gen-Qi Xu . Spectrum and dynamical behavior of a kind of planar network of non-uniform strings with non-collocated feedbacks. Networks and Heterogeneous Media, 2010, 5(2): 315-334. doi: 10.3934/nhm.2010.5.315
    [3] Klaus-Jochen Engel, Marjeta Kramar FijavŽ . Exact and positive controllability of boundary control systems. Networks and Heterogeneous Media, 2017, 12(2): 319-337. doi: 10.3934/nhm.2017014
    [4] Didier Georges . Infinite-dimensional nonlinear predictive control design for open-channel hydraulic systems. Networks and Heterogeneous Media, 2009, 4(2): 267-285. doi: 10.3934/nhm.2009.4.267
    [5] Ciro D'Apice, Olha P. Kupenko, Rosanna Manzo . On boundary optimal control problem for an arterial system: First-order optimality conditions. Networks and Heterogeneous Media, 2018, 13(4): 585-607. doi: 10.3934/nhm.2018027
    [6] Gildas Besançon, Didier Georges, Zohra Benayache . Towards nonlinear delay-based control for convection-like distributed systems: The example of water flow control in open channel systems. Networks and Heterogeneous Media, 2009, 4(2): 211-221. doi: 10.3934/nhm.2009.4.211
    [7] Zhong-Jie Han, Gen-Qi Xu . Dynamical behavior of networks of non-uniform Timoshenko beams system with boundary time-delay inputs. Networks and Heterogeneous Media, 2011, 6(2): 297-327. doi: 10.3934/nhm.2011.6.297
    [8] Christophe Prieur . Control of systems of conservation laws with boundary errors. Networks and Heterogeneous Media, 2009, 4(2): 393-407. doi: 10.3934/nhm.2009.4.393
    [9] Achilles Beros, Monique Chyba, Oleksandr Markovichenko . Controlled cellular automata. Networks and Heterogeneous Media, 2019, 14(1): 1-22. doi: 10.3934/nhm.2019001
    [10] Martin Gugat, Alexander Keimer, Günter Leugering, Zhiqiang Wang . Analysis of a system of nonlocal conservation laws for multi-commodity flow on networks. Networks and Heterogeneous Media, 2015, 10(4): 749-785. doi: 10.3934/nhm.2015.10.749
  • In this paper, we study the concept of approximate controllability of retarded network systems of neutral type. On one hand, we reformulate such systems as free-delay boundary control systems on product spaces. On the other hand, we use the rich theory of infinite-dimensional linear systems to derive necessary and sufficient conditions for the approximate controllability. Moreover, we propose a rank condition for which we can easily verify the conditions of controllability. Our approach is mainly based on the feedback theory of regular linear systems in the Salamon-Weiss sense.



    The main object of this paper is to characterise the approximate controllability of the following retarded network system of neutral type and input delays

    {tϱj(t,x)=cj(x)xϱj(t,x)+qj(x)ϱj(t,x)+mk=1Ljkzk(t+,),x(0,1),t0,ϱj(0,x)=gj(x),x(0,1),iijcj(1)ϱj(t,1)=wijmk=1i+ikck(0)ϱj(t,0)+n0l=1kilvl(t),t0,zj(θ,x)=φj(θ,x),uj(θ)=ψj(θ),θ[r,0],x(0,1),ϱj(t,x)=[zj(t,x)mk=1Djkzk(t+,)ni=1kijuj(t+)bijuj(t)] (1)

    for i=1,,n and j=1,,m. Here, zj(t,x) represents the distribution of the material along an edge ej of a graph G at the point x and time t, where G is a finite connected graph composed by nN vertices α1,,αn, and by mN edges e1,,em which are assumed to be normalized on the interval [0,1]. Moreover, we assume that the nodes α1,,αn exhibit standard Kirchhoff type conditions to be specified later on. Moreover, zj(t+,x):[r,0]C is the history function of zj, and uj(t+):[r,0]C is the history function of the control function uj. We notice that system (1) arises as a model for linear flows in networks with fading memory.

    The study of system (1) is motivated by the several open problems on transport network systems, which is a very active topic for many years [2,4,5,11,14,15,12]. Such research activity is motivated by a broad area of their possible applications, see, e.g. [6], and the interesting mathematical questions that arise from their analysis. For instance, several properties of the transport processes depend on the structure of the network and on the rational relations of the flow velocities, see, e.g. [1,23] and references therein.

    On the other hand, neutral delay systems arise naturally in many practical mathematical models. Typical examples include communication networks, structured population models, chemical processes, tele-operation systems [22,35]. The qualitative properties (existence, stability, controllability, etc.) for this class of systems have received much attention (see [3], [7], [21], [22], [25], [35] and references therein). For instance, different controllability results for various neutral delay systems have been established recently (see, [24], [10], [29], [27]). In [24], the authors analyze the exact null controllability of neutral systems with distributed state delay by using the moment problem approach. In [10], relative controllability of linear discrete systems with a single constant delay was studied using the so-called discrete delayed matrix exponential. In [29], the authors studied the approximate controllability of linear (continuous-time) systems with state delays via the matrix Lambert W function. The robustness of approximate controllability of linear retarded systems under structured perturbations has been addressed in [27] using the so-called structured distance to non-surjectivity. However, the results established in the aforementioned works become invalid for the transport network system (1), since the operators D=(Djk),L=(Ljk),K1=(kjk) and Am are supposed to be unbounded. In fact, as we shall see in Section 5, if we take X=Lp([0,1])m as the state space then D,LL(W1,p([r,0],X);X) and K1L(W1,p([r,0],Cn);X).

    In this paper, we study the concept of approximate controllability of boundary value problems of neutral type with a particular aim to explore new techniques and new questions for control problems of transport network systems. We formulate the problem in the framework of well-posed and regular linear systems and solve it in the operator form. To be precise, we use product spaces and operator matrices to reformulate (11) into a inhomogeneous perturbed Cauchy problem governed by an operator having a perturbed domain. This allows us to use the feedback theory of well-posed and regular linear systems to prove that this operator is a generator. Our approach allows us to easily calculate the spectrum and the resolvent operator of this generator. In this manner, necessary and sufficient conditions of approximate controllability for (11) are formulated and proved by using the feedback theory of regular linear systems and methods of functional analysis. Our main result is that, when the control space is of finite dimension, we prove that the established approximate controllability criteria are reduced to a compact rank condition given in terms of transfer functions of controlled delay systems. As we shall see in Section 4 our approach by transforming the neutral delay system controllability problem into approximate controllability of an abstract perturbed boundary control problem greatly facilitates analysis and offers an alternative approach for the study of controllability in terms of extensive existing knowledge of feedback theory of closed-loop systems. This establishes a framework for investigating the approximate controllability of infinite dimensional neutral delay systems with state and input delays, which may shed some light in solving the approximate controllability of concrete physical problems.

    The whole article is organized as follows: we initially present a survey on well-posed and regular linear systems in the Salamon-Weiss sense; Section 2. The results obtained on the well-posedness and spectral theory of boundary value problems of neutral type are discussed in Section 3. Section 4 is devoted to state and prove the main results on approximate controllability of abstract boundary control systems of neutral type. Finally, in Section 5, we show the solvability of transport network systems of neutral type by means of our introduced framework.

    In this section we recall some well-known results and definitions on infinite dimensional linear time-invariant systems. The reader is referred to the papers [25], [31], [32], [34], [33], which was our main reference, if more details or further references are required. For the Hilbert space or Banach space setting, the reader may also refer to [28,30].

    Let X,U,Z be Banach spaces such that ZX with continuous dense embedding, Am:ZX be a closed linear (often differential) operator on X (here D(Am)=Z), and boundary linear operators G,M:ZXU.

    Consider the following boundary input-output system

    {˙z(t)=Amz(t),t0,z(0)=z0Gz(t)=u(t),t0,y(t)=Mz(t),t0. (2)

    Notice that the well-posed of the boundary input-output system (2) consists in finding conditions on operators Am,G and M such as

    z(τ)pX+y()pLp([0,τ];U)c(τ)(z0pX+u()pLp([0,τ];U)). (3)

    for some (hence for every) τ>0, a constant c(τ)>0 and p1. To make these statements more clear, some hypothesis are needed.

    (A1) the restricted operator AAm with domain D(A)=kerG generates a C0-semigroup T:=(T(t))t0 on X;

    (A2) the boundary operator G is surjective;

    According to assumptions (A1) and (A2), for μρ(A), the following inverse, called the Dirichlet operator,

    Dμ=(G|ker(μAm))1L(U,D(Am)).

    exists. Let X1 be the completion of X with respect to the norm z1:=R(μ,A)z for all zX and some (hence all) μρ(A). This new space is also called the extrapolation space of X with respect to A, which satisfies D(A)XX1 with continuous and dense embedding. We extend the semigroup T to a strongly continuous semigroup T1:=(T1(t))t0 on X1 (the extrapolation semigroup), whose generator A1:XX1 is the extension of A to X, see e.g. [16]. Let us now define the boundary control operator

    B=(μA1)DμL(U,X1),

    then BL(U,X1), Range(B)X={0} and

    (AA1)|Z=BG, (4)

    since μDμu=AmDμu,uU. We mention that the operator B is independent of μ due to the resolvent equation. By virtue of formula (4) the boundary input-output system (2) can be reformulated as the following distributed-parameter system

    {˙z(t)=A1z(t)+Bu(t),t0,z(0)=z0,y(t)=Cz(t),t0, (5)

    where

    C=M|D(A).

    Then the state of the system (5) satisfy the variation of constants formula

    z(t;z0,u)=T(t)z0+t0T1(ts)Bu(s)ds,t0, (6)

    for all z0X and uLp([0,+);U). Notice that the integral in (6) is taken in the large space X1. Thus, we need a class of control operators B for which the state of the system (5) takes values in the state space X. This motivated the following definition.

    Definition 2.1. An operator BL(U,X1) is called an admissible control operator for A, if for some τ>0,

    Φτu:=τ0T1(τs)Bu(s)ds,

    takes values in X for any uLp([0,+);U).

    Note that the admissibility of B implies that the state of the system (5) is a continuous X-valued function of t and satisfy

    z(t)=T(t)z0+Φtu, (7)

    for all z0X and uLploc([0,);U). Now for α>w0(T), let uLpα([0,);U), the space of all the functions of the form u(t)=eαtv(t), where vLp([0,);U). Then u and z from (7) have Laplace transforms related by

    ˆz(μ)=R(μ,A)z0+^Φu(μ), with ^Φu(μ)=Dμˆu(μ),eμ>α, (8)

    where αR and ˆu denote the Laplace transform of u.

    For each τ>0, we define the space

    uW1,p0,τ(U):={uW1,p([0,τ];U):u(0)=0},

    which is dense in the Lebesgue space L2([0,τ];U). When B is admissible, one can use an integration by parts technique to prove that ΦτuZ for any τ0 and uW1,p0,τ(U). It makes sense to define the linear operator

    (Fu)(t)=MΦtu,t0,uW1,p0,t(U). (9)

    With these notations, it follows that

    y=Ψz0+Fu,on[0,τ]

    for and (z0,u)D(A)×W1,p0,τ(U) and τ>0, where

    Ψz0=CT()z0,z0D(A).

    So, according to the inequality (3), we are looking for an output function y() in the space Lploc([0,);U) for any (z0,u)X×Lploc([0,);U). As a matter of fact, this may not hold for any unbounded operator C. In order to overcome this obstacle, we first introduce the following class of operators C.

    Definition 2.2. An operator CL(D(A),U) is called an admissible observation operator for A if for some (hence all) τ>0, there exists a constant γ:=γ(τ)>0 such that

    τ0CT(s)zpdsγpzp, (10)

    for all zD(A).

    If C is an admissible observation operator for A, then for any τ>0, the map Ψ is bounded from D(A) to Lp([0,τ];U). Moreover, by density, the operator Ψ extends to ΨL(X,Lp([0,τ];U)).

    As in Weiss [31], we consider the Λ-extension of C for A defined by

    CΛz:=limμCμR(μ,A)z,

    whose domain D(CΛ) consists of all z0X for which the limit exists. According to [31], the admissibility of C for A implies that the orbits of the semigroup T() satisfies T(t)zD(CΛ) for a.e t>0 and all zX. Moreover, we have

    Ψz:=CΛT()z,zX,a.e.

    Definition 2.3. Let BL(U,X1) and CL(D(A),U) be admissible control and observation operator for A, respectively. We call the triplet (A,B,C) (or equivalently the system (5)) a well-posed state-space operators on U,X,U, if for every τ>0 there exits κ:=κ(τ) such as

    FuLp([0,τ];U)κuLp([0,τ];U),uW1,p0,τ(U).

    If the triple (A,B,C) is well-posed, by density, the operator F is extended to FL(Lp([0,τ];U)). We introduce

    Fτu=(Fu)|[0,τ],τ0.

    This operators are called the input-output maps of the system (A,B,C).

    The output function y of the well-posed system (A,B,C) is then extended to yLploc([0,+);U) and satisfies y=Ψz0+Fu for any z0X and uLploc([0,+);U). In particular, the feedback law u=y has a sense if only if (IF)u=Ψz0 has a unique solution uLp([0,τ],U) for some τ>0. This is true if IF is invertible in Lp([0,τ],U). In this case, the identity I:UU is called an admissible feedback for (A,B,C).

    A more appropriate subclass of well-posed state-space operators is defined by:

    Definition 2.4. Let (A,B,C) a well-posed state-space operators on U,X,U. Then, the triplet (A,B,C) is called regular state-space operators (with feedthrough zero) if for any vU, we have

    limτ01ττ0(F(1R+v))(σ)dσ=0.

    We recall that, if (A,B,C) is called regular state-space operators and has the identity operator I:UU as an admissible feedback, the operator

    AI=A1+BCΛ,D(AI)={zD(CΛ):(A1+BCΛ)zX}

    generates a strongly continuous semigroup TI:=(TI(t))t0 on X such that TI(t)zD(CΛ) for all zX and a.e t>0. Moreover, we have

    TI(t)z=T(t)z+t0T1(ts)BCΛTI(s)zds

    for all zX and t0, see e.g. [28,Chap.7] and [34].

    In this section, we investigate the well-posedness of the abstract boundary control systems of neutral type described as

    {ddt(z(t)DztK0u(t)K1ut)=Am(z(t)DztK0u(t)K1ut)+Lzt+B0u(t)+B1ut,t0,limt0(z(t)DztK0u(t)K1ut)=ϱ0,G(z(t)DztK0u(t)K1ut)=M(z(t)DztK0u(t)K1ut)+Kv(t),t0,z0=φ,u0=ψ, (11)

    where the state variable z() takes values in a Banach space X and the control functions u(),v() are given in the Banach space Lploc([0,);U), where U is also a Banach space. K0,B0 are bounded linear operator from U to X, whereas K is a boundary control operator from U to the Banach space X. Am:D(Am)XX is a closed, linear differential operator and G,M:D(Am)X are unbounded trace operators. The delay operators D,L:W1,p([r,0];X)X and K1,B1:W1,p([r,0];U)X are defined by

    Dφ=0rdη(θ)φ(θ),Lφ=0rdγ(θ)φ(θ),B1ψ=0rdν(θ)ψ(θ),K1ψ=0rdϑ(θ)ψ(θ),

    for φW1,p([r,0],X) and ψW1,p([r,0],U), where η,γ:[r,0]L(X) and ν,ϑ:[r,0]L(U,X) are functions of bounded variations with total variations |η|([ε,0]), |γ|([ε,0]), |ν|([ε,0]), and |ϑ|([ε,0]) approach 0 as ε0. Also xt:[r,0]X and ut:[r,0]U are the histories functions of z() and u(), respectively, and defined by xt(θ)=x(t+θ) and ut(θ)=u(t+θ) for t0 and θ[r,0], where r>0 is a real number. The functions z0=φ,u0=ψ are the initial history functions of z() and u(), respectively. Some new notation is needed. Let E be a Banach sapce and r>0 be a real number. Define the operator

    QEmξ=θξ,D(QEm)=W1,p([r,0];E),

    and

    QEξ=θξ,D(QE)={ξW1,p([r,0];E):ξ(0)=0}.

    It is well known that (QE,D(QE)) generate the left shift semigroup

    (SE(t)ξ)(θ)={0,t+θ0,ξ(t+θ),t+θ0,

    for t0 and θ[r,0] and ξLp([r,0];E); see [16]. For μC, we define the operator eμ as

    eEμ:ELp([r,0];E),(eEμz)(θ)=eμθz,zE,θ[r,0].

    Denote by QE1 the extension of QE in the extrapolation sense and define the operator

    βE:=QE1e0.

    Then the function zt() is the solution of the following boundary equation

    {˙v(t,θ)=QEmv(t,θ),t>0,θ[r,0],v(t,0)=z(t),v(0,.)=ξ,t0. (12)

    Moreover, for any ξLp([r,0];E) and zLp([r,);E) with z0=ξ, zt is given by

    zt=SE(t)ξ+ΦEtz,t0,

    where Φt:Lp([0,);E)Lp([r,0];E) are the linear operators defined by

    (ΦE(t)z)(θ)={z(t+θ),t+θ0,0,t+θ0,

    for t0, zLp([0,);E) and θ[r,0]; see [19].

    Next we study the well-posedness of the neutral delay system (11) in the case of B00,K00 and K0. First, we introduce the Banach spaces

    X:=X×Lp([r,0];X)×Lp([r,0];U),Z:=D(Am)×W1,p([r,0];X)×W1,p([r,0];U),U:=X×X×U,

    equipped with their usual norms. Second, we set

    ϱ(t)=z(t)DztK1ut.

    By using (12) together with the function

    tζ(t)=(ϱ(t)ztut),

    one can see that the neutral delay system (11) can be rewrite as the following perturbed Cauchy problem

    {˙ζ(t)=[AG,M+P]ζ(t),t0,ζ(0)=(ϱ0,φ,ψ), (13)

    where AG,M and P are linear operators on X defined by

    AG,M:=(AmLB10QXm000QUm),  D(AG,M):={(ϱ0φψ)Z:Gϱ0=Mϱ0φ(0)=ϱ0+Dφ+K1ψ}
    P:=(0LB1000000),  D(P):=Z.

    Next we are concerned with the well-posedness of the perturbed Cauchy problem (13). To this end, we first prove that the operator AG,M is a generator on X. Second, we show that P is a Miyadera-Voigt perturbation for AG,M. Let assume that the boundary operator G satisfies the assumptions (A1) and (A2) (see Section 2). On the other hand, we define

    C:=M|D(A).

    We also assume that

    (A3) the triple operator (A,B,C) is a regular state-space operators on X,X,X with the identity operator IX as an admissible feedback.

    We have the following result.

    Proposition 1. Under the assumptions (A1)-(A3), the operator (AG,M,D(AG,M)) generates a strongly continuous semigroup (TG,M(t))t0 on X.

    Proof. To prove our claim we shall use [20,Theorem 4.1]. To this end, we define the operators G,M:ZU by

    G=(G000δ0000δ0),M=(M00IDK1000).

    Then, we can rewrite the domain of AG,M as

    D(AG,M)={(ϱ0φψ)Z:G(ϱ0φψ)=M(ϱ0φψ)}.

    Clearly, by virtue of the assumptions (A1) and (A2), the operator G is surjective and the operator A:=Am with D(A):=kerG generates a diagonal C0-semigroup (T(t))t0 on X. On the other hand, for μρ(A),

    Dμ=(Dμ000eXμ000eUμ),B=(B000βX000βU). (14)

    We know from [19,Sect. 3] that βX,βU are admissible control operators for QX,QU, respectively, and by assumption (A3) B is admissible for A. Thus the operator B is an admissible control operator for A. Define the operator

    C:=M|D(A).

    We know from [19,Theorem 3] that D,K1 are admissible observation operators for QX,QU, respectively, and by assumption (A3) C is admissible for A. It follows that the operator C is an admissible observation operator for A. We now prove that the triple (A,B,C) is regular with identity operator IU as an admissible feedback. According to [28,Theorem 4.2.1], the control maps associated to B are given by

    Φt(vuw)=(t0T1(ts)Bv(s)dst0SX1(ts)βXu(s)dst0SU1(ts)βUw(s)ds),t0,(vuw)Lp([0,+);U).

    Let denote by DΛ,K1,Λ,CΛ the Yosida extensions of D,K1,C with respect to QX,QU and A, respectively. Then, the Yosida extension of C with respect A is given by

    CΛ=(CΛ00IDΛK1,Λ000),D(CΛ)=D(CΛ)×D(DΛ)×D(K1,Λ).

    Moreover, according to [19,Theorem 3], the triples (QX,βX,D) and (QU,βU,K1) are regular state-space operators. Now the assumption (A3) implies that Rang ΦtD(CΛ) for a.e. t0, cf. [28,Theorem 5.6.5]. We then select

    (Fτ(vuw))(t):=CΛΦt(vuw),t[0,τ],(vuw)Lp([0,+);U).

    Using [19] and the expressions of CΛ and Φt, it is not difficult to see that the triple (A,B,C) is well-posed state-space operators. Moreover, as R(μ,A1)B=Dμ for μρ(A), we have

    Range(R(μ,A1)B)D(CΛ)×D(DΛ)×D(K1,Λ)=D(CΛ),

    for μρ(A), due to (A3) and the fact that the triples (QX,βX,D) and (QU,βU,K1) are regular state-space operators as shown in [19,Theorem 3]. Hence (A,B,C) is regular state-space operators on U,X,U. We now prove that the identity operator IU is an admissible feedback for this triple. Clearly, we can write

    Fτ=(FA,Cτ00ΦAtFQX,DτFQU,K1τ000)

    with

    (FQX,Dτu)(t)=DΛΦXtu,(FA,Cτv)(t)=CΛΦAtv,(FQU,K1τw)(t)=K1,ΛΦUtw,

    for t[0,τ] and (vuw)Lp([0,+);U). Thus, IUFτ0 is invertible in Lp([0,τ0];U), due to assumption (A3) and the fact that the triple (QX,βX,D) is regular state-space operators with IX as admissible feedback (see[19]). Hence, by [20,Theorem 4.1] the operator AG,M generates a strongly continuous semigroup on X. This ends the proof.

    The following result shows the well-posedness of the perturbed Cauchy problem (13).

    Theorem 3.1. The operator A:=AG,M+P generates a strongly continuous semigroup (U(t))t0 on X satisfying U(t)ζD(CΛ)D(PΛ) for all ζX and almost every t0 and

    U(t)=TG,M(t)(t)+t0TG,M(t)(ts)PU(s)ds,onD(AG,M),TG,M(t)=T(t)+t0T1(ts)BCΛTG,M(s)ds,onX.

    Proof. We select

    P:=P|D(A).

    By Proposition 1 and [16,Theorem 3.14], it suffices to check that P is a Miyadera-Voigt perturbation for AG,M. To this end, we only need to show that P is an admissible observation operator for AG,M for a certain 1<p<. In fact, by Proposition 1 and [20,Theorem 4.1] the semigroup generated by AG,M on X is given by

    TG,M(t)=T(t)+t0T1(ts)BCΛTG,M(s)ds,on X, (15)

    for any t0. Moreover, for any τ>0 there exists γ:=γ(τ)>0 such that

    τ0CΛTG,M(s)ζpdsγpζp (16)

    for any ζX. Since D,K1 are admissible observation operators for QX,QU, respectively (see [19,Theorem 3]), it follows that P is admissible observation operator for A. Moreover, The Yosida extension of P with respect to A is given by

    PΛ=(0LΛB1,Λ000000),PΛ=X×D(LΛ)×D(B1,Λ),

    where LΛ,B1,Λ denote the Yosida extension of L,B1 with respect to QX,QU, respectively. According to [20,Lemma 3.6], we have

    (LΛ)|W1,p([r,0];X)=L and (B1,Λ)|W1,p([r,0];U)=B1

    Thus

    PΛ=P,on   X×W1,p([r,0];X)×W1,p([r,0];U). (17)

    On the other hand, the same arguments as in the proof of Proposition 1 show that the triple (A,B,P) is regular state-space operators. In particular (see e.g. [28,Theorem 2.7]), we have

    τ0PΛt0T1(ts)Bξ(s)dspdtδpξpLp[0,τ];U),

    for all τ>0 and all input ξLp[0,τ];U). In particular, by taking ξ(s):=CΛTG,M(s)ζ and using (16), we have

    τ0PΛt0T1(ts)BCΛTG,M(s)ζdspdt(γδ)pζp, (18)

    for any ζD(AG,M). Now using (15), (17), (18) and the fact that P is admissible for A, we obtain that P is admissible for AG,M. So by [18,Theorem 2.1], the operator (AG,M+P,D(AG,M)) generates a strongly continuous semigroup on X. Finally, the rest of the proof follows from [20,Theorem 4.1].

    In the rest of this section, we will discuss spectral properties of the generator A and compute its resolvent operator.

    Remark 1. According to [20,Theorem 4.1], the operator

    QDφ=QXm,D(QD)={φW1,p([r,0];X):φ(0)=0rdη(θ)φ(θ)}.

    generates a strongly continuous semigroup on Lp([r,0];X). Moreover, for μρ(QD) (or equivalently 1ρ(DeXμ)), we have

    R(μ,QD)=(I+eXμ(IDeXμ)1D)R(μ,QX).

    Lemma 3.2. Let assumptions of Proposition 1 be satisfied. Then, for μρ(A), we have

    μρ(AG,M)1ρ(MDμ)ρ(Deμ).

    In this case,

    R(μ,AG,M)=(I+Dμ(IMDμ)1M)R(μ,A)=(R(μ,AG,M)00eXμ(IDeXμ)1R(μ,AG,M)R(μ,QD)eXμ(IDeXμ)1K1R(μ,QU)00R(μ,QU)). (19)

    Proof. Under the assumptions (A1)-(A3) and according to [20,Theorem 4.1], the operator

    AG,M=Am,D(AG,M)={zZ:Gz=Mz}

    generates a strongly continuous semigroup (TG,M(t))t0 on X. Moreover, for μρ(A), we have

    μρ(AG,M)1ρ(MDμ).

    In this case

    R(μ,AG,M)=(I+Dμ(IXMDμ)1M)R(μ,A).

    On the other hand, for μρ(A),

    IUMDμ=(IXMDμ00DμIXDeXμK1eUμ00IX).

    Thus IUMDμ is invertible if and only if 1ρ(MDμ)ρ(Deμ). Hence μρ(AG,M) is equivalent to 1ρ(MDμ)ρ(Deμ), due to [20,Theorem 4.1]. Finally, the expression (19) is easily obtained by using the following relation

    R(μ,AG,M)=(I+Dμ(IMDμ)1M)R(μ,A).

    Let us now discuss the spectrum of the generator A.

    Proposition 2. Let assumptions of Proposition 1 be satisfied. For μρ(A),

    μρ(A)1ρ(Δ(μ))1ρ(MDμ)ρ(DeXμ),

    where Δ(μ):=eXμ(IDeXμ)1R(μ,AG,M)L. In addition,

    R(μ,A)=(R(μ,AG,M)[I+LΓ(μ)R(μ,AG,M)]R(μ,AG,M)LR(1,Δ(μ))R(μ,QD)Λ(μ)R(μ,QU)Γ(μ)R(μ,AG,M)R(1,Δ(μ))R(μ,QD)Ω(μ)R(μ,QU)00R(μ,QU)), (20)

    for 1ρ(MDμ)ρ(DeXμ). Here the operator QD is defined in Remark 1 and

    Γ(μ):=R(1,Δ(μ))eXμ(IDeXμ)1,Ω(μ):=Γ(μ)(K1+R(μ,AG,M)B1)Λ(μ):=R(μ,AG,M)(LΩ(μ)+B1).

    Proof. Let μρ(A)ρ(AG,M) and (x,f,g)X, we are seeking for (z,φ,ψ)D(AG,M) such that

    (μA)(z,φ,ψ)=(x,f,g). (21)

    From the proof of Theorem 3.1 (in particular (17)), we have A=AG,M+P on D(AG,M). Now according to Lemma 3.2, for μρ(AG,M)ρ(AG,M),

    μA=μAG,MP=(μAG,M)(IR(μ,AG,M)P)=(μAG,M)(IR(μ,AG,M)LR(μ,AG,M)B10IeXμ(IDeXμ)1R(μ,AG,M)LeXμ(IDeXμ)1R(μ,AG,M)B100I). (22)

    So, the above matrix together with the equation (21) gives

    zR(μ,AG,M)LφR(μ,AG,M)B1ψ=x(IeXμ(IDeXμ)1R(μ,AG,M)L)φeXμ(IDeXμ)1R(μ,AG,M)B1ψ=fψ=g. (23)

    Assume that 1ρ(Δ(μ)). Then

    φ=R(1,Δ(μ))f+R(1,Δ(μ))eXμ(IDeXμ)1R(μ,AG,M)B1g.

    On the other hand, replacing the value of φ in (23),

    z=x+R(μ,AG,M)LR(1,Δ(μ))f+R(μ,AG,M)(LR(1,Δ(μ))eXμ(IDeXμ)1R(μ,AG,M)B1+B1)g.

    Thus μρ(A) and (20) holds.

    In this section, we provide conditions for approximate controllability of the abstract perturbed boundary control systems of neutral type (11). In fact, by using the feedback theory of regular linear systems and methods of functional analysis, necessary and sufficient conditions for approximate controllability are introduced.

    We first reformulate the neutral system(11) as an abstract perturbed boundary control system with input space. To this end, we select

    B(vu)=(B0u00),K(vu)=(KvK0u0),u,vU.

    According to Section 3, the neutral system (11) can be written as

    {˙ζ(t)=[Am+P]ζ(t)+Bu(t),t0,ζ(0)=(ϱ0,φ,ψ),Gζ(t)=Mζ(t)+Ku(t),t0. (24)

    By combining Theorem 3.1 and [20,Theorem 4.3], it follows that the system (24) (hence the system (11)) has a unique solution. This solution coincides with the solution of the open–loop system

    {˙ζ(t)=A1ζ(t)+(BK+B)(v(t)u(t))t>0,ζ(0)=(ϱ0,φ,ψ). (25)

    In particular, according to [20,Theorem 4.3] the state trajectory of the system (25), for the initial state ζ(0), is given by

    ζ(t)=U(t)ζ(0)+t0U1(ts)(BK+B)(v(s)u(s))ds,t0. (26)

    Remark 2. The function ζ() given by (26) is a strong solution of (25), which is defined for any ζ(0)X and u,vLploc([0,);U). To obtain a classical solution, one needs more regularities of control functions.

    To state our results on approximate controllability of (24), we first define the concept of approximate controllability for (25).

    Definition 4.1. According to the equation (26), we define the operator

    ΦA(t)u:=t0U1(ts)(BK+B)(v(s)u(s))ds,

    for t0 and u,vLp([0,t];U). The system (24) is said to be X-approximately controllable if

    Cl(t0PX(ΦA(t)))=X,

    where X can be any of X, X, X×Lp([r,0];X), Lp([r,0];X) and Lp([r,0];U), and PX is the projection operator from X to X. In particular, PX=I.

    Remark 3. Notice that when the system (24) is X-approximately controllable, it means that the corresponding state z is approximately controllable; when it is X×Lp([r,0];X)-approximately controllable, it means that the corresponding state z and xt are approximately controllable; when it is Lp([r,0];U)-approximately controllable, it means that the corresponding state ut is approximately controllable. Apparently, it is always Lp([r,0];U)-approximately controllable.

    In the following we will use the duality of product spaces. Assume that X and U are reflexive Banach spaces (or more generally its satisfies the Radon-Nikodym property) and 1<p<. Then the dual space X of X is identified with the product space X×Lq([r,0],X)×Lq([r,0],U) with q satisfying 1p+1q=1.

    Theorem 4.2. Under the framework of Definition 4.1 and with the notation in Proposition 2, the following assertions are equivalent:

    (a) the system (24) is X×Lp([r,0],X)-approximately controllable,

    (b) for 1ρ(MDμ)ρ(DeXμ), xX and φLq([r,0],X), the fact that

    [I+R(μ,AG,M)LΓ(μ)]R(μ,AG,M)(BKv+B0u)+R(μ,AG,M)LΓ(μ)K0u+Λ(μ)eUμu,x+Γ(μ)R(μ,AG,M)(BKv+B0u)+Γ(μ)K0u+Ω(μ)eUμu,φ=0,u,vU,

    implies that x=0 and φ=0.

    In this case, there exists τ>0 such that the system (24) is approximately controllable.

    Proof. Let μρ(A) such that 1ρ(MDμ)ρ(Deμ)ρ(Δ(μ)). According to Proposition 2, there is

    R(μ,A)=(R(μ,AG,M)[I+LΓ(μ)R(μ,AG,M)]R(μ,AG,M)LR(1,Δ(μ))R(μ,QD)Λ(μ)R(μ,QU)Γ(μ)R(μ,AG,M)R(1,Δ(μ))R(μ,QD)Ω(μ)R(μ,QU)00R(μ,QU))

    On the other hand, we have

    (BK+B)(vu)=(BKvβXK0uβUu)+(B0u00)=(BKv+B0uβXK0uβUu).

    Thus,

    (BK+B)(vu)=

    (R(μ,AG,M)[I+LΓ(μ)R(μ,AG,M)]R(μ,AG,M)LR(1,Δ(μ))R(μ,QD)Λ(μ)R(μ,QU)Γ(μ)R(μ,AG,M)R(1,Δ(μ))R(μ,QD)Ω(μ)R(μ,QU)00R(μ,QU))(BKv+B0uβXK0uβUu)=([I+R(μ,AG,M)LΓ(μ)]R(μ,AG,M)(BKv+B0u)+R(μ,AG,M)LΓ(μ)K0u+Λ(μ)eUμuΓ(μ)R(μ,AG,M)(BKv+B0u)+Γ(μ)K0u+Ω(μ)eUμueUμu),

    where we have used the fact that R(μ,QD)=(IeXμD)1R(μ,QX) and eXμ(IDeXμ)1=(IeXμD)1eXμ. Now using the same strategy as in [12,Proposition 3], it follows that (a)(b).

    Therefore, according to Remark 3, it is clear that the system (24) is always Lp([r,0],U)-approximately controllable. Then, the statement (a) yields the existence of a time for which system (24) is approximate controllability.

    Corollary 1. Let the conditions of Theorem 4.2 be satisfied. The system (24) is X-approximately controllable if and only if, for 1ρ(MDμ)ρ(DeXμ) and xX, the fact that

    [I+R(μ,AG,M)LΓ(μ)]R(μ,AG,M)(BKv+B0u)+R(μ,AG,M)LΓ(μ)K0u+Λ(μ)eUμu,x=0,

    for all v,uU implies that x=0.

    This corollary characterize the condition when z, partial state of system (24), can reach all points in X. In general, this is irrelevant to the approximate controllability of system (11).

    Corollary 2. Under the conditions of Theorem 4.2, the system (24) is Lp([r,0],X)-approximately controllable if and only if, for 1ρ(MDμ)ρ(DeXμ) and φLq([r,0],X), the fact that

    Γ(μ)R(μ,AG,M)(BKv+B0u)+Γ(μ)K0u+Ω(μ)eUμu,φ=0,v,uU, (27)

    implies that φ=0.

    This corollary actually describes the approximate controllability of the system (11).

    Remark 4. For μρ(A) such that 1ρ(MDμ)ρ(DeXμ), we denote by

    Ξ(μ)=(IDeXμR(μ,AG,M)LeXμ)1.

    In view of Proposition 2, the following holds.

    Γ(μ):=R(1,Δ(μ))eXμ(IDeXμ)1=eXμΞ(μ).

    Using the above remark we obtain:

    Theorem 4.3. The abstract boundary control system of neutral type (11) is approximately controllable if and only if, for 1ρ(MDμ)ρ(DeXμ) and xX, the fact that

    Ξ(μ)(R(μ,AG,M)(BKv+B0u+B1eUμu)+K0u+K1eUμu),x=0

    for all v,uU, implies that x=0.

    Proof. The state x() of the system (11) is approximately controllable if and only if the system (24) is Lp([r,0],X)-approximately controllable, i.e., the state xt is approximately controllable. Under the notation of Remark 4, the condition (27) is equivalent to

    Ξ(μ)(R(μ,AG,M)(BKv+B0u+B1eUμu)+K0u+K1eUμu),(eXμ)φ=0,

    for all u,vU, with (eXμ)φX, since Ω(μ)=Γ(μ)[K1+R(μ,AG,M)B1]; see Proposition 2. Replacing (eXμ)φ with x results in the conclusion.

    In this subsection, we study approximate controllability of neutral delay systems when the control space is finite dimensional. We establish a novel rank condition criteria for approximate controllability of such class of systems.

    Before going further and stating the main result of this subsection, we need to introduce some notation. We start with the assumption on the control space U=Cn. Then, K0 and B0 are finite-rank operators defined by

    Ku=nl=1Klvl,K0u=nl=1K0,lulandB0u=nl=1B0,lul,

    where K0,l,B0,lX. Moreover, denote K1 and B1 as

    K1=(K1,1,K1,2,,K1,n)andB1=(B1,1,B1,2,,B1,n),

    such as K1,l,B1,l:W1,p([r,0],C)X for l=1,,n. Therefore, for u=(u1,,un)Cn and μC, we have

    K1eUμu=nl=1K1,leμul=nl=1ulK1,leμ1B1eUμu=nl=1B1,leμul=nl=1ulB1,leμ1 (28)

    with (eμ1)(θ)=eμθ for θ[r,0].

    Throughout the following, we denote the orthogonal space of a set F in X by

    F={xX;y,x=0,yF}.

    Remark 5. In view of Theorem 4.3, the abstract boundary control system of neutral type (11) is approximately controllable if and only if, for 1ρ(MDμ)ρ(Deμ)ρ(Δ(μ)),

    ¯(Ξ(μ)Dμ(IMDμ)1KCn)+(Ξ(μ)(K0+K1eUμ+R(μ,AG,M)(B0+B1eUμ))Cn)=X. (29)

    In fact,

    R(μ,AG,M)BK=(I+Dμ(IMDμ)1M)R(μ,A)BK=(I+Dμ(IMDμ)1M)DμK=Dμ(IMDμ)1K.

    Moreover, according to [8,Proposition 2.14.], the above fact is equivalent to that

    (Ξ(μ)Dμ(IMDμ)1KCn)(Ξ(μ)(K0+K1eUμ+R(μ,AG,M)(B0+B1eUμ))Cn)={0}. (30)

    Next we provide a useful characterization of approximate controllability for system (11). To this end, we denotes by dl the dimension of

    Υl(μ):=(Ξ(μ)Dμ(IMDμ)1Kl),l=1,,n,

    and by (φ1l,φ2l,,φdll) the associated basis.

    In view of Remark 5, the statement in Theorem 4.3 is equivalent to the following theorem:

    Theorem 4.4. Assume that the control space is finite dimensional. Then the neutral delay system (11) is approximately controllable if and only if, for 1ρ(MDμ)ρ(DeXμ),

    Rank(Ξ(μ)Π1(μ)+Ξ(μ)Π1(μ)eμ1,φ1lΞ(μ)Π1(μ)+Ξ(μ)Π1(μ)eμ1,φdllΞ(μ)Π2(μ)+Ξ(μ)Π2(μ)eμ1,φ1lΞ(μ)Π2(μ)+Ξ(μ)Π2(μ)eμ1,φdllΞ(μ)Πl(μ)+Ξ(μ)Πl(μ)eμ1,φ1lΞ(μ)Πl(μ)+Ξ(μ)Πl(μ)eμ1,φdll)=dl, (31)

    for l=1,,n, where

    Πl(μ):=R(μ,AG,M)B1,l+K1,lΠl(μ):=R(μ,AG,M)B0,l+K0,l.

    Proof. First, using the fact that

    Ξ(μ)Πl(μ)u+Ξ(μ)Πl(μ)eμu,x=nl=1ˉulΞ(μ)Πl(μ)+Ξ(μ)Πl(μ)eμ1,x,

    we promptly obtain the following:

    (Ξ(μ)(K0+K1eUμ+R(μ,AG,M)(B0+B1eUμ))Cn)=({Ξ(μ)Πl(μ)+Ξ(μ)Πl(μ)eμ1:l=1,,n}). (32)

    According to Remark 5, to prove the claim of the theorem it suffice to prove that the conditions (30) and (31) are equivalent. To this end, we denote by Ml the matrix appearing in (31) and assume that it is not of rank dl. Then, there exist v=(v1,,vdl)Cdl{0} such that Mlv=0, i.e,

    (dlj=1ˉvjΞ(μ)Π1(μ)+Ξ(μ)Π1(μ)eμ1,φjldlj=1ˉvjΞ(μ)Π2(μ)+Ξ(μ)Π2(μ)eμ1,φjldlj=1ˉvjΞ(μ)Πl(μ)+Ξ(μ)Πl(μ)eμ1,φjl)=(000). (33)

    As (φ1l,φ2l,,φdll) is a basis of Υl(μ), we obtain

    dlj=1ˉvjφjlΥl(μ).

    On other hand, because of (32) and (33) one can see that

    dlj=1ˉvjφjl(Ξ(μ)Πl(μ)+Ξ(μ)Πl(μ)eμ1).

    This is a contradiction, which show that the condition (30) implies (31). The converse is demonstrated in a similar fashion by using the expression (32) and the basis (φ1l,φ2l,,φdll). The proof is completed.

    Example 1. Consider the perturbed boundary control time-delay system

    ˙z(t)=Amz(t)+Pz(tr)+Nu(tr)+Bu(t),t0,Gz(t)=Mz(t)+Kv(t),t0,z(0)=z0,z(θ)=φ,u(θ)=ψ,for a.e.   θ[r,0]. (34)

    Here Am:D(Am)XX is a closed, linear differential operator on a reflexive Banach space X and G,M:D(Am)X are unbounded trace operators. B,N:CnX are linear bounded operators and K:CnX. This system can be obtained from the system (11) by imposing D=0, K0=0, K1=0, L=Pδr, and B1=Nδr, where δr is the Dirac operator. Thus, according to Theorem 3.1, the following holds.

    Corollary 3. Assume that the operators Am,G,M satisfy the assumptions (A1)-(A3). Then the perturbed boundary control time-delay system (34) is well-posed.

    In this case, for μρ(A)ρ(AG,M+erμM), we have

    Ξ(μ)=(μIAG,MerμM)1,

    and

    Kv=ni=1Kivi,KiXBu=ni=1Biui,BiXNut=ni=1Niuit,NiX.

    Corollary 4. According to Theorem 4.4, the system (34) is approximately controllable if and only if, for μρ(A)ρ(AG,M+erμM),

    Rank(Ξ(μ)(N1+B1erμ),ψ1iΞ(μ)(N1+B1erμ),ψ2iΞ(μ)(N1+B1erμ),ψdiiΞ(μ)(N2+B2erμ),ψ1iΞ(μ)(N2+B2erμ),ψ2iΞ(μ)(N2+B2erμ),ψdiiΞ(μ)(Nl+Blerμ),ψ1iΞ(μ)(Nl+Blerμ),ψ2iΞ(μ)(Nl+Bkerμ),ψdii)=di.

    Where di=dim(Ξ(μ)Dμ(IMDμ)1Ki) and (ψ1i,ψ2i,,ψdii) is the associated basis, for i=1,2,,n.

    Note that the equation (34) is a slight generalization of the one proposed in [9,Theorem 4.2.6], where the system operator Am and delay operators are just constant matrices. Thus, the result from the above corollary is more general.

    Let us consider a finite, connected graph G=(V,E) and a flow on it (the latter is described by the differential equation (35) below). The graph G is composed by nN vertices α1,,αn, and by mN edges e1,,em which are assumed to be normalized on the interval [0,1]. We shall denote the vertices at the endpoints of the edge ej by ej(1) and ej(0), respectively, and assume that the particles flows from ej(1) to ej(0).

    This section characterizes approximate controllability of the following system of transport network system of neutral type and input delays:

    {tϱj(t,x)=cj(x)xϱj(t,x)+qj(x)ϱj(t,x)+mk=1Ljkzk(t+,),x(0,1),t0,ϱj(0,x)=gj(x),x(0,1),iijcj(1)ϱj(t,1)=wijmk=1i+ikck(0)ϱj(t,0)+n0l=1kilvl(t),t0,zj(θ,x)=φj(θ,x),uj(θ)=ψj(θ),θ[r,0],x(0,1),ϱj(t,x)=[zj(t,x)mk=1Djkzk(t+,)ni=1kijuj(t+)bijuj(t)] (35)

    for i=1,,n and j=1,,m with n,mN. Here, the coefficients iij and i+ij are the entries of the so-called outgoing and incoming incidence matrices of G (denoted by I+ and I), respectively, defined as

    iij:={1,if vi=ej(1),0,otherwise.,i+ij:={1,if vi=ej(0),0,otherwise.

    The coefficients 0wij determine the proportion of mass leaving vertex vi into the edge ej and define a graph matrix called the weighted outgoing incidence matrix of G, denoted by Iw. Additionally, we impose the Kirchhoff condition

    mj=1wij=1,i=1,,n. (36)

    Let X=Lp([0,1];Cm), X=Cn and define the operator Am as

    (Amg)j(x):=cj(x)ddxgj(x)+qj(x).gj(x)

    with domain

    gD(Am):={g=(g1,,gm)(W1,p[0,1])m:g(1)Range(Iw)}.

    Moreover, we define the boundary operators G,M:D(Am)X by

    Gg:=g(1),Mg:=c1(1)Bc(0)g(0). (37)

    Clearly, G satisfies the assumptions (A1) and (A2). Therefore, according to [13,Theorem 3.6], it follows that:

    Lemma 5.1. Define the operators

    A:=(Am)|kerG,B=(μA1)(G|ker(μAm))1C=M|D(A),μC.

    Then the triple (A,B,C) satisfy the assumption (A3).

    So, we have.

    Lemma 5.2. The operator

    A:=Am,D(A)={gW1,p([0,1],Cm):g(1)=c1(1)Bc(0)g(0)}. (38)

    generates a strongly continuous semigroups (T(t))t0 on X, where B:=(Iw)I+ is the weighted (transposed) adjacency matrix of the line graph (i.e., the graph obtained from G by exchanging the role of the vertices and edges).

    Proof. For the proof of this result we refer to [13,Theorem 3.6].

    Moreover, we obtain.

    Corollary 5. For μρ(A), we have

    R(μ,A)=(I+Dμ(ICnAμ)1M)R(μ,A),

    where

    (Dμv)(x)=diag(eξj(x,1)μτj(x,1))v,Mg:=c(1)1Bc(0)g(0)(R(μ,A)f)j(x)=1xeξj(x,y)μτj(x,y)cj(y)fj(y)dy

    for gD(Am), vCn,fCm,x[0,1] and

    (Aμ)ip={wpjeξj(0,1)μτj(0,1),if  vi=ej(0)  and  vp=ej(1),0,otherwise.

    Proof. A proof of this lemma can be found in [13,Corollary 3.8].

    On the other hand, in order to apply the results of the previous sections, let us assume that

    Djk(gk)=0rdηjk(θ)gk(θ),Ljk(gk)=0rdγjk(θ)gk(θ),kij(fj)=0rdϑij(θ)fj(θ),

    for gW1,p([r,0],X) and fW1,p([r,0],Cn), where η,γ:[r,0]L(X) and ϑ:[r,0]L(Cn,X) are functions of bounded variations continuous at zero with η(0)=γ(0)=ϑ(0)=0. Thus the system (36) is rewritten in the form (11) with D=(Djk)m×m, L=(Ljk)m×m, K0=(bij)m×n, K1=(kij)m×n and B1=B00.

    Therefore, according to Theorem 3.1, the transport network system of neutral type (36) is well-posed.

    Corollary 6. The operator (A,D(A)) defined by

    A=(AL00QXm000QUm),D(A)={(fφψ)D(Am)×W1,p([r,0],X)×D(QU):(f(1)=c1(1)Bc(0)f(0)φ(0)=f+Dφ+K1ψ)}.

    generates a strongly continuous semigroups (U(t))t0 on the following product space

    X×Lp([r,0];X)×Lp([r,0];Cn0).

    In this case, for 1ρ(Aμ)ρ(Deμ), we have

    Ξ(μ)=(IDeμR(μ,A)LeμDμ(ICnAμ)1MR(μ,A)Leμ)1.

    The fact that the transport network system of neutral type (35) is approximately controllable follows from the following result:

    Corollary 7. Let 1ρ(Aμ)ρ(Deμ), then the system (35) is approximately controllable if and only if the following matrix is of rank di

    mj=1(Ξ(μ)(b1j+k1jeμ1),φ1iΞ(μ)(b1j+k1jeμ1),φdiiΞ(μ)(b2j+k2jeμ1),φ1iΞ(μ)(b2j+k2jeμ1),φdiiΞ(μ)(bnj+knjeμ1),φ1iΞ(μ)(bnj+knjeμ1),φdii,),i=1,,n.

    Here di denote the dimension of

    (n0l=1Ξ(μ)Dμ(ICnAμ)1kil),

    and (φ1i,φ2i,,φdii) denote the associated basis, for i=1,,n.

    Proof. The statements follows from Theorem 4.4 with

    Πi(μ)=mj=1Ξ(μ)kij,Πiμ)=mj=1Ξ(μ)bij,Υi(μ)=(n0l=1Ξ(μ)Dμ(ICnAμ)1kil).


    [1] Asymptotic behaviour of flows on reducible networks. J. Networks Heterogeneous Media (2014) 9: 197-216.
    [2] J. Banasiak and A. Puchalska, A Transport on networks - a playground of continuous and discrete mathematics in population dynamics, In Mathematics Applied to Engineering, Modelling, and Social Issues, Springer, Cham, 2019,439–487.
    [3] A. Bátkai and S. Piazzera, Semigroups for Delay Equations, Research Notes in Mathematics, 10, A K Peters Ltd, Wellesley, 2005.
    [4] Asymptotic periodicity of flows in time-depending networks. J. Networks Heterogeneous Media (2013) 8: 843-855.
    [5] Flows in networks with delay in the vertices. Math. Nachr. (2012) 285: 1603-1615.
    [6] Complex networks: Structure and dynamics. Phys. Rep. (2006) 424: 175-308.
    [7] Regular linear systems governed by neutral FDEs.. J. Math. Anal. Appl. (2006) 320: 836-858.
    [8] H. Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations, Springer, New York, 2010.
    [9] R. F. Curtain and H. Zwart, An Introduction to Infinite-Dimensional Linear Systems Theory, Texts in Applied Mathematics, 21 Spinger-Verlag, New York, 1995. doi: 10.1007/978-1-4612-4224-6
    [10] Controllability of linear discrete systems with constant coefficients and pure delay. SIAM J. Control Optim. (2008) 47: 1140-1149.
    [11] The semigroup approach to transport processes in networks. Physica D: Nonlinear Phenomena (2010) 239: 1416-1421.
    [12] Y. El Gantouh, S. Hadd and A. Rhandi, Approximate controllabilty of network systems, Evol. Equ. Control Theory, (2020). doi: 10.3934/eect.2020091
    [13] Y. El Gantouh, S. Hadd and A. Rhandi, Controllability of vertex delay type problems by the regular linear systems approach, Preprint.
    [14] Exact and positive controllability of boundary control systems, networks. J. Networks Heterogeneous Media (2017) 12: 319-337.
    [15] Maximal controllability for boundary control problems. Appl. Math. Optim. (2010) 62: 205-227.
    [16] K.-J. Engel and R. Nagel, One-parameter Semigroups for Linear Evolution Equations, Springer-Verlag, New York, 2000.
    [17] Perturbing the boundary conditions of a generator. Houston J. Math. (1987) 13: 213-229.
    [18] Unbounded perturbations of C0-semigroups on Banach spaces and Applications. Semigroup Forum (2005) 70: 451-465.
    [19] The regular linear systems associated to the shift semigroups and application to control delay systems with delay. Math. Control Signals Sys. (2006) 18: 272-291.
    [20] Unbounded perturbations of the generator domain. Discrete and Continuous Dynamical Sys. (2015) 35: 703-723.
    [21] Eventual norm continuity for neutral semigroups on Banach spaces. J. Math. Anal. Appl. (2011) 375: 543-552.
    [22] J. K. Hale and S. M. Verduyn Lunel, Introduction to Functional Differential Equations, Applied Math. Sciences Series, 99, Springer-Verlag, New York, 1993. doi: 10.1007/978-1-4612-4342-7
    [23] Asymptotic behavior of flows in networks. Forum Math. (2007) 19: 429-461.
    [24] The analysis of exact controllability of neutral-type systems by the moment problem approach. SIAM J. Control Optim. (2007) 46: 2148-2181.
    [25] On controllability and observability of time delay systems. IEEE Trans. Automat. Control (1984) 29: 432-439.
    [26] Infinite-dimensional linear system with unbounded control and observation: A functional analytic approach. Trans. Amer. Math. Soc. (1987) 300: 383-431.
    [27] Radius of approximate controllability oflinear retarded systems under structured perturbations. Systems Control Lett. (2015) 84: 13-20.
    [28] (2005) Well-posed Linear Systems. Cambridge Univ: Press.
    [29] Controllability and observability of systems of linear delay differential equations via the matrix Lambert W function. IEEE Trans. Automat. Control (2008) 53: 854-860.
    [30] M. Tucsnak and G. Weiss, Observation and Control for Operator Semigroups, Birkhäuser, Basel, Boston, Berlin, 2009. doi: 10.1007/978-3-7643-8994-9
    [31] Admissible observation operators for linear semigoups. Israel J. Math. (1989) 65: 17-43.
    [32] Admissibility of unbounded control operators. SIAM J. Control Optim. (1989) 27: 527-545.
    [33] Transfer functions of regular linear systems. Part I: Characterization of regularity. Trans. Amer. Math. Soc. (1994) 342: 827-854.
    [34] Regular linear systems with feedback. Math. Control Signals Systems (1994) 7: 23-57.
    [35] Q. C. Zhong, Robust Control of Time-Delay Systems, Springer-Verlag Limited, London, 2006.
  • Reader Comments
  • © 2021 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1766) PDF downloads(181) Cited by(0)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog