SIMULATION OF CURVATURE-DRIVEN GRAIN-GROWTH BY USING A MODIFIED MONTE-CARLO ALGORITHM

The Monte Carlo (MC) algorithm that currently exists in the literature for simulating curvature-driven grain growth has been modified. The modified algorithm results in an acceleration of the simulated grain growth and an early estimate of the grain growth exponent that is close to the theoretical value of 0.5. The upper limit of grain size distributions obtained with the new algorithm is significantly lower than that obtained with the old, because the new algorithm eliminates grain coalescence during grain growth. The log-normal function provides an excellent fit to the grain size distribution data obtained with the new algorithm, after taking into account the anisotropy in grain boundary energy.