2006
DOI: 10.1103/physreve.73.016703
|View full text |Cite
|
Sign up to set email alerts
|

Efficient numerical algorithm for multiphase field simulations

Abstract: Phase-field models have emerged as a successful class of models in a wide variety of applications in computational materials science. Multiphase field theories, as a subclass of phase-field theories, have been especially useful for studying nucleation and growth in polycrystalline materials. In theory, an infinite number of phase-field variables are required to represent grain orientations in a rotationally invariant free energy. However, limitations on available computational time and memory have restricted t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
60
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
6
3
1

Relationship

1
9

Authors

Journals

citations
Cited by 122 publications
(60 citation statements)
references
References 17 publications
0
60
0
Order By: Relevance
“…(15). To solve this numerical difficulty, we adopt the sparse data structure technique proposed by Gruber et al (2006) and Vedantam and Patnaik (2006) to reduce the effective N g considered for each PF node. It also needs to be pointed out that the PF simulation does not need to reside on the same computational grid as in FFT-EVP, owing to the different length scales of the corresponding physical processes as indicated in Fig.…”
Section: Phase-field Modelmentioning
confidence: 99%
“…(15). To solve this numerical difficulty, we adopt the sparse data structure technique proposed by Gruber et al (2006) and Vedantam and Patnaik (2006) to reduce the effective N g considered for each PF node. It also needs to be pointed out that the PF simulation does not need to reside on the same computational grid as in FFT-EVP, owing to the different length scales of the corresponding physical processes as indicated in Fig.…”
Section: Phase-field Modelmentioning
confidence: 99%
“…Active parameter tracking [7,8] is employed to reduce the computational expense of the phase field grain-growth model. Each order parameter is only stored where it is above 1 × 10 −6 ; otherwise the order parameter is assumed to be zero.…”
Section: Phase Field Modelmentioning
confidence: 99%
“…Our phase-transformation model uses a Gillespie cellular automata (GCA) approach that combines thermodynamic features of rate-equation approaches 15 with elements from probabilistic cellular automata (PCA) models 16,17 and phasefield models; 18,19 in addition, it uses the Gillespie algorithm 20 for efficient time-stepping. Our GCA model has been previously described in detail 21 and in summary considers a homogeneous, isotropic material in a square lattice where the state of the material is described through a set of points in the lattice that can be either crystalline or amorphous.…”
mentioning
confidence: 99%