.
A rate of convergence for the scheme is established, and numerical
experiments are presented to illustrate the analytical results and
applications of the algorithm.
Estimates for Numerical Approximations of Rank
One Convex Envelopes
G. Dolzmann
Max Planck Institute for Mathematics in the Sciences
Inselstr. 22-26
D-04103 Leipzig
Germany
email: georg@mis.mpg.de
and
N. J. Walkington
Carnegie Mellon University
Department of Mathematical Sciences
Pittsburgh, PA 15213
email: noelw@andrew.cmu.edu
ABSTRACT: We present a convergence analysis of an
algorithm for the numerical computation of the rank-one convex
envelope of a function
.
A rate of convergence for the scheme is established, and numerical
experiments are presented to illustrate the analytical results and
applications of the algorithm.
Get the paper in its entirety as