Abstract
An algorithmic closed-form solution is derived for Eshelby's problem for polygonal and polyhedral inclusions. Illustrative calculations are presented for two- and three-dimensional problems. Also it is proven that polyhedra with constant Eshelby's tensor do not exist.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
