Acessibilidade / Reportar erro

Optimal design of a plate of variable thickness: a variational approach in dimension one

Abstract

For a typical design problem of a plate of variable thickness, we analyze the one-dimensional situation through a variational reformulation to discover that, in contrast with the higher dimensional case, there are optimal solutions. Another typical interpretation of this simplification is that of the optimal shape of a bending beam. The mechanism employed for the existence issue is the direct method for the new formulation. Optimality conditions are then pursued.

periodic plate; optimal design; direct method; optimality conditions


Optimal design of a plate of variable thickness: a variational approach in dimension one

Pablo Pedregal; Alberto Donoso

ETSI Industriales, Universidad de Castilla-La Mancha 13071 Ciudad Real, Spain

E-mail: adonoso@ind-cr.uclm.es

ABSTRACT

For a typical design problem of a plate of variable thickness, we analyze the one-dimensional situation through a variational reformulation to discover that, in contrast with the higher dimensional case, there are optimal solutions. Another typical interpretation of this simplification is that of the optimal shape of a bending beam. The mechanism employed for the existence issue is the direct method for the new formulation. Optimality conditions are then pursued.

Mathematical subject classification: 49J15, 49J45, 49K15, 74K20, 74P05.

Key words: periodic plate, optimal design, direct method, optimality conditions.

1 Introduction

In this paper, we analyze a simplified, one-dimensional model for the optimal design of a plate of variable thickness which is assumed to be infinite along one of its axes. In general, the Kirchhoff model for pure bending of symmetric plates ([5], [9]) postulates that the deflection of vertical displacement w of a plate is the solution of the fourth order, elliptic equation

where F Î L2(W) is the vertical load, W is the midplane of the plate with respect to which the plate is symmetric, and the design of the plate lies in the tensor M

where h is the half-thickness and B is the tensor of material constants. Boundary conditions for a clamped plate incorporate

Under the assumptions that W = (0, 1) × (0, 1), both h and F depend only on x1, and if we replace the boundary condition w = 0 on x2 = 0, x2 = 1, by a periodic boundary condition, it is elementary to check that

w(x1, x2) = y(x1)

is the solution of the above problem where y(x), x = x1, solves

Under these circumstances, the objective is to design the plate, i.e. to choose the function h(x), so that we maximize the overall rigidity of the plate. A way of measuring this global rigidity is through the compliance functional

which represents the work done by the load F. Hence, maximum global rigidity corresponds to minimum compliance.

Further natural constraints on the feasible designs limit the amount of material to be used

where h–, h+ and V are positive constants given in a coherent way

h– < V < h+.

Altogether, and given positive constants h– < V < h+, B = B1111 and F Î L2(0, 1), we seek to

where

and h is feasible as specified in the last paragraph. Notice that the constants 2/3 and B can be incorporated either in the design h or in the load F so that we will look at the somewhat simpler problem

subject to

and h is such that

This type of optimal design problems have been analyzed in a number of papers (in addition to the references already cited see [4]) even in the two dimensional situation but the design still depending on one variable. One of the main features of these problems is the lack of optimal designs and the infinitesimal spatial oscillations leading to optimality. In the present work, and as a previous step to the higher dimensional situation, we pretend to recast the above optimal control problem in a purely variational format that may allow a treatment in the context of the Calculus of Variations by using all the tools and techniques of this discipline. This perspective have already been explored in [2] for one-dimensional situations and first order problems and, for instance, in [12] for vector, higher dimensional problems.

The interpretation of our problem as looking for the optimal shape of a bending beam has also received some attention recently. We believe that our approach is however more transparent and direct, and some delicate technical issues can be resolved in an elementary way (see [6] and references therein). We will also see how our results can be adapted to treat a somewhat more general situation where we replace the third power occuring in (1.1) by a non-vanishing real power s.

The main contribution here is the somewhat surprising result, contrary to the higher dimensional situation ([3], [11]), that optimal designs exist. It is however true that existence of optimal solutions in simplified one-dimensional situations occurs in a variety of situations (see for instance [1], [7], [10]). This existence (Section 3) is achieved by a suitable reformulation as a variational problem (Section 2) to which classical techniques can be applied. In the final sections, optimality conditions are also explored and numerical implementations based on optimality are shown.

2 A variational reformulation

Let f be a primitive of a primitive of F, i.e.

then the differential law can be reinterpreted by writing

where l(x) is a linear function in (0, 1). The underlying idea for our reformulation is to consider (2.1) as a substitute of the differential equation and as a way to relate the pairs (y, l) with the design h. In addition, by performing an integration by parts twice on the cost functional and bearing in mind the boundary conditions on y, it is straightforward to realize

or even further

for any linear function l(x). More precisely, consider the set

D = {(x, l, x) Î 3 : hsx = f(x) + l for some h Î [h–, h+]},

and define the density

j : D

* = È {+¥}

by setting

The cost functional for the equivalent variational problem will be

where y Î H2(0, 1), it complies with all the boundary conditions and l is linear. The volume restriction, however, poses some difficulties. Indeed, solving for h in (2.1) leads us to impose

For convenience, let us put

If the set where f equals a linear function is not negligible, the definition of D forces y¢¢ to vanish in that same set, and then h can be chosen arbitrarily on the admissible interval [h–, h+]. But that set does not contribute to the cost functional (f¢¢ = 0) so that we would use as little material as we would be allowed, i.e. we would choose h(x) = h– in that set. This possibility has to be compared with other choices when looking for optimal profiles.

Theorem 2.1. Our original optimal design problem is equivalent to the variational problem

subject to

in the sense that for any given feasible design h, there exists a feasible pair (l, y), and for any such given admissible pair (l, y) there is an admissible design h, such that J (h) = I (l, y). In particular the passage from optimal solutions of one problem to optimal solutions of the other is given by

The proof has almost been indicated, and as a matter of fact, the new variational principle has been set up so that this equivalence is guaranteed.

We would like to clarify the existence-nonexistence of optimal solutions through the analysis of this equivalent variational problem by using the classical tool of the direct method.

3 Existence of optimal solutions

It is well-known that there are two main ingredients in the direct method of the Calculus of Variations in order to show existence of optimal solutions: weak lower semicontinuity and coercivity ([8]). Moreover weak lower semicontinuity is equivalent to convexity of the functionals involved in those variables where we have weak but not strong convergence ([13]). We treat those two issues succesively.

We first elucidate the weak lower semicontinuity property for our variational problem. This essentially involves the convexity of the functions j and y with respect to x. Notice that the weak convergence

lj

l in L2(0, 1)

when all lj's are linear implies that l itself is linear and the convergence is indeed strong. This is straightforward. Because of this fact, convexity of j and y with respect to l is not enforced nor needed.

Lemma 3.1. The function j(x, l, x) is convex with respect to x for any value of s while y(x, l, x) is convex with respect to x provided s > –1.

Proof. The proof consists in the realization that the set where both j and y are finite, i.e. the set D, is convex in x for fixed (x, l). In fact

D(x, l) = {x Î : (x, l, x) Î D}

can be given explicitly as the interval with end-points

In any case this is indeed a convex set. In addition, on such interval the functions j and y are convex. On the one hand, j is even linear. On the other, y is convex if s > –1 because in D f(x) + l and x must have the same sign.

The weak lower semicontinuity is a direct consequence of the convexity shown in the lemma. This is a standard fact.

Proposition 3.2. The functionals with integrands j and y are weak lower semicontinuous with respect to weak convergence in L2(0, 1)× H2(0, 1). Namely, if

yj

y in H2(0, 1),

then

Coercivity is another main ingredient for the success of the direct method in providing optimal solutions. In our situation, this is immediate because

if (x, l, x) Î D. Concerning coercivity for l it is also elementary to obtain

if (x, l, x) Î D. The following theorem is a rather routine application of the direct method.

Theorem 3.3. Our variational problem admits optimal solutions if s > –1, and consequently, so does our original optimal design problem.

4 Optimality conditions

Once the existence of optimal solutions has been rigorously established, we are entitled to pursue the analysis of optimality conditions in order to better understand the features of optimal solutions. Since the analysis that follows does not depend on the particular value of s as long as s > 0 and the value s = 3 is particularly important, we have restrict our computations in this section to this value s = 3, though the same calculations are valid for any such value of s.

It turns out that the best way we have found to write optimality conditions down is to go back to the genuine design variable h but keeping the variational form of the problem. In particular we still use (2.1) to write

and thus eliminate the variable y¢¢ from the variational form of the problem. It is elementary to check that in this way we can write the problem in a new equivalent form as

subject to

These two new integral constraints come from the fact that

must comply with the boundary conditions

y(0) = y(1) = y¢(0) = y¢(1) = 0.

If we consider the condition l¢¢ = 0 as a ''state equation" regarding l as the state and h as the control, it is elementary to apply Pontryaguin's maximum principle to obtain optimality conditions. Indeed, if we let

the hamiltonian is

where multipliers li are associated with the three integral constraints and l3> 0. Indeed l3 > 0 is expected because the optimal h will yield maximum volume V. The dynamics for the costates pi are governed by

together with the transversality conditions

p1(0) = p1(1) = p2(0) = p2(1) = 0.

Therefore we can write

and demand

Likewise

Integrating by parts in this last integral and bearing in mind (4.1), we conclude

(4.1) and (4.2) imply that l1(x) = l1 + l2x. Therefore the remaining optimality condition enforces h(x) to be the point of attainment of the minimum

This together with the three integral constraints

determines uniquely the optimal h(x) and l1(x), and the multiplier l3. Even further if we put

then

This information already yields interesting qualitative properties about optimal designs and how they can be found. If we rewrite this last formula in terms of

we see that

where

Notice that F = (l3/3)1/2g¢¢ (x) implies that g is smooth. In particular, we see that in the region h– < h(x) < h+ , h must be the square root of g. For instance, if F is constant, then transition from h– to h+ must take place by arcs of the square root. We will see this behavior in the numerical computations of the next section. These computations are based on the optimality information in this section.

5 Numerical computations

The numerical simulations that follow have been implemented by using in an elementary way the equilibrium conditions (4.3) and (4.4). The algorithm used is an elementary fixed point scheme transforming the multipliers li, i = 1, 2, 3, by utilizing (4.4). We have chosen two typical load regimes: the uniformly distributed constant load and the point Dirac delta load. Several simulations have been conducted in each case

1. for different values of the volume V;

2. for different values of h–;

3. for different values of the power s.

For the uniform distributed constant vertical load F, numerical results appear in Figures 1, 2, and 3 , for the varying volume, varying h– and different powers s, respectively.



For the point Dirac delta load situated in the middle point of the beam, numerical optimal profiles, for the same three above situations, appear in Figures 4, 5, and 6 .



6 Acknowledgements

This work is part of the project BFM2001-0738 (Spain).

[10] Muñoz, J., (submitted).

Received: 2/V/02.

#550/02.

  • [1] Barnes, D.C., Extremal problems for eigenvalues functionals, SIAM J. Math. Anal., 19 (1988), 1151-1161.
  • [2] Bellido, J.C. and Pedregal, P., Optimal design via variational principles: the one-dimensional case, J. Math. Pures Appl., 80 (2001), 245-261.
  • [3] Bonnetier, E. and Conca, C., Relaxation totale d'un problčme d'optimisation de plaques, CRAS Paris, 317 (1993), 931-936.
  • [4] Bonnetier, E. and Conca, C., Approximation of Young measures by functions and application to a problem of optimal design for plates with variable thickness, Proc. Roy. Soc. Edin., A, 124 (1994), 399-422.
  • [5] Bonnetier, E. and Vogelius, M., Relaxation of a compliance functional for a plate optimization problem, Applications of Multiple Scaling in Mechanics, (P.G. Ciarlet and E. Sánchez-Palencia, eds.), Masson, 31-53, (1987).
  • [6] Bratus, A.S. and Posvyanskii, V.P., The optimum shape of a bending beam, J. Appl. Maths. Mechs., 64 (2000), 993-1004.
  • [7] Cox, S. and Overton, M., On the optimal design of columns against buckling, SIAM J. Math. Anal., 23 (1992), 287-325.
  • [8] Dacorogna, B., Direct methods in the Calculus of Variations, Springer, (1989).
  • [9] Kohn, R.V. and Vogelius, M., Thin plates with varying thickness, and their relation to structural optimization, Homogenization and Effective Moduli of Materials and Media, IMA Volumes 1, (Ericksen, J., Kinderlehrer, D., Kohn, R., Lions, J.L., eds), Springer-Verlag, 126-149, (1986).
  • [11] Muńoz, J. and Pedregal, P., On the relaxation of an optimal design problem for plates, Asympt. Anal., 16 2 (1996), 125-140.
  • [12] Pedregal, P., Optimal design and constrained quasiconvexity, SIAM J. Math. Anal., 32 (2000), 854-869.
  • [13] Pedregal, P., Parametrized Measures and Variational Principles, Birkhäuser, Basel, (1997).
  • Publication Dates

    • Publication in this collection
      19 July 2004
    • Date of issue
      2003

    History

    • Received
      02 May 2002
    Sociedade Brasileira de Matemática Aplicada e Computacional Sociedade Brasileira de Matemática Aplicada e Computacional - SBMAC, Rua Maestro João Seppe, nº. 900 , 16º. andar - Sala 163, 13561-120 São Carlos - SP Brasil, Tel./Fax: 55 16 3412-9752 - São Carlos - SP - Brazil
    E-mail: sbmac@sbmac.org.br