[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Estimates for numerical approximations of rank one convex envelopes

  • Original article
  • Published:
Numerische Mathematik Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received February 1, 1999 / Published online April 20, 2000

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00005395

Keywords

Navigation