z-logo
Premium
Efficient methods for implicit geometrical representation of complex material microstructures
Author(s) -
Yuan Rui,
Singh Sudhanshu S.,
Chawla Nikhilesh,
Oswald Jay
Publication year - 2014
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.4619
Subject(s) - finite element method , polygon mesh , initialization , signed distance function , convergence (economics) , representation (politics) , mesh generation , level set (data structures) , adaptive mesh refinement , algorithm , galerkin method , computer science , mathematics , grid , meshfree methods , computational science , geometry , structural engineering , artificial intelligence , politics , law , political science , engineering , economics , programming language , economic growth
SUMMARY We present two methods for initializing distance functions on adaptively‐refined finite element meshes to represent complex material microstructures from segmented x‐ray tomographic data. Implicit microstructure representation combined with the extended FEM allows modelers to represent complex material microstructures with consistent mesh quality and accuracy. In the first method, a level set evolution equation is formulated and solved by the Galerkin method on an adaptively‐refined mesh. We show that the convergence and stability of this method is optimal for the order of elements used. In the second approach, we initialize the distance field by the fast marching method on a uniform grid, and then project the solution onto the finite element mesh by least‐squares. We show that this latter approach is superior in speed and accuracy. As an example problem, both methods are demonstrated in the initialization of distance fields for two inclusion phases within a Al‐7075 alloy. Copyright © 2014 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here