Sparse data structure and algorithm for the phase field method

Abstract

The concepts of sparse data structures and related algorithms for phase field simulations are discussed. Simulations of polycrystalline grain growth with a conventional phase field method and with sparse data structures are compared. It is shown that memory usage and simulation time scale with the number of nodes but are independent of the number of order parameters when a sparse data structure is used.

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@inproceedings{Gruber2006SparseDS, title={Sparse data structure and algorithm for the phase field method}, author={Jan Gruber and Nan Ma and Yanping Wang and Gregory S Rohrer}, year={2006} }