Abstract
This paper is concerned with the growth-driven shape-programming problem, which involves determining a growth tensor that can produce a deformation on a hyperelastic body reaching a given target shape. We consider the two cases of globally compatible growth, where the growth tensor is a deformation gradient over the undeformed domain, and the incompatible one, which discards such hypothesis. We formulate the problem within the framework of optimal control theory in hyperelasticity. The Hausdorff distance is used to quantify dissimilarities between shapes; the complexity of the actuation is incorporated in the cost functional as well. Boundary conditions and external loads are allowed in the state law, thus extending previous works where the stress-free hypothesis turns out to be essential. A rigorous mathematical analysis is then carried out to prove the well-posedness of the problem. The numerical approximation is performed using gradient-based optimisation algorithms. Our main goal in this part is to show the possibility to apply inverse techniques for the numerical approximation of this problem, which allows us to address more generic situations than those covered by analytical approaches. Several numerical experiments for beam-like and shell-type geometries illustrate the performance of the proposed numerical scheme.
Keywords: Soft robotics, Differential growth, Hyperelasticity, Shape-programming, Optimal control, Numerical simulation methods
Introduction
Soft robotics is a biologically-inspired groundbreaking technology that aims to mimic mechanical deformations, which take place in humans, animals, or plants, through actuated soft materials: dielectric elastomers or magneto-active polymers, for instance. Several actuation mechanisms, such as fluidic, heat, electric, or magnetic, may be used to control these materials [1]. The range of potential applications of this new generation of robots includes, among many others, medical assistance and ocean exploration [2, 3].
In addition to the development of new manufacturing technologies, mathematical modelling, analysis, and numerical simulation are tools of paramount importance to speed up progress in this field. Being composed of soft matter, nonlinear continuum mechanics is the appropriate physical theory to model the kinematics and dynamics of these materials. However, the mathematical control theory of hyperelastic materials is scarce. Indeed, the first mathematically rigorous study for control problems in the hyperelasticity setting appears to be [4]. More recently, several papers have addressed the control of soft materials from the viewpoints of mathematical analysis and numerical simulation [5–9]. See also [10] for a recent survey.
Growth is another biological process susceptible to being mimicked by artificial soft materials. As a matter of fact, [11] reports on a class of soft pneumatic robots whose movements are driven by growth. As for the mathematical modelling of growth, A. Goriley provides, in his seminal book [12], the required ingredients. Doubtless, the topic of mathematical analysis and numerical simulation of growth control is in its infancy, insofar as the mathematical analysis of soft materials actuated by growth is missing in the literature, and only a few works have addressed the numerical simulation counterpart. In this regard, it is worth mentioning [13, 14]. Both papers tackle the so-called shape-morphing problem, where the goal is to find the growth tensor that can produce the deformation of a given soft continuum to a desired shape. The paper [13] copes with the complexity of the activation as well, and provides explicit solutions in the case of affine shape changes. In a complementary manner, [14] focuses on the case of shells and also finds analytical solutions under the stress-free assumption.
Fostered by [13, 14], this paper sets up the shape-morphing problem within the framework of optimal control theory. Indeed, the control variable is the growth tensor. We consider both cases in which the growth tensor is globally compatible, meaning that it is a deformation gradient over the undeformed domain, and the incompatible one, where it is no longer a gradient. From the viewpoint of mathematical modelling, the former case is expressed as the composition of two mechanical deformations: one of them accounts for growth and the other one incorporates boundary conditions and other possible effects like external loads. The latter case relies on the theory of Morphoelasticity, where a local elastic tensor restores the compatibility that is lost by the growth tensor. The state variable is the deformation of the actuated soft continuum. As usual in hyperelasticity theory, that deformation is a minimiser of a polyconvex energy functional. The cost function uses the Hausdorff distance to account for dissimilarities between the desired shape and the final configuration. It also includes a term to deal with the complexity of the activation. In our work, we do not neeed the stress-free hypothesis of [14].
The outline of this paper is as follows. Section 2 contains the modelling details. Section 3 performs a rigorous mathematical analysis of the shape-programming problem in the globally compatible case, which is more involved analytically than the incompatible one. More precisely, firstly, we prove that, for a given growth tensor, there exist minimisers of the underlying energy functional. Secondly, we establish the existence of solutions for the optimal control problem. We rely on the Direct Method of Calculus of Variations in both cases. Section 4 straightforwardly extends these existence results to the incompatible case. Eventually, Sect. 5 addresses the numerical approximation of the shape-programming problem. Our purpose here is to show how inverse techniques may be used for the numerical resolution of this problem, thus addressing more generic situations than those covered by analytical approaches. We adopt a pragmatic point of view in this part as we are not concerned about the compatible or incompatible nature of the growth tensor; in practise, this amounts to accept the incompatibility and, hence, the study lies in the theory of Morphoelasticity. Likewise, we take the right Cauchy–Green deformation tensor as the main variable since, by a suitable parametrisation, it highly simplifies the numerical approximation of the problem. We also derive explicit formulae for the gradients of the functional involved, and transfer those to cutting-edge optimization algorithms that use gradients, in particular, the interior-point method, to obtain the desired solutions. Several numerical examples for beam-like and shell-type applications, as well as a problem converting a square into a circular geometry, illustrate the performance of the proposed numerical scheme.
Problem Setting
Modelling Differential Growth in Nonlinear Elasticity
Let , , be an open, bounded and connected domain which represents the reference (or undeformed) configuration of an elastic and soft body. If experiences a growth effect (as happens in plants or in human tissues, for instance), then it changes its size or shape.
There are two ways to understand and model this phenomenon. In the first, we postulate that there is an underlying deformation that produces the growth. Let us then denote by the deformation mapping induced by this phenomenon, and by the deformed body once growth has taken place. It is assumed that is a Sobolev map. Although driven by growth, is still assumed to be a mechanical deformation, hence it satisfies the properties required to any such deformation; in particular, it preserves the orientation and does not interpenetrate [15]. Let us denote by the deformation gradient tensor associated with , i.e., , where is the material gradient operator with respect to . The orientation-preserving condition is modeled with the constraint
| 2.1 |
while the non-interpenetration is modelled by imposing that is injective almost everywhere (hereafter abbreviated to a.e.), so that the restriction of to the complement of a set of measure zero is injective [16].
For the second possibility, and according to the general modelling of growth and morphoelasticity in [12], the postulate that there is an underlying deformation responsible for growth is discarded, so the tensor is not assumed to come from any deformation, though still (2.1) is retained.
Since the first alternative is more involved analytically, we will keep our general discussion (this section and Sect. 3) in that context, and defer some comments on the second one (Sect. 4), once the main analysis has been performed. Even so, numerical experiments in Sect. 5 are explored in the morphoelasticity scenario.
Since is an elastic and soft material, it has an internal elastic energy, which is able to induce a new deformation on the body . For this initial exposition of the problem, we can think that is Lipschitz, but this assumption is not necessary in the analysis. Although, in principle, the elastic energy might depend on the configuration and the growth deformation , this is not the case in the current context, since represents a growth that does not change the elastic properties of the material. Thus, we assume that the constitutive parameters of the body occupying and are the same. This assumption requires additionally that the body is homogeneous, i.e., its mechanical properties are the same at each point. This is modeled through an energy function that does not depend explicitly on material points and is the same for both configurations and , regardless of the growth deformation . This stored energy function is denoted by , where designates the set of square matrices with strictly positive determinant. The precise assumptions on will be listed in Sect. 2.3.
As is well known, equilibrium configurations are minimisers of the functional
| 2.2 |
(to which one may add external forces) over a suitable class of admissible deformations to be specified later. Here is the deformation gradient of the elastic deformation . The variables in have been denoted by , while the variables in by , so that .
Taking into consideration both growth and elastic deformation, the total deformation of the body is expressed as the composition of both mappings, i.e., . Accordingly, the deformation gradient tensor associated with is given by
| 2.3 |
where is the deformation gradient of .
The three maps involved, , and , are assumed to be orientation-preserving and injective a.e. (see Fig. 1 for a graphical representation).
Fig. 1.

The mapping between reference and deformed configurations is expressed as the composition of the growth deformation and the elastic deformation
By (2.1) and the fact that is injective a.e., the change of variables allows rewriting (2.2) in the undeformed configuration as
| 2.4 |
where
| 2.5 |
Note that the tensor breaks the symmetries of . Indeed, if has a symmetry group (for example, it is isotropic), then does not, in general.
Boundary conditions will be imposed in , but not in or independently. We will assume that the boundary of is Lipschitz and is decomposed into two disjoint parts: and , with of positive -dimensional area. On the Dirichlet part , it is imposed for a given deformation , while on we prescribe the Piola–Kirchhoff stress vector . The latter is not explicitly stated in the admissible set but it is automatically satisfied for minimisers when the surface energy term
| 2.6 |
is added to the total energy. The cases or are not excluded. In fact, volume forces can also be added, whose simplest form is linear:
| 2.7 |
In view of (2.4), the total energy is
| 2.8 |
Other boundary conditions are also possible (see, e.g., [17, Ch. 5]), as well as more general external forces.
Finally, we fix an exponent related to the growth at infinity of the function (see Sect. 2.3 for details) and define the class of admissible deformations in (2.8) as
where is the notation for the Sobolev space. Naturally, we suppose that is not empty and that is not identically infinity in , which amounts to assuming that and .
Setting of the Shape-Programming Problem
Having in mind potential applications in soft robotics, the so-called shape-programming problem [14] amounts to finding the growth tensor field in the initial configuration such that the final configuration is as close as possible to a desired target configuration . Besides reaching this goal, and in order to facilitate its implementation in a possible soft robot, the computed growth tensor field should be as simple as possible.
Inspired by [13], a general form of a complexity functional should have a regularisation term (typically, a squared gradient of ) plus a term penalising the difference between the actual and the target ; such target may well be the identity. These two ingredients should give rise to a simple growth tensor; indeed, the regularising term avoids oscillations, while the penalising term makes similar to , which is chosen to be simple, too. In Sect. 2.4 we will describe some possibilities of complexity functions, but for the moment we can think of the functional
for , and develop the mathematical theory for general functionals of the form
for a certain appropriate density . Here above, the norm of a second-order tensor is defined by . Similarly is defined the norm of vectors and third-order tensors.
We will see in Sect. 3 that, in order to prove existence of minimisers of (2.8), one needs that be in and that is bounded away from zero. These facts are in agreement with the requirement that is easily reachable. The most general way of expressing these assumptions is to fix a compact set and impose that
Two relevant examples of the set K are
for some , and
for some . In addition, one may want to model the growth given by as incompressible; in this case, relevant sets K are
and
Concerning the goal that the final configuration is as close as possible to a desired one, there are several options as for the distance between shapes. The simplest, but least realistic, is to consider an distance between the actual and a target deformation; the disadvantage of this choice is that, in general, a distance between deformations is only vaguely related to a distance between shapes. Introduced by [18] and analysed in [8], we consider instead the Hausdorff distance between the image domain and the target set as an adequate way of measuring distances between those sets. As in those works, we use in fact the following smooth approximation of the Hausdorff distance. Let be the image domain and the target domain. We fix three exponents and a continuous and strictly decreasing function . We define
(where is the volume of the set A), so that an approximation of the Hausdorff distance is
| 2.9 |
Putting all things together, the formulation of the shape-programming problem is:
| 2.10 |
Choice of the Energy Density
The classical assumptions in nonlinear elasticity for the energy function are polyconvexity and coercivity [17, 19, 20]. To be precise, we will assume the following conditions for :
- is polyconvex, i.e., there exists a convex function such that
If , the dependence on can be dispensed with.2.11 - There exist exponents and with , and a constant such that
as .
- For every compact there exists such that for all and we have
Of course, denotes the cofactor matrix. Conditions (W1)–(W3) are standard [19, 21]. Condition (W2), in fact, implies that any with satisfies and, thanks to a well-known inequality [21, Eq. (1.4)], . Condition (W4) is not standard, but a similar assumption has been used, e.g., in [22]. In the following lemma we show sufficient conditions for the fulfillment of (W4).
Lemma 2.1
The following statements hold:
- Let be such that there exists for which
Then satisfies condition (W4). - For , let and . Assume that there exists such that for all and ,
and
Let . Then the function
satisfies condition (W4) whenever . - For , let . Assume that there exists such that for all ,
If are monotone increasing, and , then the function2.12
satisfies condition (W4) whenever . - Let . Then the function
satisfies condition (W4).2.13
Proof
Part (a). Let be compact. Let and . Then
Part (b). For any ,
and, analogously,
Therefore,
If then
while if then
so satisfies the assumptions of part (a).
Part (c). We define for ,
and . Then, for we have
Thus, and m satisfy the assumptions of part (b).
Part (d). Define
where is chosen so that . Then,
An analogous bound holds for .
As for , it is easy to check that there exist such that
We argue by cases so as to show inequality (2.12) for . If ,
If and ,
If ,
If and ,
If and ,
If and ,
If and ,
If and ,
If ,
We have thus shown that and m satisfy the assumptions of part (c).
Condition (a) of Lemma 2.1 appears in [22, Rk. 2.3]. It turns out that there are many useful examples of energy densities satisfying (W1)–(W4) that are widely used in nonlinear elasticity (see, e.g., [17, 19]). For example, condition (W1) is fulfilled when assumption (c) in Lemma 2.1 holds with convex, while conditions (W2)–(W3) are, in general, easy to verify.
The numerical simulations of Sect. 5 will use the Mooney–Rivlin material in (2.13) when . In this section we have shown that this satisfies conditions (W1) and (W4). Condition (W3), on the other hand, is clear, while condition (W2) is easily seen to hold for the exponents .
Choices of Complexity Functionals
The work [13] introduces some examples of complexity functionals in the context of different active materials. In the presence of isotropy, their functionals are based on the right Cauchy–Green deformation tensor associated with growth. However, we have found several advantages to treat , as opposed to as the main variable. Indeed, dealing with involves the use of the so-called intrinsic elasticity [23, Sect. 4.2] and needs to incorporate the constraint that is a metric tensor, which is difficult to handle.
One of the examples presented in [13] is
| 2.14 |
with a given target and weighting parameters. Although not explicitly mentioned in [13], similar in spirit is the functional
| 2.15 |
with , in which the penalizing term only accounts for the dissimilarity of from in shape but not in volume. Since in our context, we have decided to work with as the main variable, the counterparts of and are
and
respectively, for a given target , which in satisfies . Here SO(N) denotes the set of (proper) rotations, and the distance between a matrix a set of matrices, i.e., the minimum distance between the matrix and any element of the set of matrices. Note that in we wrote instead of to guarantee frame-indifference and isotropy. Analogously for .
A final comment refers to the regularising term with integrand that is to be used in any complexity functional involved. As a matter of fact, from a practical point of view, it may be advantageous to substitute it by a standard regularising Helmholtz filter of the form
| 2.16 |
Here acts as a length-scale parameter controlling the amplitude of the regularisation, denotes the Laplacian operator, and stands for the outer unit normal vector to . In this case, we replace the term
by the -norm of . Note that the operation enjoys much better analytical properties than : the former is a compact operation with nice properties even from the approximation perspective, while the latter is not even continuous. In addition, as just remarked, parameter l can be directly associated with the length-scale of the regularization, a feature that is very convenient form the practical viewpoint. At any rate, this filter has performed quite well in the simulations below. In fact, a different version of the Helmholtz filter more suitable for the implementation will be finally adopted in the numerical simulations. We will explain later how to adapt the proof of existence to these cases.
Mathematical Analysis
This section aims at providing a rigorous mathematical analysis of the shape programming problem (2.10). We shall proceed in two steps. We will first prove that for a given growth tensor , there exist minimisers of (2.8). Then, existence of solutions for (2.10) is established.
The following lemma is an easy consequence of formula
Lemma 3.1
Let be compact. Then there exist compact sets and such that for all we have and . Moreover, if is a sequence in such that
then
| 3.1 |
and
| 3.2 |
The following lower semicontinuity result will help in the final steps of the main proof. Recall that for each measurable , the function is defined as in (2.5).
Lemma 3.2
Let satisfy conditions (W1)–(W3) of Sect. 2.3. Let be a sequence in such that
Let be compact and let be a sequence in such that
Then
Proof
Lemma 3.1 yields convegences (3.1) and (3.2). By a standard fact on the product of two sequences, one factor converging weakly in and the other one a.e. with and bound (see, e.g., [24, Prop. 2.61]), we obtain thanks to Lemma 3.1 that
To sum up, we have the convergences
as well as a.e. with and bound, which allows us to apply a standard lower semicontinuity result for polyconvex functions (see, e.g., [25, Th. 5.4] or [24, Cor. 7.9]) and conclude that
This proves the result.
Existence of Given
Before presenting the existence theorems, we recall a property stating that the limit of injective a.e. functions is injective a.e.
Proposition 3.3
Let and . For each , let satisfy a.e., in and the sequence is bounded in . Assume that , is injective a.e. with a.e. for each , and a.e. Then is injective a.e.
Proof
Since and , by [21, Th. 3.2] (see also [16, Prop. 3]), the surface energy defined in [16, Def. 2] satisfies for each . The fact that is injective a.e. for each lets us conclude ( [16, Th. 2]) that is injective a.e.
The following fundamental existence theorem in nonlinear elasticity will be used throughout. Its proof is the sum of deep and fundamental results in Analysis that are indicated below.
Theorem 3.4
Assume that satisfies the following conditions:
W is -measurable, where denotes the Lebesgue -algebra in , and stands for the Borel -algebra in .
is polyconvex for a.e. .
- There exist exponents and with , and a constant such that
as , for a.e. .
Assume that is an -rectifiable subset of of positive -dimensional measure and that is measurable. Let and .
Let the functional
be defined in . Assume that and that I is not identically infinity in . Then there exists a minimiser of I in .
Proof
The treatment of the linear terms (2.6) and (2.7) is standard (e.g., [19, Sect. 7] or [17, Ch. 5]), so we can assume and .
Since and I is not identically infinity in , there exists a minimising sequence of I in . Thus, is bounded and, by condition (c), we have that is bounded in and is bounded in . Poincaré’s inequality shows that is bounded in . Since , there exist and a subsequence (not relabelled) such that in . The continuity of traces shows that satisfies the boundary condition. By [21, Lemma 4.1],
for any compact , as . By the lower semicontinuity of polyconvex functionals (see, e.g., [25, Th. 5.4]),
Since this is true for all compact , by monotone convergence, we obtain
Now we show that a.e. Since in and a.e. for all , we have that a.e. Let A be the set of such that . We have that a.e. in A. If , by Fatou’s lemma and (d),
which is a contradiction. Therefore, and a.e. By Proposition 3.3, is injective a.e. Therefore, , and it is a minimiser of I in .
Note that the integrability assumptions on and can be weakened; see, e.g., [19, Sect. 7] or [17, Ch. 5].
In the following result we show how the properties of are transferred to .
Lemma 3.5
Let satisfy conditions (W1)–(W3) of Sect. 2.3. Let be measurable. Then:
is -measurable.
is polyconvex for all .
- Let be compact. Then there exists (depending on K but not on ) such that for any ,
as , for a.e. .
Proof
We start by proving (a). As is measurable, there exists a Borel function such that a.e. Then the function is Borel in and the function is Borel in . As is polyconvex, it is locally Lipschitz in the open set (see, e.g., [20, Th. 5.3(iv)]), hence Borel in . Thus, the function is Borel in , and so is the function . Therefore, the function is -measurable.
Now we show (b). By definition of polyconvexity, there exists a convex function
such that (2.11) holds, so
Fix . Since e is convex, so is the function given by
as a composition of a linear map with a convex function. Therefore, the function is polyconvex.
As for (c), by Lemma 3.1 and using elementary properties of the algebra of square matrices, for a.e. ,
Therefore, there exists such that
which implies (c).
Property (d) is immediate.
The existence of minimisers of (2.8) for each given, feasible is now a straightforward consequence of Theorem 3.4 and Lemma 3.5.
Theorem 3.6
Let satisfy conditions (W1)–(W3) of Sect. 2.3. Let be compact and . Assume that is an -rectifiable subset of of positive -dimensional measure and that is measurable. Let and . Assume that and that is not identically infinity in . Then there exists a minimiser of in .
An important issue, which we overlook here, is the potential non-uniqueness of minimiser for given . A much more delicate analysis would be required to deal with potential bifurcation problems as the tensor moves in the iterative, approximation procedure implemented in Sect. 5 seeking an optimal . However, if one sticks to a selected continuous branch of solutions, one would end up with an optimal tensor . We have to report no difficulties here in the numerical approximations performed.
Existence of Optimal
The lower semicontinuity of the function , as given by (2.9), was shown in [8]. Although the framework here is somewhat different, the same proof is valid. For the convenience of the reader, we state in a precise way the result inside the proof of [8, Th. 4.2] that will be used in Theorem 3.9 below.
Proposition 3.7
Let be a sequence in such that
and is injective a.e., for each . Assume that there exists , with a.e., such that
Then
The following result is an easy consequence of (W4).
Lemma 3.8
Let satisfy condition (W4) of Sect. 2.3. Let be compact. Let and . Let . If for some then for all .
Proof
Let , and . Condition (W4) and the fact imply that
| 3.3 |
for some constant . Similarly,
for some constants . The conclusion readily follows.
Our main result is concerned with the existence of an optimal .
Theorem 3.9
Let satisfy conditions (W1)–(W4) of Sect. 2.3. Let be compact. Let and . Let satisfy:
is -measurable.
is lower semicontinuous for a.e. .
Assume that . Let . Define
in
Assume that and that is not identically infinity in . Then there exists a minimiser of in .
Proof
We will rely on the Direct Method of Calculus of Variations. Let be a minimising sequence of in . The coercivity of with respect to and the fact that is bounded in implies that is bounded in . Thus, we can extract a subsequence (not relabelled) such that in and in and a.e., for some . Since K is closed, we see that for a.e. . Thanks to (b), for a.e. ,
and so, by Fatou’s lemma,
By the weak convergence in ,
In addition, we ought to check that .
Let us check that is the gradient of an a.e. injective map. To this aim, we use that for each we have for some Sobolev map that is injective a.e. Without loss of generality, we can assume that
As , we have that . By the Poincaré–Wirtinger inequality,
Therefore, the sequence is bounded in , so we can extract a subsequence weakly convergent in to some . Moreover, we can assume that the convergence also holds a.e. As in , we have that . Let us see that is injective. For this, we can apply Proposition 3.3, according to which it is enough to show that
with a.e. Those conditions are satisfied because of the convergence in and the Sobolev embeddings. Indeed, because the embedding is valid for . In fact, for , so and . Likewise, for some constants ,
so . Convergence was shown earlier. Now, for some , since a.e. On the other hand, for the compact embedding holds for , so in and, hence, in for all . This implies the last condition since .
Another main step should focus on the first contribution to the cost given in terms of the Hausdorff distance , as well as the minimising relationship between and in (2.10) and (2.8). To treat this step, it is mandatory to work with the minimiser of (2.8) corresponding to , for each .
Take such that . By minimality,
| 3.4 |
By Lemma 3.5(c),
| 3.5 |
for some . On the other hand, using (3.3), we find that
| 3.6 |
for some . This inequality, together with (3.4) and (3.5) shows that is bounded in and is bounded in .
As in the proof of Theorem 3.4, we obtain the existence of a such that in , together with
By Lemma 3.2,
| 3.7 |
On the other hand, using dominated convergence, bound (3.6) and Lemma 3.8, we find that
| 3.8 |
Putting together (3.4), (3.7) and (3.8) we conclude that
and the arbitrariness of in implies that is a minimiser of (2.8) in for our limit .
The final ingredient is provided by Proposition 3.7. Indeed, its assumptions have already been checked, so
Altogether, we see that
and the proof is finished.
Remark 3.10
The same conclusion of Theorem 3.9 holds if we replace the term with the term ; see (2.16) and note that is given. In this case the new functional is
We explain the only steps of the proof that differ from that of Theorem 3.9. Let be a minimising sequence of in . Then is bounded in , so there exists such that, for a subsequence, in . Let be the solution of (2.16) with right-hand side , and the solution with right-hand side . By standard elliptic regularity theory (see, e.g., [26, Prop. 9.26]), in , and, hence, in . From here, the rest of the proof is identical to that of Theorem 3.9.
The Theory of Morphoelasticity
Our main source in this section is the book [12]. The basic principle of morphoelasticity postulates a multiplicative decomposition of the deformation gradient in the form
| 4.1 |
This decomposition replaces (2.3), the main difference being that there is no intermediate mappings and to account for growth and elastic deformation, respectively: tensors and are not associated with any deformation. “The growth tensor takes the initial configuration to a virtual stress-free state that may be incompatible. Then, a local elastic tensor restores compatibility of the body and enforces the boundary conditions and body forces so that the body is in a compatible configuration in mechanical equilibrium” ([12, p. 355]). Yet, the elastic constitutive law is formulated through an internal energy density that depends only on the elastic deformation tensor , i.e., (2.4) and (2.5) are still valid, with . The rest of Sect. 2.1 is also valid word by word.
The idea of a decomposition of the form (4.1) in Mechanics can be traced back to the mid of the last century and first appeared in the contexts of anelasticity, placticity, dislocations, thermoelasticity and, more recently, biomechanics and growth mechanics. A survey of the history of this decomposition can be found in [27]. In fact, the recent papers [28, 29] explore when “virtual, incompatible” state actually exists as a global intermediate configuration.
Since our preceding analysis does not rely in any way on the fact that growth tensor comes from a gradient, i.e., is globally compatible, all of our previous results and discussions are correct in this new setting as well. In particular, the shape programming problem is formally the same as (2.10):
| 4.2 |
Notice that the only difference with the gradient case is the non-occurrence of the constraint that must be the gradient of an a.e. injective Sobolev map, so the proof of the existence result in this case would be shorter and less technical than that of Theorem 3.9. For record purposes, we state the main existence theorem in this setting.
Theorem 4.1
Let satisfy conditions (W1)–(W4) of Sect. 2.3. Let be compact. Let and . Let satisfy:
is -measurable.
is lower semicontinuous for a.e. .
Assume that . Let . Define
in
Assume that and that is not identically infinity in . Then there exists a minimiser of in .
Remark 4.2
According to (2.16) and Remarks 3.10, the same conclusion of Theorem holds if we replace the term with the term for a given . In other words, the same result holds for the functional
We anticipated in Sect. 2.4 that by isotropy one can work with , instead of as the main variable. In Sects. 2 and 3 we opted for so as not to deal with the constraint that is a metric tensor, but in the context of this section, the theory of morphoelasticity only requires that is a field of positive definite symmetric matrices. Let us see why isotropy allows working with . Recall from Sect. 2.1 that the stored energy function of the material is and that, once the growth takes place, the total energy of the deformation is given by the integral (2.4), where the new stored-energy function is given by (2.5). Now, if a growth tensor changes to for some , then, using (2.5) and the isotropy of , we find that
Thus, by polar decomposition, the dependence of on is only through . Likewise, the cost functional should be isotropic (as well as frame-indifferent). The required conditions for that were written in [13, Sect. 2(a)]. In the particular case of functionals of the form
(as in Theorem 4.3 below), the condition for is
| 4.3 |
for a.e. , all symmetric definite positive and all .
Since this is the framework of the numerical experiments in the next section, we present the programming problem in the language of (4.2):
| 4.4 |
In this case, can take the form (2.14), (2.15) or the general form given in the following theorem, which we present without proof.
Theorem 4.3
Let be isotropic and satisfy conditions (W1)–(W4) of Sect. 2.3. Let K be a compact subset of symmetric positive definite matrices. Let and . Let satisfy (a)–(b) of Theorem 4.1 as well as (4.3). For each , let be its symmetric positive definite square root. Assume that . Let . Define
in
Assume that and that is not identically infinity in . Then there exists a minimiser of in .
In the above theorem we have taken as the only symmetric positive definite square root of , but, as explained earlier, any square root of gives rise to the same problem. Indeed, if for some .
Numerical Simulation
This section presents the numerical simulations of the shape-programmig problem analyzed in the previous sections, all done in dimension . As noticed in [13] and explained in Sect. 4, under the presence of isotropy it is more convenient to implement numerically the growth-driven actuation by means of the right Cauchy–Green strain tensor . Indeed, this choice of the control variable introduces less nonlinearity into the formulation of the problem, which facilitates its numerical approximation. Moreover, in this section we use the theory of morphoelasticity, so it is not relevant in practise whether or not the growth tensor is a deformation gradient. All in all, this section addresses the numerical resolution of the shape-programming problem (4.4).
The layout of this section is as follows. In Sect. 5.1, after parametrising in terms of its eigenvalues and eigenvectors, we find an equivalent formulation of (4.2), which is more amenable to computing the gradients that are required in gradient-based optimisation algorithms. We also present the numerical scheme. In Sect. 5.2 we perform several numerical experiments. A set of experiments deals with an initial geometry resembling a beam and another set resembling a shell. For these experiments it is enough to control the eigenvalues of the tensor , while keeping the eigenvectors fixed. In the final example we show that, when the initial configuration is a cube and the final configuration is a cylinder, it is necessary to consider both eigenvalues and eigenvectors as design variables to achieve a satisfactory match between the final and the target configurations.
To accomodate the notation to that widely used in Computational Mechanics, from now on in this section, we denote by and by .
Numerical Resolution Method
Parametrisation of the Growth Tensor
Consider the following version of the Mooney–Rivlin density energy presented in (2.13):
This energy is isotropic, so it is valid to work with instead of . The actuated energy density , equivalent to in (2.5), adopts the expression
| 5.1 |
The eigenvalue decomposition of is given by
where the ortonormal eigenvectors are encapsulated in the columns of , i.e., , whilst encodes the eigenvalues of . Thus, is rewritten as
| 5.2 |
Positive definiteness of entails positivity of the eigenvalues . Moreover, in some applications one may wish to impose incompressibility in , which is modelled by condition and is equivalent to a restriction only on , namely, . This can be accomplished, for instance, by parametrising as
although we have not included any experiment in this context.
It remains to define the eigenvectors . A possibility for that is to define the matrix by using the Rodrigues formula, according to which is parametrised in terms of a unitary vector , and a rotation angle around as
| 5.3 |
where is the third-order alternating tensor (or Levi–Civita tensor), and is defined through a spherical parametrisation as
| 5.4 |
introducing the above parametrisation (5.4) into (5.3) yields
| 5.5 |
An Equivalent Formulation of the Optimisation Problem
This new set of design variables, and , allows us to consider the new optimisation problem
| 5.6 |
where, in analogy to (2.16), the fields
are regularised versions of and , respectively. More precisely, for , the functions and are in
and are the solutions of the boundary value problems
| 5.7 |
where l is a length-scale parameter and is the normal to .
Note that in (5.6) we have not included the compexity functional described in Sect. 2.4, although it can easily be incorporated. In any case, problem (5.6) fits in the theory of Theorem 4.3, just by putting , while the regularisation term based on the norm of is replaced by the regularisations and .
In addition, to account for the complexity of the actuation, we impose lower and upper pointwise bounds on , namely , , rather than an -norm constraint. Indeed, those pointwise contraints are more effectively handled by constrained optimisation methods as they prevent from tuning the weighting parameters that appear in the complexity functional. Similarly, the angles are confined in suitable predefined intervals. Due to the maximum principle, the regularised variables and satisfy the same bounds.
We present the existence result for (5.6).
Proposition 5.1
Let and be non-empty compact and convex sets. Then there exists a solution for Problem (5.6) under the bounds and .
Proof
Let be a minimizing sequence. As and are compact, the sequence is bounded in and, hence, in for all . Therefore, there exists such that, for a subsequence, in . As and are compact and convex, we get that and . Let be the solution of the corresponding problems (5.7) for right-hand side , and analogously for . By elliptic regularity theory, in and, hence, in . For , let be the vectors (5.5) corresponding to the angles , and analogously for . Choosing , we can apply the result [30, Th. 3.1] on composition operators to conclude that in . The same result also implies in and in , where are the components of and analogously for . By (5.2), in . The rest of the proof is identical to that of Theorems 3.9, 4.1 and 4.3.
Computation of Continuous Gradients
As is customary in gradient-based optimisation, in order to compute a descent direction, we use the standard Lagrangian method [31]. To this end, let us consider the Lagrangian defined as
| 5.8 |
which is defined for and satisfying the boundary condition in . For the strain energy in (5.1), the first Piola–Kirchhoff stress tensor is
| 5.9 |
where , for , , and represents the components of the third-order alternating tensor. Notice that are considered as independent variables in (5.8). The stationary condition of (5.8) with respect to
| 5.10 |
yields indeed the stationary point of the functional in (2.8), namely the weak form of the traslational equilibrium, since
| 5.11 |
Equation (5.10) with expression (5.11) is nonlinear. A consistent linearisation of (5.11) has been carried out by means of the standard Newton–Raphson method in order to obtain the deformed configuration . Similarly, the stationary condition of the Lagrangian with respect to yields
| 5.12 |
where represents the fourth order elasticity tensor, defined as
which takes the form
being
and
for and . From the linear equation in (5.12) it is therefore possible to obtain the adjoint state .
The directional derivative of the Lagrangian with respect to the design variables and yields
which, for the specific expression for in (5.9), takes the following form
where the second order tensor is defined as
| 5.13 |
Numerical Scheme
In order to clarify how the different equations featured in the current section have been embedded into a gradient algorithm, we summarise the steps involved in the optimisation.
Starting from an initial guess we proceed with the loop:
-
(i)
Solve the state equation (5.10) with expression (5.11), which yields the new deformation mapping and the new deformed configuration .
-
(ii)
Based on the new deformation mapping , compute the adjoint state field by means of (5.12).
-
(iii)
Compute the objective function .
-
(iv)
Compute descent directions for each of the design variables, namely and , .
-
(v)
Pass , and , , to the gradient algorithm in order to determine the step size and hence, the new value of the design variables and .
Remark 5.2
Although the lower bound conditions ensuring the positive definiteness of the tensor have not been explicitly included in the Lagrangian in (5.8), any standard gradient-based algorithm such as the interior-point, can easily handle this type of constraint, by augmenting the Lagrangian in (5.8) by means of the method of Lagrange multipliers. Evaluation of this additional term and of its derivatives with respect to the design variables is therefore omitted in the derivations included in this section. In fact, as mentioned in Sect. 5.1.2, pointwise bounds on and , , have been included in the optimisation method.
Numerical Experiments
The objective of this section is to demonstrate the applicability of the proposed formulation in the context of shape morphing, i.e., determining the value of the optimal design variables and following a gradient-based approach with the aim of attaining the closest growth-driven configuration to a given target configuration. As indicated in the introduction, one of the objectives of this paper is to present an alternative formulation to other analytical approaches that make use of simplifying assumptions such as the absence of boundary conditions, which permit to obtain a closed-form solution of the optimal growth tensor [32, 33]. We do not intend to claim that our formulation is more advantageous than others. On the contrary, as in other areas of continuum mechanics, analytical solutions can be extremely useful. Our purpose is to illustrate the possibility to apply inverse techniques for the optimal solution of this problem, which can address more generic situations than those covered by analytical approaches.
With regard to the constitutive model used, we consider the strain energy given by (5.1). In all the examples, the values of are
In the first two examples (Sects. 5.2.1 and 5.2.2), we will advocate for a widely accepted formulation in engineering, according to which the eigenvectors of (see equation (5.2)) remain fixed, while only the eigenvalues serve as the unknown fields to be determined analytically [32, 33]. Although this approach is less flexible compared to the more comprehensive formulation discussed in Sect. 5.1, it has exhibited reasonably positive outcomes in terms of achieving the target configuration. Typically, the eigenvectors of are considered coincident with the tangent vectors associated with the curvilinear coordinate system that describes the geometry of the initial solid configuration.
However, in the final example of Sect. 5.2.3, we will illustrate a scenario where incorporating additionally the eigenvectors as design variables (specifically, the three angular fields in equation (5.5)) allows for a higher degree of flexibility. This enhanced formulation enables a significantly better approximation to the target configuration.
In all the examples, the upper and lower bounds used for the eigenvalues () (see (5.6)) are
With respect to the upper and lower bounds used for (see (5.6)), these are
We have chosen these bounds since in the performed experiments, it is not expected that rotations of more than one loop take place, but of course the above bounds can be expanded if the geometry of the problem suggests so.
Beam-Like Applications
The first examples consider applications where the geometry of the undeformed domain resembles that of a beam. In particular, we consider the rectangular section beam in Fig. 2a and the beam with circular cross-section in Fig. 2b. For both cases, the eigenvectors featuring in the definition of in (5.2) are defined as
for the case in Fig. 2a and
for the case in Fig. 2b. In both cases, the boundary conditions are such that the displacements in are 0 in the three directions of the configuration . Three target configurations, , have been prescribed:
-
(i)Shape morphing configuration 1: rectangular cross-section beam with target configuration given by
5.14 -
(ii)Shape morphing configuration 2: rectangular cross-section beam with target configuration given by
5.15 -
(iii)Shape morphing configuration 3: circular cross-section beam with target configuration given by
with and , and with given by5.16
Fig. 2.

Geometry, finite element mesh and vectors parametrising the growth tensor . a Rectangular section beam, with . b Circular section beam with . In both cases, t is the thickness of the beam
For the case of the rectangular cross-section beam in Fig. 2a, the final configurations attained at convergence are depicted in Fig. 3, corresponding with the optimal solutions that yield the closest growth-driven configurations to the target configurations denoted as shape morphing configurations 1 and 2. In addition, Fig. 4 depicts the evolution of the cost function for the case of the shape morphing configuration 1. The interior-point algorithm has been used as the optimization method.
Fig. 3.
Representation of the computed optimal deformation (indistinguishable from the target configuration) and the contour plot distribution of , for the beam with rectangular section in Fig. 2a for target configurations: a equation (5.14); b equation (5.15). The translucid configuration represents the undeformed configuration
Fig. 4.

Evolution of the objective function with the number of iterations for the target configuration given in Eq. (5.14)
With regard to the circular cross-section beam in Fig. 2b, with target configuration given in Eq. (5.16), the final growth-driven configuration is displayed in Fig. 5, along with the contour plot distribution of the three design variables . The tight agreement with respect to the target configuration initially prescribed in Eq. (5.16) is shown in Fig. 5d.
Fig. 5.
Representation of the computed optimal deformation and contour plot distribution of a , b and c for the example with initial configuration depicted in Fig. 2. The translucid geometry represents the initial configuration. d Agreement between the target configuration (grey colour) and the deformed solid subjected to the optimal growth tensor (red) (Color figure online)
Shell-Type Applications
Next, we consider the two undeformed configurations given in Fig. 6a and the beam with circular cross-section in Fig. 6b. For both cases, the eigenvectors are defined as
In both cases, the boundary conditions are such that the displacements vanish in and (for Fig. 6a) and (for Fig. 6b) in the three directions of the configuration . Two target configurations, , have been prescribed:
-
(i)Shape morphing configuration 4: initial geometry given in Fig. 6a with target configuration given by
-
(ii)Shape morphing configuration 5: initial geometry given in Fig. 6b with target configuration given by
with
in both configurations.
Fig. 6.

Geometry, finite element mesh and vectors parametrising the growth tensor . a Disk with . b Cylinder with
For the case of the initial geometry in Fig. 6a, the final configuration attained can be observed in Fig. 7, corresponding with the optimal solutions that yield the closest growth driven configurations to the target configuration denoted as shape morphing configuration 4. It is worth empashising how the optimal solution is capable of, starting with a flat disk geometry, inducing a deformation of the continuum into the final conical shape illustrated in this figure. From Fig. 7d, the almost perfect match between the growth-driven and target configurations can be observed.
Fig. 7.
Representation of the computed optimal deformation and contour plot distribution of a , b and c for the example with initial configuration depicted in Fig. 6a. The translucid geometry represents the initial configuration. d Agreement between the target configuration (grey meshed domain) and the deformed solid subjected to the optimal growth tensor (red) (Color figure online)
Finally, for the case of the initial geometry in Fig. 6b, the final configuration attained can be observed in Fig. 8. In this case, attaining the target configuration entails a considerable enlargement of the initial geometry along the direction, in addition to a bending in the and directions, yielding the conical shape illustrated in this figure. Figure 8d shows the almost perfect match between the growth-driven and target configurations can be observed.
Fig. 8.
Representation of the computed optimal deformation and contour plot distribution of a , b and c for the example with initial configuration depicted in Fig. 6b. The grey domain represents the initial configuration. d Agreement between the target configuration (grey meshed domain) and the deformed solid subjected to the optimal growth tensor (red) (Color figure online)
Cube to Cylinder Geometry
The objective of this example is to evidence what was anticipated in the introductory part of Sect. 5.2. Specifically, although the examples shown in Sects. 5.2.1 and 5.2.2 have demonstrated that including only eigenvalues as design variables whilst maintaining the eigenvectors fixed throughout the optimisation process can yield extremely good results, this might not be the case for any predefined target configuration. In order to illustrate that, we consider now the initial and target configurations shown in Fig. 9. The problem requires a transformation from a cube into a cylinder, although the pictures are represented in 2D.
Fig. 9.

Undeformed configuration (red), representing a square of side 4. The circular geometry represents the target configuration, with diameter 12 (Color figure online)
We solved the problem using two formulations:
The first formulation involved exclusively the eigenvalues as design variables, whilst holding the eigenvectors fixed throughout the optimisation to , and .
The second formulation considered both and as design variables, the latter used to parametrise the eigenvectors according to (5.5).
Figure 10 includes the results yielded by both formulations. As expected, the deformed configuration resulting from the second formulation (including both and as design variables) yields a significantly better approximation to the unattainable circular target configuration. This is corroborated by the values of the objective function attained by both formulations in the last optimisation iteration, when numerical convergence was observed. Specifically, the ratio between the values yielded by both formulations were
where the value in the numerator refers to the first formulation (only as design variables).
Fig. 10.

a Deformed configuration for the optimal solution yielded by formulation including only as design variables whilst fixing , and ; b Deformed configuration for the optimal solution obtained by the formulation that includes both and as design variables
Finally, Fig. 11 illustrates the optimal solution obtained for the eigenvectors and . This figure demonstrates the necessity to modify spatially these eigenvectors in order to yield the observed higher flexibility.
Fig. 11.

Deformed configuration in the optimal solution obtained by formulation including eigenvalues and angular fields parametrising the eigenvectors. a Representation of the eigenvector , where the colour of the vector is associated with the magnitude of ; b Representation of the eigenvector , where the colour of the vector is associated with the magnitude of
Funding
Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. R. Ortigosa-Martínez, J. Martínez-Frutos and F. Periago have been supported by Grant PID2022-141957OA-C22 funded by MCIN/AEI/10.13039/501100011033, by RDF A way of making Europe, and by the Autonomous Community of the Región of Murcia, Spain, through the programme for the development of scientific and technical research by competitive groups (21996/PI/22), included in the Regional Program for the Promotion of Scientific and Technical Research of Fundación Séneca – Agencia de Ciencia y Tecnología de la Región de Murcia. C. Mora-Corral has been supported by the Agencia Estatal de Investigación of the Spanish Ministry of Research and Innovation, through project PID2021-124195NB-C32 and the Severo Ochoa Programme for Centres of Excellence in R &D CEX2019-000904-S, by the Madrid Government (Comunidad de Madrid, Spain) under the multiannual Agreement with UAM in the line for the Excellence of the University Research Staff in the context of the V PRICIT (Regional Programme of Research and Technological Innovation), and by the ERC Advanced Grant 834728. P. Pedregal has been supported by Grants PID2020-116207GB-I00 and SBPLY/19/180501/000110.
Declarations
Conflict of interest
There is no conflict of interest to declare.
Footnotes
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
References
- 1.Wang J, Chortos A. Control strategies for soft robot systems. Adv. Intell. Syst. 2022;4:2100165. doi: 10.1002/aisy.202100165. [DOI] [Google Scholar]
- 2.Gifari MW, Naghibi H, Stramigioli S, Abayazid M. A review on recent advances in soft surgical robots for endoscopic applications. Int. J. Med. Robot. Comput. Assist. Surg. 2019;15:2010. doi: 10.1002/rcs.2010. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 3.Lashi C, Calisti M. Soft robot reaches the deepest part of the ocean. Nature. 2021;591:35–36. doi: 10.1038/d41586-021-00489-y. [DOI] [PubMed] [Google Scholar]
- 4.Lubkoll L, Schiela A, Weiser M. An optimal control problem in polyconvex hyperelasticity. SIAM J. Control. Optim. 2014;52(3):1403–1422. doi: 10.1137/120876629. [DOI] [Google Scholar]
- 5.Günnel A, Herzog R. Optimal control problems in finite strain elasticity by inner pressure and fiber tension. Front. Appl. Math. Stat. 2016;2:4. doi: 10.3389/fams.2016.00004. [DOI] [Google Scholar]
- 6.Martínez-Frutos J, Ortigosa R, Pedregal P, Periago F. Robust optimal control of stochastic hyperelastic materials. Appl. Math. Model. 2020;88:884–904. doi: 10.1016/j.apm.2020.07.012. [DOI] [Google Scholar]
- 7.Schiela A, Stoecklein M. Optimal control of static contact in finite strain elasticity. ESAIM Control Optim. Calc. Var. 2020;26:95. doi: 10.1051/cocv/2020014. [DOI] [Google Scholar]
- 8.Ortigosa R, Martínez-Frutos J, Mora-Corral C, Pedregal P, Periago F. Optimal control of soft materials using a Hausdorff distance functional. SIAM J. Control. Optim. 2021;59(1):393–416. doi: 10.1137/19M1307299. [DOI] [Google Scholar]
- 9.Ortigosa R, Martínez-Frutos J, Mora-Corral C, Pedregal P, Periago F. Optimal control and design of magnetic field-responsive smart polymer composites. Appl. Math. Model. 2022;103:141–161. doi: 10.1016/j.apm.2021.10.033. [DOI] [Google Scholar]
- 10.Ortigosa R, Martínez-Frutos J, Mora-Corral C, Pedregal P, Periago F. Mathematical modeling, analysis and control in soft robotics: a survey. SEMA J. 2023 doi: 10.1007/s40324-023-00334-4. [DOI] [Google Scholar]
- 11.Hawke EW, Blumenschein LH, Greer JD, Okamura AM. A soft robot that navigates its environment through growth. Sci. Robot. 2017;2:3028. doi: 10.1126/scirobotics.aan3028. [DOI] [PubMed] [Google Scholar]
- 12.Goriely A. The Mathematics and Mechanics of Biological Growth. Interdisciplinary Applied Mathematics. New York: Springer; 2017. p. 646. [Google Scholar]
- 13.Andrini A, Noselli G, Lucantonio A. Optimal shapes of planar shapes with active materials. Proc. R. Soc. A. 2022;478:20220256. doi: 10.1098/rspa.2022.0256. [DOI] [Google Scholar]
- 14.Wang J, Li Z, Jin Z. A theoretical scheme for shape-programming of thin hyperelastic plates through differential growth. Math. Mech. Solids. 2022;27(8):1412–1428. doi: 10.1177/10812865221089694. [DOI] [Google Scholar]
- 15.Ball JM. Global invertibility of Sobolev functions and the interpenetration of matter. Proc. R. Soc. Edinb. Sect. A. 1981;88(3–4):315–328. doi: 10.1017/S030821050002014X. [DOI] [Google Scholar]
- 16.Henao D, Mora-Corral C. Invertibility and weak continuity of the determinant for the modelling of cavitation and fracture in nonlinear elasticity. Arch. Ration. Mech. Anal. 2010;197:619–655. doi: 10.1007/s00205-009-0271-4. [DOI] [Google Scholar]
- 17.Ciarlet PG. Mathematical Elasticity. Studies in Mathematics and its Applications. Amsterdam: North-Holland Publishing Co.; 1988. [Google Scholar]
- 18.Charpiat G, Faugeras O, Keriven R. Approximations of shape metrics and application to shape warping and empirical shape statistics. Found. Comput. Math. 1976;5(1):1–58. doi: 10.1007/s10208-003-0094-x. [DOI] [Google Scholar]
- 19.Ball JM. Convexity conditions and existence theorems in nonlinear elasticity. Arch. Ration. Mech. Anal. 1977;63:337–403. doi: 10.1007/BF00279992. [DOI] [Google Scholar]
- 20.Dacorogna B. Direct Methods in the Calculus of Variations. Applied Mathematical Sciences. 2. New York: Springer; 2008. p. 619. [Google Scholar]
- 21.Müller S, Tang Q, Yan BS. On a new class of elastic deformations not allowing for cavitation. Ann. Inst. H. Poincaré Anal. Non Linéaire. 1994;11(2):217–243. doi: 10.1016/s0294-1449(16)30193-7. [DOI] [Google Scholar]
- 22.Conti S, Dolzmann G. On the theory of relaxation in nonlinear elasticity with constraints on the determinant. Arch. Ration. Mech. Anal. 2015;217(2):413–437. doi: 10.1007/s00205-014-0835-9. [DOI] [Google Scholar]
- 23.Ciarlet PG, Gratie L, Mardare C. Intrinsic methods in elasticity: a mathematical survey. Discret. Contin. Dyn. Syst. 2009;23(1–2):133–164. doi: 10.3934/dcds.2009.23.133. [DOI] [Google Scholar]
- 24.Fonseca I, Leoni G. Modern Methods in the Calculus of Variations: Spaces. Monographs in Mathematics. New York: Springer; 2007. p. 599. [Google Scholar]
- 25.Ball JM, Currie JC, Olver PJ. Null Lagrangians, weak continuity, and variational problems of arbitrary order. J. Funct. Anal. 1981;41(2):135–174. doi: 10.1016/0022-1236(81)90085-9. [DOI] [Google Scholar]
- 26.Brezis H. Functional Analysis. Sobolev Spaces and Partial Differential Equations. New York: Springer; 2011. [Google Scholar]
- 27.Sadik S, Yavari A. On the origins of the idea of the multiplicative decomposition of the deformation gradient. Math. Mech. Solids. 2017;22(4):771–772. doi: 10.1177/1081286515612280. [DOI] [Google Scholar]
- 28.Goodbrake C, Goriely A, Yavari A. The mathematical foundations of anelasticity: existence of smooth global intermediate configurations. Proc. R. Soc. A. 2021;477(2245):20200462–18. doi: 10.1098/rspa.2020.0462. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 29.Yavari A, Sozio F. On the direct and reverse multiplicative decompositions of deformation gradient in nonlinear anisotropic anelasticity. J. Mech. Phys. Solids. 2023;170:105101–13. doi: 10.1016/j.jmps.2022.105101. [DOI] [Google Scholar]
- 30.Valent T. Boundary Value Problems of Finite Elasticity. New York: Springer Tracts in Natural Philosophy. Springer; 1988. [Google Scholar]
- 31.Boyd S, Vandenberghe L. Convex Optimization. Cambridge: Cambridge University Press; 2004. [Google Scholar]
- 32.Li Z, Wang J, Hossain M, Kadapa C. A general theoretical scheme for shape-programming of incompressible hyperelastic shells through differential growth. Int. J. Solids Struct. 2023;265–266:112128. doi: 10.1016/j.ijsolstr.2023.112128. [DOI] [Google Scholar]
- 33.Li Z, Wang Q, Du P, Kadapa C, Hossain M, Wang J. Analytical study on growth-induced axisymmetric deformations and shape-control of circular hyperelastic plates. Int. J. Eng. Sci. 2022;170:103594. doi: 10.1016/j.ijengsci.2021.103594. [DOI] [Google Scholar]




