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$.
One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage All Access membership.
Explore Editage All AccessPublished in last 50 years