A linearly convergent iterative algorithm that approximates the rank-1 convex envelope $f^{rc}$ of a given function $f:{ℝ}^{n\times m}\to ℝ$, i.e. the largest function below $f$ which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington.

A linearly convergent iterative algorithm that approximates the rank-1 convex envelope $f^{rc}$ of a given function $f:{ℝ}^{n\times m}\to ℝ$, i.e. the largest function below f which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington.

The present paper proposes and analyzes a general locking free mixed strategy for computing the deformation of incompressible three dimensional structures placed inside flexible membranes. The model involves as in Chapelle and Ferent [Math. Models Methods Appl. Sci.13 (2003) 573–595] a bending dominated shell envelope and a quasi incompressible elastic body. The present work extends an earlier work of Arnold and Brezzi [Math Comp.66 (1997) 1–14] treating the shell part and proposes a global...