Prefer a chat interface with context about you and your work?
Numerical Computation of Rank-One Convex Envelopes
We describe an algorithm for the numerical computation of the rank-one convex envelope of a function $f:\MM^{m\times n}\rightarrow\RR$. We prove its convergence and an error estimate in $L^\infty$.MSC codes65N1265N1565N30Keywordsrank-one convexitygeneralized convex envelopesnonconvex variational problems.