Abstract
Phase-field modeling has proven to be a versatile tool for simulating microstructural evolution phenomena, such as grain growth in polycrystalline materials. However, the computing time and computing memory requirements of a phase-field model pose severe limitations on the number of phase-field variables that can be taken into account in a practical implementation. In this paper, a sparse bounding box algorithm is proposed that allows the use of a large number of phase-field variables without excessive memory usage or computational requirements. The algorithm is applied to a three-dimensional model for grain growth in the presence of second-phase particles.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
