Abstract
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$.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
