citeseer |
(0) (0 Votes)
|
Views: (1005) Date: (13-05-09) Pages: () |
Abstract: We show that the Steepest Descent Algorithm in connection with wiggly energies yields minimizing sequences that converge to a global minimum of the associated non-quasiconvex variational integrals. We introduce a multi-level infinite dimensional variant of the Steepest Descent Algorithm designed to compute complex microstructures by forming non-smooth minimizers from the smooth initial guess. We apply this multilevel method to the minimization of the variational problems associated with martensitic branching. Keywords Quasiconvexity, nonconvex minimization, microstructures, steepest descent, wiggly energy, multi-level minimization methods, martensite, martensitic branching. 1991 Mathematical Subject Classification 35B27, 35E10, 49J45, 65C20, 65D15, 65K10 1 Introduction A continuum description of materials with fine structure often leads to minimization and dynamic problems that are extremely complex. In many cases, the reason is that the scale associated with the crystallographic (f...