An algorithm for partially relaxing multiwell energy densities, such as for materials undergoing martensitic phase transitions, is presented here. The detection of the rank-one convex hull, which describes effective properties of such materials, is carried out for the most prominent nontrivial case, namely the so-called Tk-configurations. Despite the fact that the computation of relaxed energies (and with it effective properties) is inherently unstable, we show that the detection of these hulls (T4-configurations) can be carried out exactly and with high efficiency. This allows in practice for their computation to arbitrary precision. In particular, our approach to detect these hulls is not based on any approximation or grid-like discretization. This makes the approach very different from previous (unstable and computationally expensive) algorithms for the computation of rank-one convex hulls or sequential-lamination algorithms for the simulation of martensitic microstructure. It can be used to improve these algorithms. In cases where there is a strict separation of length scales, these ideas can be integrated at a sub-grid level to macroscopic finite-element computations. The algorithm presented here enables, for the first time, large numbers of tests for T4-configurations. Stochastic experiments in several space dimensions are reported here.
Nous présentons dans cette Note un algorithme de relaxation partielle de densités d'énergie à plusieurs puits, comme pour la modélisation de matériaux subissant des transitions de phase « martensitiques ». La détection de l'enveloppe rang-un convexe, qui décrit les propriétés effectives de tels matériaux, est menée à bien pour le cas non trivial le plus connu, c'est-à-dire les configurations Tk. Bien que le calcul d'énergies relaxées (et donc de propriétés effectives) soit naturellement instable, nous montrons que la détection de ces enveloppes (configurations T4) peut être effectuée de façon exacte très efficacement. En pratique, cela permet leur calcul à une précision arbitraire. En particulier, notre approche pour la détection de ces enveloppes n'est basée sur aucune approximation ou discrétisation. Ceci la démarque des autres algorithmes (instables et coûteux) de calcul d'enveloppes rang-un convexes ou de lamination séquentielle pour la simulation de microstructures martensitiques. Notre méthode peut être utilisée pour améliorer ces derniers. Dans les cas où il y a une stricte séparation des échelles, ces idées peuvent être utilisées à un niveau inférieur dans des calculs macroscopiques de type éléments finis. La méthode présentée ici permet pour la première fois un grand nombre de tests pour la configuration T4. Nous rendons compte également d'expériences stochastiques en plusieurs dimensions.
Accepted:
Published online:
Mots-clés : Milieux continus, Enveloppe convexe de rang 1, Configuration de type Tk
Carl-Friedrich Kreiner 1; Johannes Zimmer 1; Isaac V. Chenchiah 1
@article{CRMECA_2004__332_3_169_0,
author = {Carl-Friedrich Kreiner and Johannes Zimmer and Isaac V. Chenchiah},
title = {Towards the efficient computation of effective properties of microstructured materials},
journal = {Comptes Rendus. M\'ecanique},
pages = {169--174},
publisher = {Elsevier},
volume = {332},
number = {3},
year = {2004},
doi = {10.1016/j.crme.2004.01.011},
language = {en},
}
TY - JOUR AU - Carl-Friedrich Kreiner AU - Johannes Zimmer AU - Isaac V. Chenchiah TI - Towards the efficient computation of effective properties of microstructured materials JO - Comptes Rendus. Mécanique PY - 2004 SP - 169 EP - 174 VL - 332 IS - 3 PB - Elsevier DO - 10.1016/j.crme.2004.01.011 LA - en ID - CRMECA_2004__332_3_169_0 ER -
%0 Journal Article %A Carl-Friedrich Kreiner %A Johannes Zimmer %A Isaac V. Chenchiah %T Towards the efficient computation of effective properties of microstructured materials %J Comptes Rendus. Mécanique %D 2004 %P 169-174 %V 332 %N 3 %I Elsevier %R 10.1016/j.crme.2004.01.011 %G en %F CRMECA_2004__332_3_169_0
Carl-Friedrich Kreiner; Johannes Zimmer; Isaac V. Chenchiah. Towards the efficient computation of effective properties of microstructured materials. Comptes Rendus. Mécanique, Volume 332 (2004) no. 3, pp. 169-174. doi : 10.1016/j.crme.2004.01.011. https://comptes-rendus.academie-sciences.fr/mecanique/articles/10.1016/j.crme.2004.01.011/
[1] Variational models for microstructure and phase transitions, Calculus of Variations and Geometric Evolution Problems (Cetraro, 1996), Lecture Notes in Math., vol. 1713, Springer, Berlin, 1999, pp. 85-210
[2] On the computation of the rank-one convex hull of a function, SIAM J. Sci. Comput., Volume 22 (2000) no. 5, pp. 1772-1790 (electronic)
[3] A constrained sequential-lamination algorithm for the simulation of sub-grid microstructure in martensitic materials, Comput. Methods Appl. Mech. Engrg., Volume 192 (2003) no. 26–27, pp. 2823-2843
[4] Numerical computation of rank-one convex envelopes, SIAM J. Numer. Anal., Volume 36 (1999) no. 5, pp. 1621-1635 (electronic)
[5] On directional convexity, Discrete Comput. Geom., Volume 25 (2001) no. 3, pp. 389-403
[6] Studying nonlinear pde by geometry in matrix space, Geometric Analysis and Nonlinear Partial Differential Equations, Springer, Berlin, 2003, pp. 347-395
[7] Rigidity and Geometry of Microstructures, Lecture Notes, vol. 16, Max Planck Institute for Mathematics in the Sciences, Leipzig, 2003
[8] Some remarks on separately convex functions, Microstructure and Phase Transition, IMA Vol. Math. Appl., vol. 54, Springer, New York, 1993, pp. 191-204
[9] L. Székelyhidi, Elliptic regularity versus rank-one convexity, Ph.D. thesis, Universität Leipzig, 2003
[10] Algebraic Geometry, Springer-Verlag, New York, 1995 (A first course, Corrected reprint of the 1992 original)
[11] Counting real zeros in the multivariate case, Computational Algebraic Geometry (Nice, 1992), Progr. Math., vol. 109, Birkhäuser Boston, Boston, MA, 1993, pp. 203-224
[12] From enumerative geometry to solving systems of polynomial equations (D. Eisenbud; D.R. Grayson; M. Stillman, eds.), Computations in Algebraic Geometry with Macaulay 2, Algorithms and Computation in Mathematics, vol. 8, Springer-Verlag, Berlin, 2002, pp. 1-30
[13] Macaulay 2, a software system for research in algebraic geometry http://www.math.uiuc.edu/Macaulay2/ (Available at)
[14] C.-F. Kreiner, Algebraic methods for convexity notions in the calculus of variations, Master's thesis, Technische Universität München, Zentrum Mathematik, 2003
Cited by Sources:
Comments - Policy