Polyconvex function

From testwiki
Jump to navigation Jump to search

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]

f convexf polyconvexf quasiconvexf rank-one convex

Motivation

Let Ωn be an open bounded domain, u:Ωm and W1,p(Ω,m) denote the Sobolev space of mappings from Ω to m. A typical problem in the calculus of variations is to minimize a functional, E:W1,p(Ω,m) of the form

E[u]=Ωf(x,u(x))dx,

where the energy density function, f:Ω×m×n[0,) satisfies p-growth, i.e., |f(x,A)|M(1+|A|p) for some M>0 and p(1,). It is well-known from a theorem of Morrey and Acerbi-Fusco that a necessary and sufficient condition for E to weakly lower-semicontinuous on W1,p(Ω,m) is that f(x,) is quasiconvex for almost every xΩ. With coercivity assumptions on f and boundary conditions on u, this leads to the existence of minimizers for E on W1,p(Ω,m).[3] However, in many applications, the assumption of p-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

A function f:m×n is said to be polyconvex[4] if there exists a convex function Φ:τ(m,n) such that

f(F)=Φ(T(F))

where T:m×nτ(m,n) is such that

T(F):=(F,adj2(F),...,adjmn(F)).

Here, adjs stands for the matrix of all s×s minors of the matrix Fm×n, 2smn:=min(m,n) and

τ(m,n):=s=1mnσ(s),

where σ(s):=(ms)(ns).

When m=n=2, T(F)=(F,detF) and when m=n=3, T(F)=(F,cofF,detF), where cofF denotes the cofactor matrix of F.

In the above definitions, the range of f can also be extended to {+}.

Properties

  • If f 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 m=1 or n=1, then polyconvexity reduces to convexity.
  • Polyconvex functions with subquadratic growth must be convex, i.e., if there exists α0 and 0p<2 such that
f(F)α(1+|F|p) for every Fm×n, then f is convex.

Examples

  • Every convex function is polyconvex.
  • For the case m=n, 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:
f(A)={1det(A),det(A)>0;+,det(A)0;

References

Template:Reflist