.png){kind=icon}
.png){kind=icon}
Return
An adaptive relaxation algorithm for multiscale problems and application to nematic elastomers
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jmps.2018.02.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The relaxation of nonconvex variational problems involving free energy densities W which depend on the deformation gradient is frequently characterized by a hierarchy of structures at different and well-separated length scales. A wide range of these structures can be characterized as the superposition of one-dimensional oscillations on different length scales which are referred to as laminates of finite order. During a finite element simulation, the relaxed energy W-qc needs to be evaluated in each time step in each Gauss point in the triangulation. In this paper, an algorithmic scheme is presented that allows for the efficient computation of an approximation of the relaxed energy based on laminates of finite order in a large number of points. As an application, the relaxed energy for thin sheets of anisotropic nematic elastomers is studied in detail. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Numerical relaxation
Phase transformation
Quasiconvexity
Nematic elastomers
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
3.0W