A numerical iterative scheme for computing finite order rank-one convex envelopes (Q870130)

An efficient numerical scheme for the computation of finite order rank-one convex envelopes is described. The \(k\)th order rank-one convex envelope is used to resolve the \(i\)th order laminated microstructures with \(k\) bigger or equal to \(i\). The authors develop an iterative scheme. Firstly, the first order rank-one convex envelope is approximated by evaluating its value on matrices at each grid point and then the interpolation is used to extend the first order rank-one convex envelope value to non-grid points. The \(k\)th order rank-one convex envelope is obtained iteratively by applying this procedure to the numerical approximation of the \((k-1)\)th order rank-one convex envelope. Numerical examples are shown to demonstrate the suggested numerical computing scheme.