Related Experiment Video
Updated: Aug 14, 2026

Methods of Ex Situ and In Situ Investigations of Structural Transformations: The Case of Crystallization of Metallic Glasses
Published on: June 7, 2018
Maximally fast coarsening algorithms
Mowei Cheng1, Andrew D Rutenberg
1Department of Physics and Atmospheric Science, Dalhousie University, Halifax, Nova Scotia, Canada B3H 3J5. mowei.cheng@nist.gov
Abstract:
We present maximally fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time step Deltat=At2/3s. We compare the scaling structure obtained from our maximally fast conserved systems directly against the standard fixed time-step Euler algorithm, and find that the error scales as square root of A--so arbitrary accuracy can be achieved. For nonconserved systems, only effectively finite time steps are accessible for similar unconditionally stable algorithms.
Related Concept Videos
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Gene Evolution - Fast or Slow?
In contrast, regions which code...
Gene Evolution - Fast or Slow?
In contrast, regions which code...
Methods of Medium Optimization
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...
