Polyconvex function

From Wikipedia, the free encyclopedia

In mathematics, the notion of polyconvexity is a generalization of the notion of convexity for functions defined on spaces of matrices. Let Mm×n(K) denote the space of all m × n matrices over the field K, which may be either the real numbers R or the complex numbers C. A function f : Mm×n(K) → R ∪ {±∞} is said to be polyconvex if

A \mapsto f(A)

can be written as a convex function of the p × p subdeterminants of A, for 1 ≤ p ≤ min{m, n}.

Polyconvexity is a weaker property than convexity. For example, the function f given by

f(A) = \begin{cases} \frac1{\det (A)}, & \det (A) > 0; \\ + \infty, & \det (A) \leq 0; \end{cases}

is polyconvex but not convex.

[edit] References

  • Renardy, Michael and Rogers, Robert C. (2004). An introduction to partial differential equations, Second edition, Texts in Applied Mathematics 13, New York: Springer-Verlag, 353. ISBN 0-387-00444-0.  (Definition 9.25)