Abstract
The phase-field method is increasingly used for studying grain growth in metallic alloys. Such an approach offers a thermodynamically consistent framework for studying microstructure evolution during grain growth without the need to explicitly track the interface positions. However, the numerical solution of the models requires a grid spacing much smaller than the interface width. This leads to computationally very intensive simulations, especially when a large number of grains is required to accurately measure statistical quantities. The recently proposed S-PFM approach provides a new inherently discrete formulation of phase field models where the interface width can be as small as the grid spacing, thus drastically improving the numerical performances of the method. Here, we show that this approach can be extended to a multi-phase field model for ideal grain growth. Then, we perform two dimensional simulations to analyse in detail the kinetics of both grain boundaries and triple junctions. We compare our model to a classical phase field formulation and we demonstrate that, for a prescribed accuracy, the memory requirement and simulation times are both reduced by a factor of 4D, where D is the space dimension. Finally, we perform a large-scale simulation of grain growth in two dimensions and show that the method is able to reveal the specific shape of the grain size distribution in the scale-invariant regime displaying two peaks around the mean grain size and quantitative measurements of the underlying topological classes are performed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.