arXiv subjects

T. Oppelstrup

Publications and source records attributed to T. Oppelstrup.

6 recordsLinked to original sources

arXiv2026

The Dislocation Content of Triple Junctions

Triple junctions, line defects formed by the intersection of different grain boundaries, exist within all polycrystalline materials. While it has long been recognized that triple junctions could play an important role in microstructural evolution, there remains much uncertainty regarding their properties. Triple junctions are line defects capable of carrying dislocation content. However, no general method for calculating this content has been established. In this work, we derive the necessary equations to calculate the intrinsic dislocation content of a triple junction whose trichromatic pattern forms a coincidence site lattice. We further show that this approach can be easily applied to facet junctions, and in principle, any type of grain boundary junction for which a coincidence site lattice can be defined. We apply this formalism to atomistic simulations of tungsten to compute the Burgers vectors of a facet junction and a triple junction formed during twin grain nucleation and growth from a free surface. By tracking the evolution of the triple junction's Burgers vector and its core structure, we reveal the sequence of individual line defect reactions responsible for triple-junction-mediated twin growth.

cond-mat.mtrl-sci↗

arXiv2022

Characterization and visualization of grain boundary disconnections

We introduce a method to visualize dislocations along grain boundaries at the atomic level. It uses an atomic-level Nye tensor, representing the dislocation density. To calculate the Nye tensor at grain boundaries, we extend the Hartley-Mishin strain gradient calculation to the displacement shift complete lattice. We show that the method is effective in visualizing disconnections and the dislocation content of grain boundary phase junctions in body-centered cubic tungsten, as well as face-centered cubic copper. In addition, we use the method to characterize the morphology of a two-dimensional grain boundary phase nucleus in a symmetric tilt grain boundary in tungsten. This method can be applied to both bulk dislocations and grain boundary disconnections, which makes it ideal for studying the interactions and reactions of bulk dislocations with grain boundaries, and grain boundary disconnections.

cond-mat.mtrl-sci↗

arXiv2017

Fast algorithms for evaluating the stress field of dislocation lines in anisotropic elastic media

In dislocation dynamics (DD) simulations, the most computationally intensive step is the evaluation of the elastic interaction forces among dislocation ensembles. Because the pair-wise interaction between dislocations is long-range, this force calculation step can be significantly accelerated by the fast multipole method (FMM). We implemented and compared four different methods in isotropic and anisotropic elastic media: one based on the Taylor series expansion (Taylor FMM), one based on the spherical harmonics expansion (Spherical FMM), one kernel-independent method based on the Chebyshev interpolation (Chebyshev FMM), and a new kernel-independent method that we call the Lagrange FMM. The Taylor FMM is an existing method, used in ParaDiS, one of the most popular DD simulation softwares. The Spherical FMM employs a more compact multipole representation than the Taylor FMM does and is thus more efficient. However, both the Taylor FMM and the Spherical FMM are difficult to derive in anisotropic elastic media because the interaction force is complex and has no closed analytical formula. The Chebyshev FMM requires only being able to evaluate the interaction between dislocations and thus can be applied easily in anisotropic elastic media. But it has a relatively large memory footprint, which limits its usage. The Lagrange FMM was designed to be a memory-efficient black-box method. Various numerical experiments are presented to demonstrate the convergence and the scalability of the four methods.

physics.comp-ph↗

arXiv2013

Formation of the Smectic-B Crystal from a Simple Monatomic Liquid

We report a molecular dynamics simulation demonstrating that the Smectic B crystalline phase (Cr-B), commonly observed in mesogenic systems of anisotropic molecules, can be formed by a system of identical particles interacting via a spherically symmetric potential. The Cr-B phase forms as a result of a first order transition from an isotropic liquid phase upon isochoric cooling at appropriate number density. Its structure, determined by the design of the pair potential corresponds to Cr-B structure formed by elongated particles with the aspect ratio 1.8. The diffraction pattern, and the real-space structure inspection demonstrate dominance of the ABC-type of axial layer stacking. This result opens a general possibility of producing smectic phases using isotropic interparticle interaction both in simulations and in colloidal systems.

cond-mat.soft↗

arXiv2009

First-Passage Kinetic Monte Carlo method

We present a new efficient method for Monte Carlo simulations of diffusion-reaction processes. First introduced by us in [Phys. Rev. Lett., 97:230602, 2006], the new algorithm skips the traditional small diffusion hops and propagates the diffusing particles over long distances through a sequence of super-hops, one particle at a time. By partitioning the simulation space into non-overlapping protecting domains each containing only one or two particles, the algorithm factorizes the N-body problem of collisions among multiple Brownian particles into a set of much simpler single-body and two-body problems. Efficient propagation of particles inside their protective domains is enabled through the use of time-dependent Green's functions (propagators) obtained as solutions for the first-passage statistics of random walks. The resulting Monte Carlo algorithm is event-driven and asynchronous; each Brownian particle propagates inside its own protective domain and on its own time clock. The algorithm reproduces the statistics of the underlying Monte-Carlo model exactly. Extensive numerical examples demonstrate that for an important class of diffusion-reaction models the new algorithm is efficient at low particle densities, where other existing algorithms slow down severely.

cond-mat.mtrl-sci↗

arXiv2009

A First-Passage Kinetic Monte Carlo Algorithm for Complex Diffusion-Reaction Systems

We develop an asynchronous event-driven First-Passage Kinetic Monte Carlo (FPKMC) algorithm for continuous time and space systems involving multiple diffusing and reacting species of spherical particles in two and three dimensions. The FPKMC algorithm presented here is based on the method introduced in [Phys. Rev. Lett., 97:230602, 2006] and is implemented in a robust and flexible framework. Unlike standard KMC algorithms such as the n-fold algorithm, FPKMC is most efficient at low densities where it replaces the many small hops needed for reactants to find each other with large first-passage hops sampled from exact time-dependent Green's functions, without sacrificing accuracy. We describe in detail the key components of the algorithm, including the event-loop and the sampling of first-passage probability distributions, and demonstrate the accuracy of the new method. We apply the FPKMC algorithm to the challenging problem of simulation of long-term irradiation of metals, relevant to the performance and aging of nuclear materials in current and future nuclear power plants. The problem of radiation damage spans many decades of time-scales, from picosecond spikes caused by primary cascades, to years of slow damage annealing and microstructure evolution. Our implementation of the FPKMC algorithm has been able to simulate the irradiation of a metal sample for durations that are orders of magnitude longer than any previous simulations using the standard Object KMC or more recent asynchronous algorithms.

cond-mat.mtrl-sci↗