Asymptotic expressions for the nearest and furthest dislocations in a pile-up against a grain boundary
AuthorsHall, Cameron L.
KAUST Grant NumberKUK-C1-013-04
MetadataShow full item record
AbstractIn 1965, Armstrong and Head explored the problem of a pile-up of screw dislocations against a grain boundary. They used numerical methods to determine the positions of the dislocations in the pile-up and they were able to fit approximate formulae for the locations of the first and last dislocations. These formulae were used to gain insights into the Hall-Petch relationship. More recently, Voskoboinikov et al. used asymptotic techniques to study the equivalent problem of a pile-up of a large number of screw dislocations against a bimetallic interface. In this paper, we extend the work of Voskoboinikov et al. to construct systematic asymptotic expressions for the formulae proposed by Armstrong and Head. The further extension of these techniques to more general pile-ups is also outlined. As a result of this work, we show that a pile-up against a grain boundary can become equivalent to a pile-up against a locked dislocation in the case where the mismatch across the boundary is small. © 2010 Taylor & Francis.
CitationHall CL (2010) Asymptotic expressions for the nearest and furthest dislocations in a pile-up against a grain boundary. Philosophical Magazine 90: 3879–3890. Available: http://dx.doi.org/10.1080/14786435.2010.499859.
SponsorsThis publication is based on work supported by Award No. KUK-C1-013-04, made by the King Abdullah University of Science and Technology (KAUST). I would like to acknowledge the contributions of John R. Ockendon (Oxford), S. Jonathan Chapman (Oxford), Roman E. Voskoboynikov (Kurchatov) and Graeme C. Wake (Massey), with whom I discussed various aspects of this work.
PublisherInforma UK Limited