Summary. We present a convergence analysis of an algorithm for the numerical computation of the rank-one convex envelope of a function \(f:\mathrm{M}^{m\times n}\rightarrow \mathbb{R}\). A rate of convergence for the scheme is established, and numerical experiments are presented to illustrate the analytical results and applications of the algorithm.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received February 1, 1999 / Published online April 20, 2000
Rights and permissions
About this article
Cite this article
Dolzmann, G., Walkington, N. Estimates for numerical approximations of rank one convex envelopes. Numer. Math. 85, 647–663 (2000). https://doi.org/10.1007/PL00005395
Issue Date:
DOI: https://doi.org/10.1007/PL00005395