A numerical iterative scheme for computing finite order rank-one convex envelopes
From MaRDI portal
Publication:870130
DOI10.1016/J.AMC.2006.06.088zbMATH Open1120.65024OpenAlexW1999158783MaRDI QIDQ870130FDOQ870130
Publication date: 12 March 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.06.088
Recommendations
- Finite order rank-one convex envelopes and computation of microstructures with laminates in laminates
- Linear convergence in the approximation of rank-one convex envelopes
- Estimates for numerical approximations of rank one convex envelopes
- A partial differential equation for the rank one convex envelope
- Bounds on the effective energy by rank-one convexification
Cites Work
- Fine phase mixtures as minimizers of energy
- Direct methods in the calculus of variations
- On the computation of the rank-one convex hull of a function
- Optimal design and relaxation of variational problems, I
- Proposed experimental tests of a theory of fine microstructure and the two-well problem
- Numerical Computation of Rank-One Convex Envelopes
- Estimates for numerical approximations of rank one convex envelopes
- Finite order rank-one convex envelopes and computation of microstructures with laminates in laminates
- The appearance of microstructures in problems with incompatible wells and their numerical approach
- MULTISCALE MODELLING AND COMPUTATION OF MICROSTRUCTURES IN MULTI-WELL PROBLEMS
- Bounds on the effective energy by rank-one convexification
Cited In (2)
This page was built for publication: A numerical iterative scheme for computing finite order rank-one convex envelopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870130)
