Daniel B. Miracle

Bio: Daniel B. Miracle is an academic researcher from Air Force Research Laboratory. The author has contributed to research in topics: Alloy & Microstructure. The author has an hindex of 66, co-authored 256 publications receiving 22106 citations. Previous affiliations of Daniel B. Miracle include Wright Laboratory & Wright-Patterson Air Force Base.

A structural model for metallic glasses

Abstract: Despite the intense interest in metallic glasses for a variety of engineering applications, many details of their structure remain a mystery. Here, we present the first compelling atomic structural model for metallic glasses. This structural model is based on a new sphere-packing scheme—the dense packing of atomic clusters. Random positioning of solvent atoms and medium-range atomic order of solute atoms are combined to reproduce diffraction data successfully over radial distances up to ∼1 nm. Although metallic glasses can have any number of chemically distinct solute species, this model shows that they contain no more than three topologically distinct solutes and that these solutes have specific and predictable sizes relative to the solvent atoms. Finally, this model includes defects that provide richness to the structural description of metallic glasses. The model accurately predicts the number of solute atoms in the first coordination shell of a typical solvent atom, and provides a remarkable ability to predict metallic-glass compositions accurately for a wide range of simple and complex alloys.

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

Fast parallel algorithms for short-range molecular dynamics

Abstract: Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.