A linearly convergent iterative algorithm that approximates the rank-1 convex envelope $f^{rc}$ of a given function $f:\mathbb{R}^{n\times m} \to \mathbb{R}$, 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.

We give an analysis of the stability and uniqueness of the simplylaminated microstructure for all three tetragonal to monoclinicmartensitic transformations. The energy density for tetragonal tomonoclinic transformations has four rotationally invariant wells sincethe transformation has four variants. One of these tetragonal tomonoclinic martensitic transformations corresponds to the shearing ofthe rectangular side, one corresponds to the shearing of the squarebase, and one corresponds to the shearing of the plane orthogonal to adiagonal in the square base. We show that the simply laminatedmicrostructure is stable except for a class of special materialparameters. In each case that the microstructure is stable, we deriveerror estimates for the finite element approximation.