اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAnalysis of a moving mask approximation for martensitic transformations
49
0
0.0
(
0
)
تأليف
Francesco Della Porta
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this work we introduce a moving mask approximation to describe the dynamics of austenite to martensite phase transitions at a continuum level. In this framework, we prove a new type of Hadamard jump condition, from which we deduce that the deformation gradient must be of the form $mathsf{1} +mathbf{a}otimes mathbf{n}$ a.e. in the martensite phase. This is useful to better understand the complex microstructures and the formation of curved interfaces between phases in new ultra-low hysteresis alloys such as Zn45Au30Cu25, and provides a selection mechanism for physically-relevant energy-minimising microstructures. In particular, we use the new type of Hadamard jump condition to deduce a rigidity theorem for the two well problem. The latter provides more insight on the cofactor conditions, particular conditions of supercompatibility between phases believed to influence reversibility of martensitic transformations.
قيم البحث
اقرأ أيضاً
In this work we introduce a new system of partial differential equations as a simplified model for the evolution of reversible martensitic transformations under thermal cycling in low hysteresis alloys. The model is developed in the context of nonlin
ear continuum mechanics, where the developed theory is mostly static, and cannot capture the influence of dynamics on martensitic microstructures. First, we prove existence of weak solutions; secondly, we study the physically relevant limit when the interface energy density vanishes, and the elastic constants tend to infinity. The limit problem provides a framework for the moving mask approximation recently introduced by the author. In the last section we study the limit equations in a one-dimensional setting. After closing the equations with a constitutive relation between the phase interface velocity and the temperature of the one-dimensional sample, the equations become a two-phase Stefan problem with a kinetic condition at the free boundary. Under some further assumptions, we show that the phase interface reaches the domain boundary in finite time.
We describe a novel approach for the rational design and synthesis of self-assembled periodic nanostructures using martensitic phase transformations. We demonstrate this approach in a thin film of perovskite SrSnO3 with reconfigurable periodic nanost
ructures consisting of regularly spaced regions of sharply contrasted dielectric properties. The films can be designed to have different periodicities and relative phase fractions via chemical doping or strain engineering. The dielectric contrast within a single film can be tuned using temperature and laser wavelength, effectively creating a variable photonic crystal. Our results show the realistic possibility of designing large-area self-assembled periodic structures using martensitic phase transformations with the potential of implementing built-to-order nanostructures for tailored optoelectronic functionalities.
Recently proposed numerical algorithms for solving high-dimensional nonlinear partial differential equations (PDEs) based on neural networks have shown their remarkable performance. We review some of them and study their convergence properties. The m
ethods rely on probabilistic representation of PDEs by backward stochastic differential equations (BSDEs) and their iterated time discretization. Our proposed algorithm, called deep backward multistep scheme (MDBDP), is a machine learning version of the LSMDP scheme of Gobet, Turkedjiev (Math. Comp. 85, 2016). It estimates simultaneously by backward induction the solution and its gradient by neural networks through sequential minimizations of suitable quadratic loss functions that are performed by stochastic gradient descent. Our main theoretical contribution is to provide an approximation error analysis of the MDBDP scheme as well as the deep splitting (DS) scheme for semilinear PDEs designed in Beck, Becker, Cheridito, Jentzen, Neufeld (2019). We also supplement the error analysis of the DBDP scheme of Hur{e}, Pham, Warin (Math. Comp. 89, 2020). This yields notably convergence rate in terms of the number of neurons for a class of deep Lipschitz continuous GroupSort neural networks when the PDE is linear in the gradient of the solution for the MDBDP scheme, and in the semilinear case for the DBDP scheme. We illustrate our results with some numerical tests that are compared with some other machine learning algorithms in the literature.
The over-relaxation approach is an alternative to the Jin-Xin relaxation method (Jin and Xin [1]) in order to apply the equilibrium source term in a more precise way (Coulette et al. [2, 3]). This is also a key ingredient of the Lattice-Boltzmann met
hod for achieving second order accuracy (Dellar [4]). In this work we provide an analysis of the over-relaxation kinetic scheme. We compute its equivalent equation, which is particularly useful for devising stable boundary conditions for the hidden kinetic variables.
We consider a singularly-perturbed nonconvex energy functional which arises in the study of microstructures in shape memory alloys. The scaling law for the minimal energy predicts a transition from a parameter regime in which uniform structures are f
avored, to a regime in which the formation of fine patterns is expected. We focus on the transition regime and derive the reduced model in the sense of $Gamma$-convergence. The limit functional turns out to be similar to the Mumford-Shah functional with additional constraints on the jump set of admissible functions. One key ingredient in the proof is an approximation result for $SBV^p$ functions whose jump sets have a prescribed orientation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
