Abstract
ABSTRACT Full-field simulations used to enhance the predictive capability of classical finite element models require the preparation of high-quality initial digital material representation (DMR) data. Depending on the selected method, such a procedure can be time-consuming and, in subsequent model runs, result in a significant increase in computational time. An unconstrained grain growth algorithm based on the random cellular automata (RCA) method can be used as a potential solution to provide high-quality DMR. However, the most time-consuming part of that approach, the neighbor-search algorithm, should be optimized from an algorithmic point of view before practical application in full-field analysis. Therefore, four neighbor-search algorithms dedicated to the RCA method were developed and benchmarked within the paper for the algorithm's complexity and impact of individual parameters on computational efficiency. The research has shown that significantly reducing RCA simulation time is possible with the properly developed neighbor-search algorithm and problem-specific code optimizations.
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 callSimilar Papers
More From: Materials and Manufacturing Processes
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.
