Reliable and Efficient Approximation of Polyconvex Envelopes

DOI10.1137/S0036142903428840zbMath1089.65052MaRDI QIDQ5700273

Sören Bartels

Publication date: 28 October 2005

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

zbMATH Keywords

iterative algorithmmicrostructurenumerical experimentsadaptive algorithmcalculus of variationsnonconvex variational problemquasi convexityrelaxed variational problems

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Existence theories for optimal control problems involving partial differential equations (49J20)

Related Items (15)

Linear convergence in the approximation of rank-one convex envelopes ⋮ Analytical and numerical relaxation results for models in soil mechanics ⋮ Weak Lower Semicontinuity of Integral Functionals and Applications ⋮ A method for pointwise evaluation of polyconvex envelopes ⋮ An adaptive relaxation algorithm for multiscale problems and application to nematic elastomers ⋮ Instability origin of subgrain formation in plastically deformed materials ⋮ Towards Effective Simulation of Effective Elastoplastic Evolution ⋮ Optimal laminates in single-slip elastoplasticity ⋮ A partial differential equation for the rank one convex envelope ⋮ An algorithm for pointwise evaluation of polyconvex envelopes. II: generalization and numerical results ⋮ Ten remarks on nonconvex minimisation for phase transition simulations ⋮ The quasiconvex envelope of conformally invariant planar energy functions in isotropic hyperelasticity ⋮ Computational Microstructures in Phase Transition Solids and Finite-Strain Elastoplasticity ⋮ Mixed analytical-numerical relaxation in finite single-slip crystal plasticity ⋮ Convergence of adaptive finite element methods for a nonconvex double-well minimization problem

This page was built for publication: Reliable and Efficient Approximation of Polyconvex Envelopes