Actuator design for parabolic distributed parameter systems with the moment method
Yannick Privat (LJLL), Emmanuel Tr\'elat (LJLL, UPMC), Enrique Zuazua

TL;DR
This paper develops a spectral optimal design method for actuators in parabolic PDEs, optimizing both location and shape using the moment method, with theoretical guarantees and numerical validation.
Contribution
It introduces a novel spectral optimization framework for actuator shape and placement in parabolic PDEs using the moment method, including existence, uniqueness, and computational procedures.
Findings
Optimal actuator distributions exist and are unique under certain conditions.
The method effectively maximizes control energy over random initial data.
Numerical simulations confirm the theoretical results and applicability.
Abstract
In this paper, we model and solve the problem of designing in an optimal way actuators for parabolic partial differential equations settled on a bounded open connected subset of IR n. We optimize not only the location but also the shape of actuators, by finding what is the optimal distribution of actuators in , over all possible such distributions of a given measure. Using the moment method, we formulate a spectral optimal design problem, which consists of maximizing a criterion corresponding to an average over random initial data of the largest L 2-energy of controllers. Since we choose the moment method to control the PDE, our study mainly covers one-dimensional parabolic operators, but we also provide several examples in higher dimensions. We consider two types of controllers: either internal controls, modeled by characteristic functions, or lumped controls, that are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStability and Controllability of Differential Equations · Advanced Mathematical Modeling in Engineering
Actuator design for parabolic distributed parameter systems with the moment method
Yannick Privat111CNRS, Sorbonne Universités, UPMC Univ Paris 06, UMR 7598, Laboratoire Jacques-Louis Lions, F-75005, Paris, France ([email protected]).
Emmanuel Trélat222Sorbonne Universités, UPMC Univ Paris 06, CNRS UMR 7598, Laboratoire Jacques-Louis Lions, Institut Universitaire de France, F-75005, Paris, France ([email protected]).
Enrique Zuazua333DeustoTech - Fundación Deusto, Avda Universidades, 24, 48007, Bilbao - Basque Country - Spain. 444Departamento de Matemáticas, Universidad Autónoma de Madrid, 28049 Madrid - Spain 555Facultad Ingenieria, Universidad de Deusto, Avda. Universidades, 24, 48007, - Basque Country - Spain. 666Sorbonne Universités, UPMC Univ Paris 06, CNRS UMR 7598, Laboratoire Jacques-Louis Lions, F-75005, Paris, France ([email protected]).
Abstract
In this paper, we model and solve the problem of designing in an optimal way actuators for parabolic partial differential equations settled on a bounded open connected subset of . We optimize not only the location but also the shape of actuators, by finding what is the optimal distribution of actuators in , over all possible such distributions of a given measure. Using the moment method, we formulate a spectral optimal design problem, which consists of maximizing a criterion corresponding to an average over random initial data of the largest -energy of controllers. Since we choose the moment method to control the PDE, our study mainly covers one-dimensional parabolic operators, but we also provide several examples in higher dimensions.
We consider two types of controllers: either internal controls, modeled by characteristic functions, or lumped controls, that are tensorized functions in time and space. Under appropriate spectral assumptions, we prove existence and uniqueness of an optimal actuator distribution, and we provide a simple computation procedure. Numerical simulations illustrate our results.
Keywords: heat equation, parabolic systems, shape optimization, null controllability, moment method, lumped control.
AMS classification: 93B07, 35L05, 49K20, 42B37.
1 Introduction and modeling of the problem
In this article, we model and solve the problem of finding the optimal shape and location of internal controllers for parabolic equations with (mainly) Dirichlet boundary conditions and (mainly) in the one-dimensional case . Such questions are frequently encountered in engineering applications. We provide a possible mathematical model for investigating such issues.
For mathematical reasons that will be clarified in the sequel, we will focus in the whole article on controls obtained by using the so-called moment method. As it will be underlined, it requires in general some spectral gap assumptions on the operators involved that essentially reduce the applications of our results to one-dimensional partial differential equations, but our results also cover several particular situations in larger dimension.
To avoid technicalities and highlight the main ideas, we first present the results in the simplified framework of the controlled one-dimensional heat equation with Dirichlet boundary conditions, without introducing (at this step) the more general parabolic framework in which our results are actually valid.
Generalizations to a more general framework will be described in Section 3. Unlike the simplified case of the one-dimensional heat equation, it requires a discussion on the Müntz-Szász theorem as well as specific spectral considerations.
Notice that the general control framework in which this problem could be addressed is much more intricate and will be evoked as a possible perspective at the end of this article.
1.1 Reminders on the controllability of the 1D heat equation
Consider the internally controlled one-dimensional heat equation
[TABLE]
with Dirichlet boundary conditions
[TABLE]
where is a control function, and is a measurable subset of standing for the support of the controller. Here, is the characteristic function of , defined by if and otherwise. For a given subset , the equation (1) is said to be exactly null controllable in time whenever every initial datum can be steered to [math] in time by means of an appropriate control function . It is well known that, for a given subset , the system (1) is exactly null controllable if and only if there exist a positive constant (only depending on and ) such that
[TABLE]
(observability inequality) for every solution of
[TABLE]
with .
Exact null controllability by the moment method.
The observability inequality (3) has been shown to hold true for any subset of of positive Lebesgue measure in [32] by the moment method, that we will use as well in the present paper and that we recall hereafterin.
The eigenfunctions of the Dirichlet-Laplacian, given by for every , associated with the eigenvalues , make up an orthonormal basis of . From the Müntz-Szász theorem, there exists a sequence of , biorthogonal to the sequence of functions . The following lemma provides an exact null controllability result for (1)-(2).
Lemma 1**.**
[32]** Let and let be a measurable subset of of positive measure. Then every initial datum
[TABLE]
in , can be steered to zero in time with the control defined by
[TABLE]
A proof of this lemma is given in a more general setting in Section A.1.
We set . The operator is linear and continuous, and is called the moment control operator. The norm of this operator, given by provides an account for the worst possible initial datum to be controlled to zero, in terms of the effort ( energy) required to steer this initial datum to zero. Minimizing over a class of admissible domains (that we will denote by in the sequel) is then an interesting problem, that will be discussed in the next section.
1.2 State of the art
When realizing exact null controllability in practice, an important question is to know where to place and how to shape optimally the actuators (modeled here by the subset ), in order to minimize the efforts done to steer any possible initial data to zero. In this paper, we want to optimize not only the location, but also the shape of actuators, without any specific restriction on the regularity of .
The literature on optimal sensor or actuator location problems is abundant in engineering applications (see, e.g., [6, 15, 18, 19, 33, 37, 38, 39] and references therein), where the aim is often to optimize the number, the place and the type of sensors or actuators in order to improve the estimation of the state of the system. Fields of applications are very numerous and concern for example active structural acoustics, piezoelectric actuators, vibration control in mechanical structures, damage detection and chemical reactions, just to name a few of them. In most of these applications the method consists of approximating appropriately the problem by selecting a finite number of possible optimal candidates and of recasting the problem as a finite-dimensional combinatorial optimization problem. In many of these contributions the sensors or actuators have a prescribed shape (for instance, balls with a prescribed radius) and then the problem consists of placing optimally a finite number of points (the centers of the balls) and thus is finite-dimensional, since the class of optimal designs is replaced with a compact finite-dimensional set. We stress that, in the present paper, the shape of the control domain is an unknown of the optimization procedure.
From the mathematical point of view, the issue of studying a relaxed version of optimal design problems for the shape and position of sensors or actuators has been investigated in a series of articles. In [25], the authors study a homogenized version of the optimal location of controllers for the heat equation problem (for fixed initial data), noticing that such problems are often ill-posed. In [3], the authors consider a similar problem and study the asymptotic behavior as the final time goes to infinity of the solutions of the relaxed problem; they prove that optimal designs converge to an optimal relaxed design of the corresponding two-phase optimization problem for the stationary heat equation. We also mention [24] where, for fixed initial data, numerical investigations are used to provide evidence that the optimal location of null-controllers of the heat equation problem is an ill-posed problem.
Concerning the problem of optimal shape and location of sensors for fixed initial data (instead of controllers in [24]) we proved in [27] that it is always well posed for heat, wave or Schrödinger equations (in the sense that no relaxation phenomenon occurs); we showed that the complexity of the optimal set depends on the regularity of the initial data, and in particular we proved that, even for smooth initial data, the optimal set may be of fractal type (and there is no relaxation). In [31], we modeled and solved the problem of optimal shape and location of the observation domain having a prescribed measure. This problem was motivated by the question of shaping and placing sensors in some domain in such a way to optimize the quality of the observation.
Here, we rather investigate the dual question of the best shape and location of actuators. In [20], the authors investigate numerical approximations of exact or trajectory controls for the heat equation, by developing a numerical version of the so-called transmutation method.
1.3 Modeling of the optimal design problems: a randomization procedure
In the present paper, our objective is to search the internal control domain over all possible subsets of , without assuming any a priori regularity. We optimize not only the placement but also the shape of the actuators.
Note that, for any problem consisting of optimizing the quality of the control, certainly the best strategy consists of controlling the solutions over the whole domain . This is however obviously not reasonable and in practice the domain covered by actuators is limited, due for instance to cost considerations. From the mathematical point of view, we model this basic limitation by considering as the set of unknowns, the set of all possible measurable subsets of that are of Lebesgue measure , where is some fixed real number. Any such subset represents the actuators put in . Finally, for mathematical reasons, it is more convenient to assimilate a measurable subdomain of to its characteristic function , vanishing outside and equal to 1 else. Hence, let us introduce the class of admissible control domains
[TABLE]
In view of modeling the optimal design of actuators, a first approach consists of minimizing the functional over the set . However, even for simple choices of control domains , the quantity is not explicitly computable and therefore the cost functional is hard to handle. Besides, note that the moment control operator norm is deterministic and thus provides an account for the worst possible case; in this sense, it is a pessimistic constant. One can argue that, in practice, when running a large number of experiments, it is expected that the worst possible case does not occur so often. For these reasons, we are next going to consider an average criterion which, in some sense, does not take into account rare events. Nevertheless, we stress that the issue of minimizing with respect to the domain has not only a mathematical interest, but appears also naturally in some practical situations, where it is imperative that the worst possible case be avoided, even if it is a rare event. We refer to the conclusion section 3.4 for some comments about such a problem. The same kind of difficulty arises when modeling optimal design problems for sensors, as discussed in [30, 31].
In this paper, we propose another approach based on the controllability result stated in Lemma 1, and on a randomization argument reflecting what happens when a large number of experiments is expected to be done. We are going to use a probabilistic argument, by considering random initial data. We follow the approach developed in [30, 31]. Let us fix an arbitrary initial datum of the controlled system (1), with Fourier coefficients defined by
[TABLE]
These coefficients are now randomized according to for every , where is a sequence of independent real random variables on a probability space , having mean equal to [math], variance equal to , and with a super exponential decay777Recall that the sequence is said to have a super-exponential decay whenever
(for instance, independent Bernoulli random variables, see [9, 10] for details and properties of randomization). For every event , the control steering the initial datum
[TABLE]
to zero by the moment method is, according to Lemma 1,
[TABLE]
Using the previous notations, one has . We propose, then, to model the problem of best actuator shape and location as the problem of minimizing the averaged functional
[TABLE]
over , where is the expectation over the probability space . This is the randomized counterpart to the deterministic quantity . One of the advantages is that can be explicitly computed, as follows.
Lemma 2**.**
One has
[TABLE]
for every measurable subset .
Lemma 2 is proved in Section A.2. Therefore, the problem of best shape and location of actuators is finally written as
[TABLE]
The article is organized as follows: Section 3.1 is devoted to comments on the control of parabolic equations by the moment method, the use of biorthogonal sequences and modeling of the optimal design problem issues. In Section 3.2, we solve the problem and provide a numerical illustration as well as a series of examples, mainly in the 1D case due to the restrictions imposed by the choice of the control method. Finally, in Section 3.3, we investigate a variant of the previously studied optimal design problem, where the control acts on the system by means of tuning the time-intensity.
2 Solving the problem (7)
2.1 Main results, comments and illustration
We first provide an existence result.
Theorem 1**.**
The shape optimization problem (7) has a unique888Here and in the sequel, it is understood that the optimal set is unique within the class of all measurable subsets of quotiented by the set of all measurable subsets of of zero measure. solution .
This theorem is proved in Section 2.3.
In addition to this result, what is remarkable is that we have a simple and numerically efficient procedure to compute the optimal control domain .
Algorithmic computation procedure.
The optimal set of Theorem 1 can actually be built from a finite-dimensional spectral approximation, by keeping only a finite number of modes. Let us provide the details of the procedure. For every integer , we define the functional by
[TABLE]
for every measurable subset of . The functional is a spectral truncation to the first terms. We consider the shape optimization problem
[TABLE]
called truncated problem, which is a spectral approximation of the problem (7).
We have then the following results, proved in Sections 2.2 and 2.3.
Proposition 1**.**
For every , the truncated problem (8) has a unique solution . Moreover, has a finite number of connected components, and there exists such that .
Proposition 2 further (see Section 3.2) will provide an extension of this result to higher dimensions. We will however provide two different proofs. Indeed, in the one-dimensional case investigated here, we will show in the proof that the problem (8) can be expressed in an equivalent way as a classical optimal control problem. This point of view (already used in [28]) is interesting not only for the proof but also in order to derive efficient numerical methods for the numerical computation of the optimal domains.
Let us now give the main result that is at the base of the algorithmic procedure.
Theorem 2**.**
There exists such that for every .
Furthermore, we have , where is the first integer (which exists and is finite) such that
[TABLE]
As a result, is equal to if is large enough.
In other words, Theorem 2 says that the sequence of optimal sets, whose existence is stated in Proposition 1, is stationary. The numerical procedure consists of computing these sets, and once it has become stationary, then we have found the optimal set , solution of the shape optimization problem (7).
A natural issue concerns the characterization of the minimal integer such that the sequence of optimal domains remains constant. Even if a partial answer is provided in Theorem 2, it is likely that the determination of is in general intricate.
As a numerical illustration of this computation procedure, we provide on Figure 1 several numerical simulations of the optimal control domain, solution of the truncated problem (8) in the 1D case, for the Dirichlet-Laplacian. We observe the expected stationarity property of the sequence of optimal domains from on.
In the forthcoming section devoted to providing the proofs of the results above, it will be required to consider a convexified version of the problem (7), which may fail to have some solutions because of the hard constraint999Indeed, equality constraints in are in general not preserved by the natural topologies such as the weak-star topology. (which is a binary constraint almost everywhere). This is usually referred to as relaxation (see, e.g., [8]). Since the set (defined by (5)) does not share nice compactness properties, we consider the convex closure of for the weak star topology of , which is
[TABLE]
Such a relaxation was used as well in [25, 29, 30]. Replacing with , we consider the relaxed (or convexified) formulation of the problem (7) given by
[TABLE]
where the functional is naturally extended to by
[TABLE]
for every . We consider as well a relaxed formulation of the truncated optimal design problem (8) by
[TABLE]
where the functional is naturally extended to by
[TABLE]
for every .
Being defined as the infimum of linear functions, continuous for the weak star topology, the functional is upper semi continuous for the weak star topology. The set being compact for this topology, we then have the following result.
Lemma 3**.**
For every , the relaxed problem (10) (respectively (12), for any ) has at least one solution (respectively ).
2.2 Proof of Proposition 1
Considering the functions of as controls, and interpreting the problem (8) as an optimal control problem, leads to consider the control system
[TABLE]
for almost every , with initial conditions
[TABLE]
The additional function above stands for the cost functional and will be defined with the help of inequality constraints below since it is written as the minimum of the quantities over .
The relaxed problem (10) is then equivalent to the optimal control problem of determining a control steering the control system (14) from the initial conditions (15) to the final condition
[TABLE]
and maximizing the quantity (or similarly , since in constant on ), with the additional final conditions
[TABLE]
Indeed, this follows directly from the observation that the unique solution of
[TABLE]
is .
Therefore, is a solution of the optimal control problem above. The existence of an optimal control is standard. According to the Pontryagin Maximum Principle (see [26]), if is optimal then there exist real numbers101010Note that, since the dynamics of (14) do not depend on the state, it follows that the adjoint states of the Pontryagin Maximum Principle are constant. , such that
[TABLE]
for almost every , where the so-called switching function is defined by
[TABLE]
Moreover, the control is nonsingular (see [35]) since is a finite trigonometric sum and thus cannot be constant on any subset of positive measure. In particular, this implies that the optimal control is the characteristic function of a measurable subset of of measure . Note that the minimum of on is reached at [math] and , hence from (18) the optimal set does not contain [math] and .
To prove uniqueness, according to the previous discussion where it is stated that every maximizer of over is the characteristic function of some subset of , assume that there exist two distinct minimizers and in . As a maximum of linear functionals, the functional is convex on , and it follows that for every the function is also a solution of the problem (12), which is in contradiction with the fact that any solution of this problem is extremal.
Finally, the fact that has at most connected components follows from the facts that the elements of are the solutions of and that can be written as
[TABLE]
where denotes the -th Chebychev polynomial of the first kind. The degree of the polynomial (in the argument ) is at most , whence the result.
2.3 Proofs of Theorems 1 and 2
The main idea of this proof is close to the one of [31, Theorem 1]. According to Lemma 3, the relaxed optimal design problem (10) has at least one solution . We will prove simultaneously Theorems 1 and 2, by showing that coincides with the solution of the truncated problem (8) for large enough.
First of all, as a consequence of [28, Lemma 6], we have and therefore,
[TABLE]
for every . Besides, we have the following result on the growth of the biorthogonal sequence , following from [23, Theorem 3.2].
Lemma 4**.**
Let . There exists such that
[TABLE]
for every .
It follows from this result that
[TABLE]
for every .
Combining these two facts, we infer that
[TABLE]
and moreover, there exists such that
[TABLE]
Since there holds in particular
[TABLE]
we infer from (22) that
[TABLE]
Let us actually prove that , where denotes the unique maximizer of , as stated in Lemma 3. Since maximizes over , one has . Let us argue by contradiction and assume that . For every , we set . Since is concave (as an infimum of linear functionals), we get
[TABLE]
for every , which means that
[TABLE]
for every . Besides, for every there exists small enough such that
[TABLE]
for every . Therefore,
[TABLE]
Since there holds in particular , we infer from (23) and (24) that , which contradicts the optimality of .
Therefore , whence the result.
Estimate of the integer .
It remains to provide an estimate for . We claim that any nonzero integer such that the inequality
[TABLE]
holds true satisfies (in the sequel, we denote by any integer such that the sequence remains constant).
To prove this claim, let us consider the simple case where . Notice that, in the next explanations, the lower bound on the time is not a restriction of our approach and can be chosen as small as desired with a slight adaptation of the following arguments. It is possible to perform more precise computations since in this case, we know at the same time several properties on the involved biorthogonal sequences as well as the useful spectral property: for all , one has according to [28, Lemma 6]. As a consequence, following the proof of Theorem 1 and by using in particular (20), can be chosen to be any integer such that
[TABLE]
According to [23, Theorem 3.2], there holds , and we infer that can also be chosen such that
[TABLE]
It remains to provide an upper bound of the quantity for any . To this aim, we will use that for a given , the mapping is the control of minimal -norm for the boundary control problem of steering the system
[TABLE]
with initial datum to zero in time , as highlighted in [23, Proposition 2.2]. Consider the particular control function vanishing on the time interval and equal to the control constructed with the help of the Hilbert Uniqueness Method (HUM) for the control problem of steering the system (25) with initial datum to zero in time . The existence of is well-known and we refer for instance to [36, 40]. More generally, the controllability property of (25) also implies the existence that does not depend on nor such that for all since the sequence of functions is uniformly bounded in . We thus infer that
[TABLE]
for every , and therefore, it suffices to choose such that
[TABLE]
This estimate shows in particular that and thus are equal to if is large enough.
3 Generalization to parabolic distributed parameter systems, and lumped control
In this section, we generalize the results obtained previously for the one-dimensional heat equation, to a large family of parabolic systems. In a second step, we consider an alternative way of acting on the system, by means of lumped controls.
3.1 Problem setting
Let be an integer, and let be a bounded open connected subset of . We consider the internally controlled parabolic distributed parameter system
[TABLE]
where is a densely defined operator that generates a strongly continuous semigroup on , is the control function, and is a measurable subset standing for the control domain.
We assume that there exists an orthonormal basis of consisting of eigenfunctions of , associated with (complex) eigenvalues such that .
The one-dimensional heat equation investigated previously enters into this frame, but now the setting is much more general.
The objective of this section is to give a precise sense to the question of optimizing the control domain . As a first remark, let us note that, since the equation is parabolic and thus has smoothing properties, we focus on the exact null controllability problem, that is the problem of steering the system from any initial condition (in an appropriate functional space) to zero, within a time .
We use the moment method in order to derive a relevant model of optimal sensor shape and location with results valuable for almost every initial data. This method provides a way of constructing a control achieving exact null controllability, for some given initial data . As explained below, this approach suffers however from restrictions related to the Müntz-Szász theorem, and then cannot be applied to any parabolic system.
We address this control problem in the framework developed in [12] (see also the survey [32]) where the controllability problem is reduced to a moment problem which is solved explicitly with the help of a biorthogonal sequence to the family of exponential functions .
Consider the control system (26) with the initial data
[TABLE]
The moment method provides a control steering the parabolic system (26) to zero, as stated in the following result.
Lemma 5**.**
We define formally the function by
[TABLE]
for almost every and every . If this series defines a function of , then this control is a solution of the problem of steering the system (26) from to [math] in time .
The proof of this lemma is done in Section A.1.
Remark 1**.**
Recall that such a biorthogonal sequence exists if and only if the family is minimal, that is, every element lies outside of the closure in of the vector space spanned by all other elements , with . If this condition is fulfilled, then this biorthogonal sequence is uniquely determined if and only if the family is complete in .
It is well known, by the Müntz-Szász theorem, that the family is complete in (but not independent) if and only if
[TABLE]
for some real number such that for every (for instance, is suitable). On the contrary, if this series is convergent then the closure of the span of is a proper subspace of , moreover is minimal and thus a biorthogonal sequence exists.
Then, here, we are led to assume that the series is convergent, which is a quite strong restriction on the parabolic system under consideration.
For every , we set , where is the control defined by (28), steering the system (26) from to [math] in time . This defines an operator , called the moment control operator, which is linear and continuous. Its norm is
As in the previous section, we randomize the Fourier coefficients of a given , with , by defining for every , where is a sequence of independent real-valued random variables on a probability space having mean equal to [math], variance equal to , and a super exponential decay (for instance, independent Bernoulli random variables). Then we define
[TABLE]
where , and is the expectation over the space with respect to the probability measure .
Lemma 6**.**
There holds
[TABLE]
where the coefficients are defined by
[TABLE]
for every .
This lemma is proved in Section A.2. As discussed previously, we model the best actuator shape and placement problem as the problem of minimizing over the set defined by
[TABLE]
According to Lemma 6, the problem of optimal actuator placement is equivalent to the problem
[TABLE]
where the coefficients are defined by (29). In what follows, we define
[TABLE]
for every measurable subset .
3.2 Main result and examples
We consider the following assumptions.
(Strong Conic Independence Property) If there exist a subset of of positive Lebesgue measure, an integer , a -tuple , and such that almost everywhere on , then there must hold and for every .
For every such that , one has
[TABLE]
The eigenfunctions are analytic in .
These assumptions have been considered as well in [31] and are commented in that reference. For instance, they are satisfied for with and is the Dirichlet-Laplacian on a piecewise domain (see [31, Section 2.4]).
The problem (31) is similar to the optimal design problem (7), except that now the weights are defined by (29). It appears then important to estimate the asymptotics of as tends to . But this has been done in [7, 12, 13, 23]. Those estimates will impose further restrictions on the problem under consideration.
For every , we define the truncated criterion
[TABLE]
for every measurable subset . We have the following result.
Proposition 2**.**
Let . Under , the problem
[TABLE]
has a unique solution in . Moreover, under the additional assumption , is an open semi-analytic111111A subset of a real analytic finite dimensional manifold is said to be semi-analytic if it can be written in terms of equalities and inequalities of analytic functions. We recall that such semi-analytic subsets are stratifiable in the sense of Whitney (see [14, 16]), and enjoy local finitetess properties, such that: local finite perimeter, local finite number of connected components, etc. set.
This proposition is proved in Section A.3. The main result is then the following theorem, proved in Section A.4.
Theorem 3**.**
Assume that there exist , , and a sequence biorthogonal to the family , such that
[TABLE]
for every . Then, under and , the problem (31) has a unique solution . Moreover there exists such that , for every . In particular, if is moreover satisfied, then is an open semi-analytic subset of , and thus, it has a finite number of connected components.
The same considerations as in Section 2 on the algorithmic computation procedure still hold in this general framework.
To finish, we provide hereafter some classes of examples for which the existence of a biorthogonal sequence satisfying (33) is known.
- •
Assume that there exist , , , and such that
[TABLE]
for all , where the elements of the sequence are assumed to lie in for some given . As argued in Remark 1, under the condition (34) there exists a sequence biorthogonal to , and it is proved in [13] that there exist two positive constants and such that
[TABLE]
and since
[TABLE]
for every , we infer the existence of and such that the estimate (33) holds. We also refer to [23, Theorem 3.2] for an elementary proof of (33) for the eigenvalues the one-dimensional Dirichlet Laplacian operator.
For example, assume that is a positive power of the one-dimensional Dirichlet-Laplacian on ; then (34) is satisfied if and only if .
In [13] other examples are provided where (34) is satisfied, such as the damped Euler-Bernoulli plate in dimension two.
- •
Assume that is a sequence of positive real numbers and that there exist , and such that
[TABLE]
as tends to . It is proved in [12, Formula (3.25)] that there exists two constants and such that
[TABLE]
for every and the estimate (33) then holds true. Note that the authors of [12] use it to derive exact controllability results for a Sturm-Liouville one-dimensional equation. We also mention the article [4] where the authors extend the above approach and estimate to the framework of systems of one-dimensional parabolic equations, in view of establishing exact boundary controllability properties.
- •
Assume that is the Dirichlet-Laplacian on the unit ball , with arbitrary. Using a refined study of the sequences of eigenfunctions and eigenvalues, it is proved in [11, Section 6, (6.27)] that (33) holds true with a constant not depending on , and the authors use it to investigate boundary controllability issues for the heat equation in . Then Theorem 3 can be applied, provided that is large enough (since it is required that ).
3.3 Optimal lumped controls
In this section, we investigate a variant of the previously studied optimal design problem, based on another kind of controls referred to in the literature as the lumped controls (see [32, Chapter 4] or [17, Chapter 1.4]). This wording designates tensorized controls that are the product of separated variables functions in time and space, the space profile of the control term being given. Then one only acts on the system by means of tuning the time-intensity of the control.
Let be an open connected subset of and be a densely defined operator that generates a strongly continuous semigroup on . We adopt the same framework as in Section 3.1, assuming the existence of an orthonormal basis of consisting of eigenfunctions of , associated with (complex) eigenvalues such that .
Consider the internally controlled parabolic system
[TABLE]
with Dirichlet boundary conditions, where is the control profile and is the control function. The controlled system (35) is a particular version of (1).
In some sense, the function plays the role of in (26), but here, the control function depends only on . The function is usually fixed and the control is . Here, we propose to optimize the control profile .
Performing the same analysis as in Section 1.1 and using the same notations, one proves easily that every initial datum can be steered to zero in time with the control given by
[TABLE]
provided that the Fourier coefficients of do not vanish.
As previously, we define the moment control operator by , with . Its norm is given by
[TABLE]
Following the framework developed in Sections 1.1 and 3.1 leads to define a randomized criterion by defining for every . Then we define
[TABLE]
where denotes the function of whose Fourier coefficients are the defined above.
Lemma 7**.**
There holds
[TABLE]
The proof is similar to the proofs of Lemmas 1 and 5, and thus is skipped.
We model the “best design of lumped controller” as the problem of minimizing over the set of all possible profiles . The functional being homogeneous according to the previous lemma, the problem of optimal lumped control placement is then equivalent to the problem
[TABLE]
with
[TABLE]
for every . Let us now solve this optimal design problem.
Theorem 4**.**
We assume that
[TABLE]
Then, the problem (36) has at least one solution, and we have
[TABLE]
Moreover, the set of solutions consists of all functions in that can be expanded as
[TABLE]
This theorem is proved in Section A.5.
Remark 2**.**
Consider the case where is defined on (one-dimensional Dirichlet-Laplacian). Then and for every .
Denote by any solution of the problem (36). According to [23, Theorem 3.2], there exists a positive constant such that
[TABLE]
for every . According to Theorem 4, it follows that the Fourier coefficients decrease exponentially with respect to , and as a consequence, the optimal functions are analytic (see e.g. [2, Chapter 11, §63]).
Remark 3**.**
It might seem natural and of physical interest to investigate what happens if we restrict our search of the control profile to a set of characteristic functions of a measurable subset , with the measure of possibly fixed. Doing this, we get a kind of instability: indeed, assuming that is the finite union of rational intervals (in other words, intervals whose extremities are rational multiples of ), one can easily check that
[TABLE]
Therefore, this problem appears to be ill-posed in some sense, and is probably not so much relevant with respect to practical issues.
3.4 Conclusion
To conclude, let us provide several further comments and open problems.
Generalization to other methods of control and higher dimensions.
As underlined in the previous sections, the use of controllers obtained by the moment method reduces mainly the perimeter of our study to one-dimensional operators.
In view of generalizing our approach to other control operators, let us use the framework described in Section 3.1, considering the controlled system
[TABLE]
where and is a control steering this system from to 0 in time , whenever it is possible. Let us assume that for every and every Lebesgue measurable subset of positive measure, the system (38) is null-controllable in time . In this case, let us write .
For instance, the Hilbert Uniqueness Method (see [21, 22]) is a well-known method used to design a null control for (1)-(2), with the additional property that this control has a minimal norm over all possible null controls. The null-controllability property in time of this system is equivalent to an observability property on the pair . Note that in the case where is the Dirichlet-Laplacian operator , it has been showed in [5] that the observability inequality holds true for every and every Lebesgue measurable subset of positive measure.
Following the approach described in Section 3.1, we define
[TABLE]
where , and is the expectation over the space with respect to the probability measure . Similar computations as those of Section A.2 enable to show that
[TABLE]
As discussed previously, we model the best actuator shape and placement problem as the problem of minimizing over the set . Analyzing this optimal design problem does not seem easy since it requires to know fine regularity properties of each control function defined by .
Analysis of the full control operator.
One of the main issues that remains to be developed is whether one can attack the problem of the optimal design of the controllers and actuators without the diagonalization procedure by randomization. The issue is then much harder to handle, as it occurs at the level of the observability problem. Note also that in that case, because of possible interactions of all modes, it is unclear how complex the optimal sets are.
Actually, if one defines the Gramian operator as the infinite dimensional symmetric nonnegative matrix whose coefficient at row and column is given by , the operator norm is the inverse of the smallest eigenvalue of . The randomization procedure consists in dropping the non-diagonal terms in , by considering the inverse of smallest eigenvalue of .
Concerning the particular case of controllers given by the Hilbert Uniqueness Method (see [21, 22]) to design a null control for (1)-(2), minimizing the control efforts in a deterministic way is actually equivalent to maximizing
[TABLE]
which is the largest possible observability constant in the inequality (3), over , because of the duality between controllability and observability. An interesting problem then consists of maximizing the functional over the set . This problem has been discussed in [30, 31], and for the same reasons as above it has appeared more relevant to introduce the concept of randomized observability constant . At this step, one may think of coming back, by duality, to the controllability problem. Unfortunately, the problem of maximizing does not admit any nice interpretation in terms of controlling, say, almost every initial data to [math] in time . This is due to the fact that the randomization procedure does not commute with the duality operator realizing the duality between observability and controllability.
More precisely, the Gramian defined above does not commute with the randomization procedure. To describe which kind of initial data can be steered to [math] in a random way, it would be required to compute the image under of the random laws used in the randomization procedure, and then show that these random laws share appropriate probability properties, as in [10].
Hence, here, we have found more relevant to combine the randomization procedure with the moment method, in which case the problem of the lack of commutation arising in the HUM procedure disappears.
Use of other biorthogonal families.
We have here used the moment problem approach but in a very special way, taking advantage of the fact that eigenvalues grow sufficiently fast so to ensure the existence of a family of time-biorthogonals that allow to build by separation of variables biorthogonal families for all possible supports of the control .
Of course the issue can be formulated without that restrictive assumption taking advantage of the existence of biorthogonal families in the variables, in other words of families such that
[TABLE]
But their dependence with respect to seems to be hard to analyze.
Appendix A Proofs
In what follows and similarly to what has been done in Section 2, we will consider a convexified version of the problem (31) to overcome the difficulty related to the non-compactness of the set defined by (30) for the weak-star topology. We refer to this section for more comments on this procedure.
The convex closure of for the weak star topology of is
[TABLE]
Replacing with , we consider the convexified formulation of the problem (31) given by
[TABLE]
where the functional is naturally extended to by
[TABLE]
for every . We consider as well a relaxed formulation of the truncated optimal design problem (32) by
[TABLE]
where the functional is naturally extended to by
[TABLE]
for every .
We have the following result.
Lemma 8**.**
For every , the relaxed problem (40) (respectively (42), for any ) has at least one solution (respectively ).
We refer to Section 2.1 for a proof of this result.
A.1 Proofs of Lemmas 1 and 5
We prove Lemma 5, which is a generalization of Lemma 1.
We seek a control function in achieving the null controllability for the system (26) with the initial condition , that is, such that . Setting , we get
[TABLE]
for every . In order to realize the null controllability in time , the control must be such that
[TABLE]
for every . In order to solve these equations, assume that there exists a sequence of functions biorthogonal to the family , that is,
[TABLE]
for all , where whenever , and otherwise. Then the function defined by (28) is a formal solution of the moment problem (44).
A.2 Proof of Lemmas 2 and 6
We randomize the initial datum according to . Then, the corresponding control coming from the moment method, steering to [math] in time , is
[TABLE]
and hence
[TABLE]
and therefore,
[TABLE]
The result follows.
A.3 Proof of Proposition 2
This proof is similar to the one of [31, Proposition 2]. We include it in the present paper, for the sake of completeness and readability.
For every , we consider the relaxed truncated problem (43), where the functional is defined by (42). Using the same arguments as in the proof of Lemma 8, it is clear that the problem (43) has at least one solution . Let us prove that is the characteristic function of a set such that . Defining the simplex set , it follows from the Sion minimax theorem (see [34]) that
[TABLE]
and that there exists such that is a saddle point of the functional
[TABLE]
Therefore, is solution of the optimal design problem
[TABLE]
We set , for every . It follows from that is never constant on any subset of of positive measure. Therefore, there exists such that whenever , and otherwise. In other words, , with .
The uniqueness of follows from the fact that, as proved above, any optimal solution is a characteristic function. Indeed if there were two optimal sets, then any convex combination would also be an optimal solution because is concave. This raises a contradiction since any maximizer has to be a characteristic function.
Under the additional assumption , the function is analytic in and therefore is an open semi-analytic set.
A.4 Proof of Theorem 3
This proof is a immediate adaptation of the one of Theorem 1.
Indeed, notice that according to the assumption , the estimate (21), constituting the starting point of the proof of Theorem 1, can be replaced by
[TABLE]
where stands for a solution of the relaxed problem (40).
The rest of the proof is then unchanged.
A.5 Proof of Theorem 4
We expand , with for every . Note that, since , we have . We define the convex set by
[TABLE]
Note that, if is a sequence of positive real numbers, then
[TABLE]
Therefore, the optimal value for the problem (36) coincides with the optimal value of a convexified problem, as follows. Writing , there holds
[TABLE]
where the functional is defined by In accordance with (37), define the sequence by for every . Clearly, and we have
[TABLE]
Similarly,
[TABLE]
It follows that
[TABLE]
and the supremum is reached if, and only if
[TABLE]
for every . The conclusion follows.
Acknowledgment. The first author was partially supported by the ANR project OPTIFORM.
This work was partially supported by the Advanced Grant DYCON (Dynamic Control) of the European Research Council Executive Agency - GA 694126, ICON of the French ANR-2016-ACHN-0014-01, FA9550-15-1-0027 of AFOSR, A9550-14-1-0214 of the EOARD-AFOSR, and the MTM2014-52347 Grant of the MINECO (Spain).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[2] N.I. Akhiezer, Elements of the theory of elliptic functions , Translations of Mathematical Monographs 79 , American Mathematical Society (1990).
- 3[3] G. Allaire, A. Münch, F. Periago, Long time behavior of a two-phase optimal design for the heat equation , SIAM J. Control Optim. 48 (2010), no. 8, 5333–5356.
- 4[4] F. Ammar-Khodja, A. Benabdallah, M. González-Burgos, L. de Teresa, The Kalman condition for the boundary controllability of coupled parabolic systems. Bounds on biorthogonal families to complex matrix exponentials , J. Math. Pures Appl. 96 (2011), no. 6, 555–590.
- 5[5] J. Apraiz, L. Escauriaza, G. Wang, C. Zhang, Observability inequalities and measurable sets , to appear in J. Europ. Math. Soc. (2014).
- 6[6] A. Armaoua, M. Demetriou, Optimal actuator/sensor placement for linear parabolic PD Es using spatial H 2 superscript 𝐻 2 H^{2} norm , Chemical Engineering Science 61 (2006), 7351–7367.
- 7[7] S.A. Avdonin, S.A. Ivanov, Families of exponentials. The method of moments in controllability problems for distributed parameter systems , Cambridge University Press, Cambridge, 1995.
- 8[8] D. Bucur, G. Buttazzo, Variational methods in shape optimization problems , Progress in Nonlinear Differential Equations 65 , Birkhäuser Verlag, Basel (2005).
