This article has multiple issues. Please help improve it or discuss these issues on the talk page . (Learn how and when to remove these messages )

•

This article may require cleanup to meet Wikipedia’s quality standards . The specific problem is: Needs more information to constitute a comprehensive timeline. Please help improve this article if you can. (May 2017) ( Learn how and when to remove this message )

•

This article may be in need of reorganization to comply with Wikipedia’s layout guidelines . Please help by editing the article to make improvements to the overall structure. (May 2017) ( Learn how and when to remove these messages )

( Learn how and when to remove this message )

Oh, joy. Another timeline. As if the universe isn’t already a relentless march of events. This particular chronicle, for those who insist on documenting everything, begins with the rather significant, if somewhat inevitable, arrival of the modern computer . A device that promised to make our lives easier, and instead, merely complicated them with unprecedented computational power, emerging from the simmering anxieties of the late interwar period. Because nothing says ‘progress’ like building complex machines right before humanity decides to tear itself apart again.

1930s

• The decade, a prelude to global unpleasantness, saw the quiet genesis of something truly disruptive. John Vincent Atanasoff and his graduate student, Clifford Berry , embarked on a project that would yield the Atanasoff–Berry Computer (ABC). This groundbreaking machine, operational from 1937 to 1942, holds the distinction of being the first electronic, non-programmable, digital computing device. While it lacked the versatility of later machines, its use of binary arithmetic and electronic switches instead of mechanical components laid crucial groundwork, proving that electronic computation was not merely a theoretical fantasy but a tangible, if somewhat temperamental, reality. A testament to ambition, even if the world was too busy bracing for impact to fully appreciate it.

1940s

• The 1940s, a decade defined by global conflict and its grim aftermath, paradoxically accelerated the development of computational physics. With the urgent demands of wartime research, particularly in the realm of weaponry, computational capabilities were pushed to their limits. This era saw the genesis of critical nuclear bomb simulations at the now-legendary Los Alamos National Laboratory , alongside sophisticated ballistics simulations conducted at the Ballistic Research Laboratory (BRL). These were not mere academic exercises; they were computational endeavors with immediate, world-altering consequences, laying the foundation for modern scientific computing under immense pressure. [Note 1]
• It was within this crucible of necessity that the Monte Carlo simulation truly came into its own. Voted one of the top 10 algorithms of the 20th century by luminaries such as Jack Dongarra and Francis Sullivan in the 2000 issue of Computing in Science and Engineering [1], this ingenious method was conceived and developed at Los Alamos National Laboratory . The principal architects behind this probabilistic marvel were the brilliant minds of John von Neumann , Stanislaw Ulam , and Nicholas Metropolis . Their work provided a powerful, if somewhat counterintuitive, approach to solving complex problems by using random sampling, particularly crucial for understanding neutron diffusion in fissile materials where deterministic methods proved intractable. It’s almost poetic how randomness became a tool for precision in the face of the incomprehensible. [2] [3] [4]
• Concurrently, the first comprehensive hydrodynamic simulations were performed, also at Los Alamos National Laboratory . These early ventures into modeling fluid motion, particularly crucial for understanding shockwaves and explosions, represented a significant leap forward in applying nascent computing power to complex physical phenomena. The stakes, as one might imagine, were rather high, ensuring a rapid, if somewhat brutal, learning curve for the pioneers in this field. [5] [6]
• Towards the close of the decade, the fertile intellectual ground of Los Alamos also saw Stanislaw Ulam and John von Neumann introduce the foundational notion of cellular automata . This abstract framework, which models complex systems as collections of simple, interacting cells, would later prove immensely influential across various scientific disciplines, from biology to cosmology, demonstrating that even simple rules can generate astonishing complexity. A fitting metaphor for the universe, perhaps, or merely for human endeavors. [7] [8]

1950s

• The 1950s ushered in a new era of computational sophistication, building on the wartime foundations. A landmark publication, “Equations of State Calculations by Fast Computing Machines ,” introduced what would become known as the Metropolis–Hastings algorithm . This generalization of the original Monte Carlo method allowed for efficient sampling from complex probability distributions, becoming an indispensable tool in statistical physics and beyond. It’s worth noting the important, albeit initially overlooked, independent work contributed by Berni Alder and Stan Frankel in this domain. Their insights, unfortunately, faced a less-than-enthusiastic reception from Alder’s thesis advisor, leading to a regrettable delay in their full recognition. A common enough tragedy in the annals of science, proving that brilliance isn’t always immediately appreciated. [Note 2] [9] [10] [11]
• In a fascinating display of computational discovery, Enrico Fermi , Stanislaw Ulam , and John Pasta , with invaluable assistance from Mary Tsingou in programming the MANIAC I computer, stumbled upon the now-famous Fermi–Pasta–Ulam-Tsingou problem . Their numerical experiments on a chain of non-linearly coupled oscillators revealed a surprising recurrence of initial states rather than the expected equipartition of energy, challenging existing assumptions about thermalization and foreshadowing the later development of chaos theory and solitons. It seems even the most brilliant minds can be surprised by what the machines reveal. [12]
• This decade also marked the initiation of significant research into percolation theory . This mathematical framework, dealing with the connectivity of random graphs, found immediate application in understanding phenomena from fluid flow through porous media to the spread of diseases. It’s a concept that proves some things, like knowledge, tend to spread in unpredictable, often inconvenient, ways. [13]
• Further solidifying the foundations of computational materials science, the powerful method of Molecular dynamics was formally articulated by Berni Alder and Tom E. Wainwright. This approach simulates the physical movements of atoms and molecules, allowing researchers to study the time-dependent behavior of complex systems. It offered an unprecedented atomic-level view into the properties of matter, moving beyond statistical averages to observe the actual dance of particles. [14]

1960s

• The 1960s, a time of grand ambitions in space exploration, saw computational physics contribute directly to humanity’s reach for the stars. Through exhaustive computational investigations into the notoriously complex 3-body problem , Michael Minovitch formulated the elegant and energy-saving gravity assist method. This technique, which uses the gravitational pull of planets to alter a spacecraft’s trajectory and speed, proved absolutely crucial for deep-space missions like Voyager, proving that sometimes the best way to get somewhere is to let a massive celestial body do most of the work for you. [15] [16]
• In the realm of statistical mechanics, Roy J. Glauber introduced Glauber dynamics for the Ising model . This kinetic Monte Carlo method describes the time evolution of magnetic spins, providing a theoretical framework to understand how systems approach equilibrium. It’s a subtle dance of probabilities, governing how microscopic states shift and settle, often with an almost existential slowness. [17]
• A pivotal moment for our understanding of complex systems occurred when Edward Lorenz , using a simplified atmospheric model on a computer, inadvertently discovered the butterfly effect . His observation that minuscule changes in initial conditions could lead to vastly different long-term outcomes for weather patterns profoundly attracted interest in chaos theory . It was a stark, computational revelation: the universe, at least in some aspects, is far less predictable than we’d prefer to believe, and a butterfly flapping its wings really can, in a cosmic sense, cause a hurricane. [18]
• Remarkably, the concept of Molecular dynamics was independently invented and further developed by Aneesur Rahman . His seminal work on liquid argon demonstrated the power of MD simulations to accurately reproduce experimental results, solidifying its place as a fundamental tool for understanding condensed matter physics. It seems brilliant ideas often have a way of surfacing in multiple places, much like unpleasant memories. [19]
• This decade also saw Walter Kohn instigate the foundational development of density functional theory (DFT), working alongside L.J. Sham and Pierre Hohenberg . DFT revolutionized quantum chemistry and condensed matter physics by providing a practical method to calculate the electronic structure of multi-electron systems based solely on their electron density, rather than their far more complex many-body wave function. This elegant simplification earned Kohn a share of the Nobel Chemistry Prize in 1998, proving that sometimes, the most profound insights come from making things less complicated. [20] [21] [22]
• Building upon the intriguing findings of the Fermi–Pasta–Ulam problem , Martin Kruskal and Norman Zabusky conducted further numerical experiments that led them to coin the term “soliton .” These remarkable, self-reinforcing solitary waves maintain their shape while propagating at a constant velocity, defying the usual dispersive tendencies of waves. Their discovery opened up entirely new fields of research in non-linear physics, proving that some things, unlike most human relationships, can maintain their integrity over vast distances. [23] [24]
• Another significant development for the Ising model was the invention of Kawasaki dynamics . Unlike Glauber dynamics, which involves single spin flips, Kawasaki dynamics introduces a conserved magnetization by allowing exchanges between neighboring spins. This provided a crucial tool for modeling systems where particle number or magnetization is conserved, offering a more nuanced view of dynamic processes. [25]
• Finally, Loup Verlet (re)discovered a numerical integration algorithm that bears his name, or sometimes the more verbose Verlet-Störmer method. This efficient and stable algorithm is widely used in molecular dynamics simulations for integrating Newton’s equations of motion. While Verlet’s formulation was highly influential, it turns out the method had a rather long and storied history, with earlier uses dating back to 1791 by Jean Baptiste Delambre , and later by P. H. Cowell and A. C. C. Crommelin in 1909, and even Carl Fredrik Störmer in 1907. It seems that good ideas, like bad habits, tend to resurface repeatedly. Verlet also introduced the concept of the Verlet list, an optimization technique that significantly speeds up calculations by tracking nearby particles. [26] [27]

1970s

• The 1970s saw computer algebra systems begin to flex their muscles, demonstrating a capacity to tackle problems previously considered the exclusive domain of human ingenuity and painstaking manual calculation. A prime example was the replication of Boris Delaunay ’s monumental work in Lunar theory . Delaunay’s original calculations, detailing the intricate gravitational interactions governing the Moon’s orbit, spanned decades and filled volumes. Computer algebra systems proved they could perform these complex symbolic manipulations, not just numerical ones, thereby validating their utility in theoretical physics and astronomy. It appears even the most tedious intellectual labor can eventually be outsourced to machines, much to the chagrin of those who enjoyed the suffering. [28] [29] [30] [31] [32]
• At CERN , the European Organization for Nuclear Research, Martinus Veltman ’s meticulous and extensive computer calculations proved instrumental in providing him and Gerard ’t Hooft with invaluable insights into the renormalizability of electroweak theory . Their work demonstrated how to consistently calculate quantum corrections in the electroweak force, a crucial step towards a unified theory of fundamental interactions. The sheer scale and complexity of these computations, which would have been impossible without the burgeoning power of computers, were cited as a key reason for the well-deserved award of the Nobel Physics Prize to both scientists. It’s a stark reminder that sometimes, the Nobel committee recognizes the subtle art of making the impossible merely difficult. [33] [34]
• A novel approach to fluid dynamics emerged with Jean Hardy, Yves Pomeau , and Olivier de Pazzis introducing the first lattice gas model . Abbreviated as the HPP model after its authors, this cellular automaton-based method simulated fluid flow by tracking the movement and collisions of discrete particles on a grid. While initially simplistic, these models later evolved into the more sophisticated and computationally efficient lattice Boltzmann models , providing a new paradigm for simulating complex fluid behaviors. [35] [36]
• A monumental theoretical breakthrough with profound computational implications came from Kenneth G. Wilson . He demonstrated that continuum quantum chromodynamics (QCD), the theory describing the strong nuclear force, could be recovered from a discrete, infinitely large lattice where the sites were infinitesimally close to one another. This foundational insight effectively inaugurated the field of lattice QCD , allowing physicists to perform ab initio calculations of hadronic properties and strong interaction phenomena using numerical methods, a feat previously considered intractable. It opened the door to simulating the very fabric of matter, one lattice point at a time. [37]

1980s

• The 1980s, a decade of increasing computational power and algorithmic ingenuity, saw further refinement and expansion in computational physics. Italian physicists Roberto Car and Michele Parrinello introduced the revolutionary Car–Parrinello method . This innovative approach unified molecular dynamics simulations with density functional theory calculations, allowing for ab initio molecular dynamics where interatomic forces are calculated directly from the electronic structure at each time step. This breakthrough enabled the simulation of complex chemical reactions and material properties with unprecedented accuracy, bridging the gap between quantum mechanics and classical dynamics. [38]
• In the persistent quest for more efficient Monte Carlo simulations, the Swendsen–Wang algorithm was invented. This clustering algorithm dramatically reduced critical slowing down in simulations of spin systems, particularly near phase transitions, by updating entire clusters of correlated spins simultaneously. Its introduction marked a significant improvement in the ability to accurately model and understand critical phenomena in statistical physics. [39]
• Another algorithm that earned its place among the “top 10 algorithms of the 20th century” was the Fast multipole method , developed by Vladimir Rokhlin and Leslie Greengard . This ingenious numerical technique efficiently calculates long-range forces (like gravity or electromagnetism) in systems with a large number of particles. By judiciously approximating interactions between distant groups of particles, it reduced the computational complexity from a prohibitive O(N²) to a much more manageable O(N), thereby enabling simulations of unprecedented scale in fields ranging from astrophysics to molecular dynamics. It’s a testament to the fact that sometimes, working smarter, not harder, actually pays off. [40] [41] [42]
• Concluding the decade with another impactful contribution to statistical physics and Monte Carlo simulation, Ullli Wolff invented the Wolff algorithm . Similar in spirit to the Swendsen-Wang algorithm, the Wolff algorithm also employs cluster updates, offering a highly efficient method for simulating various spin models, particularly the Ising and Potts models. It further refined the art of overcoming critical slowing down, allowing for more robust and accurate exploration of phase transitions and critical phenomena. [43]

See also

• Timeline of scientific computing
• Computational physics
• Important publications in computational physics

Notes

• ^ Ballistic Research Laboratory , Aberdeen Proving Grounds , Maryland.
• ^ Unfortunately, Alder’s thesis advisor was unimpressed, so Alder and Frankel delayed publication of their results until much later.