On problems in the calculus of variations in increasingly elongated domains
Herv\'e Le Dret (1), Amira Mokrane (2) ((1) LJLL, (2) USTHB, ENS, Kouba-Alger)

TL;DR
This paper investigates the asymptotic behavior of calculus of variations minimizers in elongated domains, showing convergence to minimizers of a related functional in the fixed directions as the domain size increases.
Contribution
It introduces a framework for analyzing the asymptotic limits of variational problems in elongated domains with data depending only on certain coordinates.
Findings
Minimizers converge to a limit functional in fixed directions
As domain elongates, the problem simplifies to a lower-dimensional variational problem
Results apply to various configurations of elongated domains
Abstract
We consider minimization problems in the calculus of variations set in a sequence of domains the size of which tends to infinity in certain directions and such that the data only depend on the coordinates in the directions that remain constant. We study the asymptotic behavior of minimizers in various situations and show that they converge in an appropriate sense toward minimizers of a related energy functional in the constant directions.
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
TopicsAdvanced Mathematical Modeling in Engineering · Nonlinear Partial Differential Equations · Numerical methods in inverse problems
On problems in the calculus of variations
in increasingly elongated domains
Hervé Le Dret
Sorbonne Universités, UPMC Univ Paris 06, CNRS,
Laboratoire Jacques-Louis Lions, Boîte courrier 187,
75252 Paris Cedex 05, France. Email: [email protected]
Amira Mokrane
Laboratoire d’équations aux dérivées partielles
non linéaires et histoire des mathématiques, ENS, B.P. 92,
Vieux Kouba, 16050 Alger, Algérie
and USTHB, Faculté des mathématiques, Département d’analyse,
Laboratoire d’analyse mathématique et numérique
des équations aux dérivées partielles, Bab Ezzouar, Alger, Algérie.
Email: [email protected]
Abstract
We consider minimization problems in the calculus of variations set in a sequence of domains the size of which tends to infinity in certain directions and such that the data only depend on the coordinates in the directions that remain constant. We study the asymptotic behavior of minimizers in various situations and show that they converge in an appropriate sense toward minimizers of a related energy functional in the constant directions.
MSC 2010: 35J25, 35J35, 35J62, 35J92, 49J45, 74K99.
Keywords: Calculus of variations, domains becoming unbounded, asymptotic behavior, exponential rate of convergence.
1 Introduction
In this article, we revisit the “” problem in the context of the calculus of variations. This class of problems was introduced by Chipot and Rougirel in 2000, [8], see also the monograph by Chipot [4], and has since then given rise to many works by several authors dealing with various elliptic and parabolic problems up to until recently.
A prototypical problem is the following. Let , be a real number and the rectangle . We denote by the first variable in and the second variable in . Any function in the second variable gives rise to a function in two variables still denoted by setting . We thus consider the two boundary value problems: find , a function in , such that
[TABLE]
and find , a function in , such that
[TABLE]
Now the function can also be considered as a function in two variables that is independent of . In this case, it can be shown that, for any , one has
[TABLE]
hence the name of the problem. In other words, when the data does not depend on the elongated dimension, the solution of the above boundary value problem converges in some sense at finite distance to the solution of the corresponding boundary value problem posed in the non-elongated dimension when the elongation tends to infinity.
The majority of works on the problem makes use of the boundary value problem itself, i.e., the PDE plus boundary condition. One exception to this rule are the recent papers [5, 7], in which the authors consider instead a sequence of problems in the calculus of variations posed on elongated domains, see also [6]. This is the approach we adopt here as well.
Our main motivation for this is that certain models, such as nonlinear hyperelasticity, are naturally posed as problems in the calculus of variations for which no Euler-Lagrange equation, i.e., non underlying PDE even in a weak form, is available, see [2]. Moreover, questions surrounding the Saint Venant principle in elasticity, see [16, 17], are typically set in elongated domains, albeit in one direction only. Consequently, it makes sense to attempt dealing with some problems by using only energy minimization properties and no Euler-Lagrange equation whatsoever.
We are however quite far from achieving the goal of treating nonlinear elasticity, since the approach that we develop below relies a lot on convexity, whereas convexity is not an appropriate hypothesis for nonlinear elasticity. We are nonetheless able to encompass a wide range of nonlinear energies, including the -Laplacian with some technical restrictions on the number of elongated dimensions with respect to the exponent . Our hypotheses are weaker and our results are sometimes stronger than those of [7]. The techniques are somewhat different too, with an emphasis here on weak convergence and weak lower semicontinuity techniques, and reliance on such classical techniques as the De Giorgi slicing method which are not dependent on convexity. As a general rule, we try to make as little use of convexity as we can at any given point.
Let us describe our results a little more precisely. We consider bounded open subsets of which are Cartesian products of the form , with and , with . We let with being the elongated variable and the non-elongated variable. Likewise, for a scalar-valued function , we decompose the gradient with obvious notation.
We consider an energy density and a function on , and introduce the minimization problem of finding such that where
[TABLE]
We assume that has -growth, -coerciveness and is convex. In particular, there is no assumption of strict convexity or uniform strict convexity made on .
We then introduce by letting , again with obvious notation. Of course, is convex, has -growth and -coerciveness and the minimization problem of finding such that where
[TABLE]
admits solutions. It turns out that, under additional hypotheses, this problem is the “” limit of the family of minimization problems under consideration.
These hypotheses include appropriate growth and coerciveness hypotheses on the function , , of the form
[TABLE]
for some and . Depending on the case, there is no more additional hypothesis (for ), or a hypothesis of strict convexity of , or a hypothesis of uniform strict convexity of (for .
The results are a “” convergence in the weak sense for when , sharpened to strong sense when is furthermore assumed to be strictly convex, and a strong “” convergence for when . In the case of the -Laplacian, , we thus obtain strong “” convergence when , see also [18].
In addition, in the case , if we assume that is uniformly strictly convex, we obtain strong convergence at an exponential rate without any restriction on . This includes the known behavior of the -Laplacian in the “” context.
We conclude the article with a few comments and perspectives on the vectorial case, in connection with nonlinear elasticity in particular.
2 Statement of the problem
We consider two bounded open sets with and is starshaped with respect to [math], and with . Let and set
[TABLE]
Points in will be denoted by with and . Likewise, vectors in will be decomposed as , with and .
Note that because of the starshaped assumption, we have as soon as and we are thus dealing with a “growing’ family of open sets. We make an additional regularity hypothesis on , which is as follows. Define first the gauge function of as
[TABLE]
Since is starshaped and bounded, this is well defined, , and there exists such that for all .
Now we assume that is such that is a Lipschitz function with Lipschitz constant . By Rademacher’s theorem, this implies that is almost everywhere differentiable, with a.e. Moreover, it is known that then belongs to and that its almost everywhere derivatives equal its distributional derivatives. This is true for example if is convex. This regularity hypothesis is for convenience only: we use to build cut-off functions inside the domains, and not up to the boundary. It should be quite clear that our results can be rewritten in order to accommodate arbitrary open sets .
We are interested in a sequence of problems in the calculus of variations of the form
[TABLE]
with and
[TABLE]
where , , is a given function. Observe that the term corresponding to the force term for this problem only depends on the “non-elongated” variable so that it is reasonable to expect that behaves as a function mostly in in the limit , in a sense made precise below. We could also consider more general semilinear force terms of the form satisfying appropriate growth and convexity assumptions, but we stick here with a linear term for simplicity.
We assume that the energy density is convex. We let
[TABLE]
so that
[TABLE]
and is convex. These functions are assumed to satisfy the following coerciveness and growth hypotheses
[TABLE]
for some , and .111Note that yields the same hypothesis as . Here, for , denotes the canonical Euclidean norm of in .
Clearly, condition (6) implies the similar condition
[TABLE]
for .
Energy densities of the form above include that associated with the -Laplacian for . Indeed, in this case, and we can take for , or for . Another simple energy density that is covered by our analysis is or more generally energies of the form , with appropriate hypotheses on and . Here, assuming without loss of generality that , we have and we can take .
In addition to the above growth and coerciveness hypotheses, which obviously imply that problem has at least one solution , we assume that is uniformly strictly convex for , in the sense that there exists a constant such that for all , and all with , we have
[TABLE]
see for instance [1, 12, 14]. The -Laplacian for , , satisfies this hypothesis (the -Laplacian satisfies the alternate hypothesis (53) that will be used later on in Section 5). Note that when , the hypothesis becomes redundant, and there is actually no requirement of even strict convexity, let alone uniform strict convexity, of in this case.
We now introduce our candidate limit problem as that of finding such that
[TABLE]
with
[TABLE]
It also clear that problem has at least one solution .
Here and in the sequel, we use the following notational device
[TABLE]
that we apply indifferently to functions defined either on or on . For brevity, we refer to as the “horizontal” part of the gradient and to as the “vertical” part of the gradient.
We want to study the asymptotic behavior of when and compare it with a minimizer of the dimensional vertical problem . Actually, our goal is to show that the former converges to the latter in a sense that will be explained later on.
3 Preliminary estimates
We first give several estimates that we will use in the proofs of our convergence results. The first estimate follows immediately from Poincaré’s inequality.
Lemma 3.1
There exists a constant independent of such that for all whose trace vanish on , we have
[TABLE]
Let us now give a first, coarse estimate of .
Lemma 3.2
There exists a constant independent of , such that
[TABLE]
Proof. Let us take as a test-function in problem (2). It follows that
[TABLE]
where does not depend on ( denotes the -dimensional Lebesgue measure). By Hölder’s inequality and the coerciveness assumption (6), it follows that
[TABLE]
with , which does not depend on . Consequently, we obtain an estimate of the form
[TABLE]
where and are constants that do not depend on . Let us set . Estimate (14) now reads
[TABLE]
so that there exists depending only on and such that , which completes the proof.
We now recall an elementary estimate similar to what can be found in [13] for instance.
Lemma 3.3
Let a nonnegative bounded function defined on an interval , . Suppose that for , we have
[TABLE]
where are nonnegative constants with . Then, for all , we have
[TABLE]
where is a constant that only depends on , and .
Proof. If we have two sequences of nonnegative numbers and such that , it follows by induction that . We apply this remark to the sequences and , where , to be chosen later on, is an increasing sequence in such that . This yields the estimate
[TABLE]
We now choose in such a way that and , and conclude by letting , remembering that is bounded.
Next, we estimate the horizontal part of the gradient of in in terms of , , and a minimizer of the vertical problem .
Theorem 3.4
There exists a constant independent of all the other quantities such that, for all and all minimizers of the vertical problem, we have
[TABLE]
where if , otherwise.
Proof. We first define a family of cut-off functions as follows. For all , we set
[TABLE]
By the definition of the gauge function, we see that on , on and . By our regularity assumption on , is Lipschitz and such that
[TABLE]
so that we can estimate
[TABLE]
We pick a number and then set
[TABLE]
and
[TABLE]
Clearly, belongs to and is thus a suitable test-function for problem , hence
[TABLE]
Next we note that, owing to the embedding , is suitable test-function for problem for almost all , hence
[TABLE]
Integrating estimate (20) over , we obtain
[TABLE]
We add estimates (19) and (21) together and note that all the terms involving cancel out since . Therefore,
[TABLE]
We observe that and on , so that estimate (22) boils down to
[TABLE]
The left-hand side of (23) can be rewritten as
[TABLE]
Let and be the first and second integrals in the right-hand side of (23). To estimate , we just use the convexity of , since the vertical gradients of and are convex combinations of the vertical gradients of and ,
[TABLE]
To estimate , we note that and on , thus owing to the convexity of and the uniform convexity (9) of ,
[TABLE]
for some . Putting estimates (23), (25), (26) and equation (24) together, we obtain
[TABLE]
which, upon using the coerciveness hypothesis (7), yields
[TABLE]
where is a small generic constant that only depends on the other constants involved.
We now focus on estimating the right-hand side of (27). We have
[TABLE]
Based on (28) and the definition of , we have the following estimates for any exponent :
[TABLE]
We will use exponents and for the first line and for the second line. Due to the growth hypothesis (7), we have
[TABLE]
where is a large generic constant that only depends on the other constants involved. For , three of the four product terms that appear need to be estimated. For this purpose, we will use Young’s inequality in the following form
[TABLE]
for (recall that ). We thus obtain
[TABLE]
where is another generic constant. We integrate this inequality over and use Poincaré’s inequality in the vertical variables to obtain
[TABLE]
with yet another generic constant.
We now consider two different cases. First, for , let us set
[TABLE]
Inequalities (27) and (32) may be rewritten as
[TABLE]
with . Let . We invoke Lemma 3.3, with , , , , to conclude that
[TABLE]
The result follows in this case by letting and since the constant only depends on , and , and is continuous (recall that ).
Now the second case is when . Estimate (32) still holds true, but we now use Young’s inequality once more in the form
[TABLE]
with to deduce that
[TABLE]
so that we can actually write
[TABLE]
with the same function , but with another value for , which we do not write here. We conclude as before with Lemma 3.3 and the first constant for instance.
The following is an immediate consequence of the previous estimate.
Corollary 3.5
We have, for all ,
[TABLE]
where if , otherwise.
Proof. Indeed, we take , and notice that .
Let us remark that if and there is actually no strict convexity assumption made on , i.e., may well be not strictly convex, the previous result boils down to
[TABLE]
However, when , we make crucial use of the uniform strict convexity to derive the estimate.
Let us close this section with an estimate similar to that obtained in Lemma 3.2. Recall that is a minimizer on , whereas the following estimate is on . See [5] for a very similar argument.
Lemma 3.6
There exist constants and , independent of , such that for all ,
[TABLE]
Proof. Let and set . We take as a test-function in problem (2). This test-function is equal to “far away” and is [math] in . We obtain
[TABLE]
Therefore, we see that
[TABLE]
with and .
By the coerciveness and growth hypotheses (6), we infer that
[TABLE]
for some constant , since and the Lebesgue measure of is of the order of .
In , we have
[TABLE]
Clearly, estimate (12) is also valid on , thus,
[TABLE]
so that
[TABLE]
Furthermore,
[TABLE]
with to be chosen afterwards.
Let us set
[TABLE]
Putting all the above estimates together, it follows that
[TABLE]
with , and . We now pick in such a way that . Inequality (38) may be rewritten as
[TABLE]
where and depend neither on nor on . Iterating inequality (39), we see that for , we have
[TABLE]
Let us now set . We have by Lemma 3.2. Hence
[TABLE]
Now, for , the function in the right-hand side is decreasing, hence maximum for . Therefore,
[TABLE]
for . Moreover, for ,
[TABLE]
which completes the proof with \bar{\ell}=\max\bigl{(}1,-\frac{r}{\ln\theta}\bigr{)}.
We now turn to the convergence results. As a consequence of Lemma 3.6, we have, without any restriction on with respect to and ,
Theorem 3.7
There exists a subsequence and a function such that, for all ,
[TABLE]
Moreover, on .
Note that the weak convergence above implies that weakly in . We will sometimes omit the restriction notation in the sequel when unnecessary.
Proof. By estimates (12) and (37), for all , is bounded in . Using the diagonal procedure, we thus construct a sequence such that for all , weakly in , with on . Now, since as soon as , it follows that , so that we have constructed a single limit function in the desired class. Furthermore, for all , if we choose an integer , we see that convergence (41) holds true.
In the sequel, we will always consider a weakly convergent subsequence in the sense of Theorem 3.7.
4 Identification of the limit when
In this section, we do not make any further use of assumption (9) of uniform strict convexity of , other than the fact that we used it to establish Theorem 3.4.222Keep in mind that this hypothesis is void for anyway. The results will only hold for values of small enough depending on . We let .
Let us first show that the asymptotic behavior of is independent of the elongated dimension if is small enough.
Theorem 4.1
Assume that if , or that if . Then we have and may be identified with a function in the variable only, still denoted , which belongs to .
Proof. By estimates (13) and (36) and the triangle inequality, it follows that
[TABLE]
when with fixed. Indeed, when , we actually have and since , the first term in the right hand side of estimate (42) is bounded from above by the second term.
Now weakly in , hence we see that , which concludes the proof of the Theorem.
In order to get a feeling of what Theorem 4.1 says, let us look at a few examples. For the Laplacian, we have and we can take , which restricts this result to (see Section 5 for a more general result with additional hypotheses, that applies in this case). For the -Laplacian, , we can take and the result is restricted to . This restriction for the -Laplacian can already be found in [18]. Note that and are allowed for any value of . This is not optimal in this particular case, since it is known that convergence holds without restriction on the dimension with respect to , see [10].
Let us now identify the limit function. We first need another estimate.
Lemma 4.2
There exists a constant such that for all ,
[TABLE]
Proof. We may assume that , since the case is already covered by Lemma 3.6. We use here De Giorgi’s classical slicing trick. Let be an integer large enough so that . For each integer , , we consider the cut-off function
[TABLE]
This cut-off function takes its values in , it is [math] whenever or , it is for , and . Let us call the slice where . We observe that
[TABLE]
and that when .
Let us consider the test-function . The minimization problem yields the estimate
[TABLE]
Taking into account the specific form of the cut-off function, this implies that
[TABLE]
Let us estimate each term in the right-hand side separately. First of all, we have
[TABLE]
with . Secondly, we see that
[TABLE]
We now come to the slicing argument stricto sensu. By the growth estimate (6), we have
[TABLE]
The only term that causes a difficulty is the last term coming from . We now plug estimates (45), (46) and (47) into the right-hand side of estimate (44), sum for to and divide the result by . Observing that the sum of integrals over the slices gives rise to integrals over the union of all slices, which is included in , this yields
[TABLE]
We first let . Due to the Rellich-Kondrašov theorem, and it follows from the coerciveness estimate that
[TABLE]
We finally let to obtain the result with .
We now are in a position to prove the main result of this section.
Theorem 4.3
The function is a minimizer of problem .
Proof. Let be arbitrary. We use the test function , with , so that on and on . We thus have
[TABLE]
It follows from Lemma 4.2 that
[TABLE]
for some constant independent of and . The left-hand side of estimate (51) is weakly lower-semicontinuous, hence, letting , we obtain
[TABLE]
and the result follows from letting , since and .
We now apply a classical trick to obtain strong convergence when is strictly convex. Of course, when , this is already the case by assumption (9). Strict convexity is only a new assumption if . In this case, the solution of the limit problem is unique and this uniqueness implies the weak convergence of the whole family .
Theorem 4.4
Assume that is strictly convex. Then and strongly in for all .
We recall the following two lemmas that can be found e.g. in [3].
Lemma 4.5
Let be strictly convex. Let and such that
[TABLE]
Then .
The second lemma is a slight variation on Fatou’s lemma.
Lemma 4.6
Let with for all , and a.e., and . Then
[TABLE]
Proof of Theorem 4.4. We already know that strongly in by estimate (42). We thus just have to prove the strong convergence of .
We use a similar slicing as before, with the test-functions for large enough, . Skipping the details, this slicing implies that
[TABLE]
On the other hand, for almost all , the function is an admissible test-function for the limit problem, so that
[TABLE]
We integrate this inequality with respect to and obtain
[TABLE]
We now let , which yields
[TABLE]
By hypothesis (7), , which implies that for any . It follows that
[TABLE]
when , since .
Let us pick and set
[TABLE]
By weak lower semicontinuity, it is clear that
[TABLE]
Therefore
[TABLE]
so that a.e. (up to a subsequence). We then apply Lemma 4.5 to deduce that a.e. up to that same subsequence.
We now let
[TABLE]
and invoke Lemma 4.6 and (52) to obtain the result for . To conclude for all , we use the diagonal process.
5 Convergence rates
In the previous section, we obtained convergence results without taking advantage of the term involving in the left-hand side of estimate (36). This makes them valid in particular for without strict or uniform strict convexity. It should however be clear that for , the term in question can be used to obtain a much shorter convergence proof with convergence rate, which we do not detail here. More precisely,
Theorem 5.1
Under the previous hypotheses with and , we have
[TABLE]
The proof is a direct consequence of Corollary 3.5 and Lemma 3.2.
In any case, the estimates do not seem to allow a convergence proof without any restriction on with respect to in all generality, whereas it is known in some cases, for instance in the case of the Laplacian, that convergence holds true for all values of .
In order to partially overcome these shortcomings, we assume now that and that is uniformly strictly convex in the sense that
[TABLE]
for some . Note that this is equivalent to allowing in hypotheses (7) and (9). In some sense, is then infinite and it is to be expected that there should be no restriction on the allowed dimensions , plus faster than polynomial convergence. This is what we now proceed to show.
Under assumption (53), it is fairly clear that we still have an estimate similar to that of Theorem 3.4, namely,
[TABLE]
Let us thus prove that not only does convergence hold without restrictions on the elongated dimension , but that it also occurs at an exponential rate. The extra control makes things actually much easier.
Theorem 5.2
Under hypotheses (6)-(7) with and (53), then for all and all , there exist constants and independent of such that we have
[TABLE]
Proof. We take in estimate (54), which yields
[TABLE]
Setting
[TABLE]
we have just shown that
[TABLE]
or in other words
[TABLE]
with .
We iterate inequality (55) using the sequence , . Obviously
[TABLE]
for all such , and in particular for the last one,
[TABLE]
with . Now, for all , we can pick such that and for large enough, which completes the proof since .
Theorem 5.2 applies to energies of the form , for instance. We recover in particular the known result for the case of the 2-Laplacian. See also the monograph [6] for exponential estimates in this context.
6 Extension to the vectorial case
We have written everything so far in the context of a scalar problem, i.e., the functions are scalar-valued. All previous developments only made use of the minimization problem, under various convexity assumptions. Now clearly, absolutely nothing is changed if we consider instead vector-valued problems in the calculus of variations, with functions taking their values in some , if the energies are supposed to satisfy the same growth, coercivity and convexity assumptions as before, and the same convergence results hold true.
Unfortunately, in the vectorial case of the calculus of variations, the relevant condition that guarantees lower-semicontinuity of the energy functional is not convexity, but much weaker conditions such as quasiconvexity, or in the case of energies that can take the value , as is the case in nonlinear elasticity, polyconvexity, see [11]. Indeed, convexity is not suitable in nonlinear elasticity for well-known modeling reasons. This explains why we have striven to use as little convexity as possible (in some sense) at any given point in the sequence of arguments. This comment should however be mitigated by the fact that some instances of our uses of convexity will also work with rank-1-convexity, which is a reasonable assumption in the vectorial case. There are also notions of strict uniform quasiconvexity that may apply, see [12].
The fact that the Euler-Lagrange equation is not available in nonlinear elasticity is also an incentive to try and only use the minimization problem. Now, it is at this point unclear to us how to attack the elongation problem in such nonconvex vectorial cases, since we still heavily rely on (strict uniform) convexity at crucial points of the proofs. Moreover, the Dirichlet boundary condition considered here is not necessarily the most interesting one in the context of nonlinear elasticity, in particular if we have the Saint Venant principle in mind.
Even the potential limit problem is not so clear. In another dimension reduction context, when considering a body whose thickness goes to zero, and with different boundary conditions, it can be seen that quasiconvexity is not conserved through an “algebraic” formula of the kind found here, and that a relaxation step is necessary, see for instance [15]. Physically, this due to the possibility of crumpling such a thin body. A similar phenomenon may quite possibly happen here, but maybe not in the same fashion.
To the best of our knowledge, the nonconvex vectorial case remains open.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H. Attouch and D. Aze Approximation and regularization of arbitrary functions in Hilbert spaces by the Lasry-Lions method, Annales de l’Institut Henri Poincaré (C) Non Linear Analysis , 10 (1993), 289–312.
- 2[2] J.M. Ball, Convexity conditions and existence theorems in nonlinear elasticity, Arch. Rational Mech. Anal. , 63 (1977), 337–403.
- 3[3] J.M. Ball and J.E. Marsden, Quasiconvexity at the boundary, positivity of the second variation and elastic stability, Arch. Rat. Mech. Anal. , 86, 251–277, 1984.
- 4[4] M. Chipot, ℓ ℓ \ell goes to plus infinity , Birkhäuser 2002.
- 5[5] Chipot, M., On the asymptotic behaviour of some problems of the calculus of variations, J. Elliptic Parabol. Equ. , 1, 2015, 307–323. doi:10.1007/BF 03377383
- 6[6] Chipot, M., Asymptotic Issues for Some Partial Differential Equations, World Scientific, 2016.
- 7[7] M. Chipot, A. Mojsic and P. Roy, On some variational problems set on domains tending to infinity. Discrete Contin. Dyn. Syst. 36 (2016), no. 7, 3603–3621.
- 8[8] M. Chipot and A. Rougirel, Sur le comportement asymptotique de la solution de problèmes elliptiques dans des domaines cylindriques tendant vers l’infini, C. R. Acad. Sci. Paris Sér. I Math. 331 (2000), no. 6, 435–440.
