6 research outputs found
Linear convergence in the approximation of rank-one convex envelopes
A linearly convergent iterative algorithm that approximates the
rank-1 convex envelope of a given function ,
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
Concurrent Multiscale Computing of Deformation Microstructure by Relaxation and Local Enrichment with Application to Single-Crystal Plasticity
This paper is concerned with the effective modeling of deformation microstructures within a concurrent multiscale computing framework. We present a rigorous formulation of concurrent multiscale computing based on relaxation; we establish the connection between concurrent multiscale computing and enhanced-strain elements; and we illustrate the approach in an important area of application, namely, single-crystal plasticity, for which the explicit relaxation of the problem is derived analytically. This example demonstrates the vast effect of microstructure formation on the macroscopic behavior of the sample, e.g., on the force/travel curve of a rigid indentor. Thus, whereas the unrelaxed model results in an overly stiff response, the relaxed model exhibits a proper limit load, as expected. Our numerical examples additionally illustrate that ad hoc element enhancements, e.g., based on polynomial, trigonometric, or similar representations, are unlikely to result in any significant relaxation in general