A numerical iterative scheme for computing finite order rank-one convex envelopes
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.
- Finite order rank-one convex envelopes and computation of microstructures with laminates in laminates
- Linear convergence in the approximation of rank-one convex envelopes
- Estimates for numerical approximations of rank one convex envelopes
- A partial differential equation for the rank one convex envelope
- Bounds on the effective energy by rank-one convexification
- Bounds on the effective energy by rank-one convexification
- Direct methods in the calculus of variations
- Estimates for numerical approximations of rank one convex envelopes
- Fine phase mixtures as minimizers of energy
- Finite order rank-one convex envelopes and computation of microstructures with laminates in laminates
- MULTISCALE MODELLING AND COMPUTATION OF MICROSTRUCTURES IN MULTI-WELL PROBLEMS
- Numerical Computation of Rank-One Convex Envelopes
- On the computation of the rank-one convex hull of a function
- Optimal design and relaxation of variational problems, I
- Proposed experimental tests of a theory of fine microstructure and the two-well problem
- The appearance of microstructures in problems with incompatible wells and their numerical approach
This page was built for publication: A numerical iterative scheme for computing finite order rank-one convex envelopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870130)