Abstract

We present a comprehensive dislocation dynamics (DD) study of the strength of stacking fault tetrahedra (SFT) to screw dislocation glide in fcc Cu. Our methodology explicitly accounts for partial dislocation reactions in fcc crystals, which allows us to provide more detailed insights into the dislocation–SFT processes than previous DD studies. The resistance due to stacking fault surfaces to dislocation cutting has been computed using atomistic simulations and added in the form of a point stress to our DD methodology. We obtain a value of 1658.9 MPa, which translates into an extra force resolved on the glide plane that dislocations must overcome before they can penetrate SFTs. In fact, we see they do not, leading to two well differentiated regimes: (i) partial dislocation reactions, resulting in partial SFT damage, and (ii) impenetrable SFT resulting in the creation of Orowan loops. We obtain SFT strength maps as a function of dislocation glide plane-SFT intersection height, interaction orientation, and dislocation line length. In general SFTs are weaker obstacles the smaller the encountered triangular area is, which has allowed us to derive simple scaling laws with the slipped area as the only variable. These laws suffice to explain all strength curves and are used to derive a simple model of dislocation–SFT strength. The stresses required to break through obstacles in the 2.5–4.8-nm size range have been computed to be 100–300 MPa, in good agreement with some experimental estimations and molecular dynamics calculations.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.