Polyconvex function
In the calculus of variations, the notion of polyconvexity is a generalization of the notion of convexity for functions defined on spaces of matrices. The notion of polyconvexity was introduced by John M. Ball as a sufficient conditions for proving the existence of energy minimizers in nonlinear elasticity theory.[1] It is satisfied by a large class of hyperelastic stored energy densities, such as Mooney-Rivlin and Ogden materials. The notion of polyconvexity is related to the notions of convexity, quasiconvexity and rank-one convexity through the following diagram:[2]
Motivation
[edit]Let be an open bounded domain, and denote the Sobolev space of mappings from to . A typical problem in the calculus of variations is to minimize a functional, of the form
- ,
where the energy density function, satisfies -growth, i.e., for some and . It is well-known from a theorem of Morrey and Acerbi-Fusco that a necessary and sufficient condition for to weakly lower-semicontinuous on is that is quasiconvex for almost every . With coercivity assumptions on and boundary conditions on , this leads to the existence of minimizers for on .[3] However, in many applications, the assumption of -growth on the energy density is often too restrictive. In the context of elasticity, this is because the energy is required to grow unboundedly to as local measures of volume approach zero. This led Ball to define the more restrictive notion of polyconvexity to prove the existence of energy minimizers in nonlinear elasticity.
Definition
[edit]A function is said to be polyconvex[4] if there exists a convex function such that
where is such that
Here, stands for the matrix of all minors of the matrix , and
where .
When , and when , , where denotes the cofactor matrix of .
In the above definitions, the range of can also be extended to .
Properties
[edit]- If takes only finite values, then polyconvexity implies quasiconvexity and thus leads to the weak lower semicontinuity of the corresponding integral functional on a Sobolev space.
- If or , then polyconvexity reduces to convexity.
- If is polyconvex, then it is locally Lipschitz.
- Polyconvex functions with subquadratic growth must be convex, i.e., if there exists and such that
- for every , then is convex.
Examples
[edit]- Every convex function is polyconvex.
- For the case , the determinant function is polyconvex, but not convex. In particular, the following type of function that commonly appears in nonlinear elasticity is polyconvex but not convex:
References
[edit]- ^ Ball, John M. (1976). "Convexity conditions and existence theorems in nonlinear elasticity" (PDF). Archive for Rational Mechanics and Analysis. 63 (4). Springer: 337–403. doi:10.1007/BF00279992.
- ^ Dacorogna, Bernard (2008). Direct Methods in the Calculus of Variations. Applied mathematical sciences. Vol. 78 (2nd ed.). Springer Science+Business Media, LLC. p. 156. doi:10.1007/978-0-387-55249-1. ISBN 978-0-387-35779-9.
- ^ Rindler, Filip (2018). Calculus of Variations. Universitext. Springer International Publishing AG. p. 124-125. doi:10.1007/978-3-319-77637-8. ISBN 978-3-319-77636-1.
- ^ Dacorogna, Bernard (2008). Direct Methods in the Calculus of Variations. Applied mathematical sciences. Vol. 78 (2nd ed.). Springer Science+Business Media, LLC. p. 157. doi:10.1007/978-0-387-55249-1. ISBN 978-0-387-35779-9.