Light

oxzoid / timeline-of-computational-mathematics Goto Github PK

View Code? Open in Web Editor NEW

This project forked from manjunath5496/timeline-of-computational-mathematics

0.0 0.0 0.0 4 KB

"The fact that we live at the bottom of a deep gravity well, on the surface of a gas covered planet going around a nuclear fireball 90 million miles away and think this to be normal is obviously some indication of how skewed our perspective tends to be." ― Douglas Adams

timeline-of-computational-mathematics's Introduction

Timeline of computational mathematics

1940s

Monte Carlo simulation (voted one of the top 10 algorithms of the 20th century) invented at Los Alamos by von Neumann, Ulam and Metropolis.
Dantzig introduces the simplex algorithm (voted one of the top 10 algorithms of the 20th century).
First hydro simulations at Los Alamos occurred.
Ulam and von Neumann introduce the notion of cellular automata.
A routine for the Manchester Baby written to factor a large number (2¹⁸), one of the first in computational number theory. The Manchester group would make several other breakthroughs in this area.
LU decomposition technique first discovered.

1950s

Hestenes, Stiefel, and Lanczos, all from the Institute for Numerical Analysis at the National Bureau of Standards, initiate the development of Krylov subspace iteration methods. Voted one of the top 10 algorithms of the 20th century.
Equations of State Calculations by Fast Computing Machines introduces the Metropolis–Hastings algorithm. Also, important earlier independent work by Alder and S. Frankel.
Enrico Fermi, Stanislaw Ulam, John Pasta, and Mary Tsingou, discover the Fermi–Pasta–Ulam–Tsingou problem.
In network theory, Ford & Fulkerson compute a solution to the maximum flow problem.
Householder invents his eponymous matrices and transformation method (voted one of the top 10 algorithms of the 20th century).
Molecular dynamics invented by Alder and Wainwright
John G.F. Francis and Vera Kublanovskaya invent QR factorization (voted one of the top 10 algorithms of the 20th century).

1960s

First recorded use of the term "finite element method" by Ray Clough, to describe the methods of Courant, Hrenikoff and Zienkiewicz, among others. See also here.
Using computational investigations of the 3-body problem, Minovitch formulates the gravity assist method.
Molecular dynamics was invented independently by Aneesur Rahman.
Cooley and Tukey re-invent the Fast Fourier transform (voted one of the top 10 algorithms of the 20th century), an algorithm first discovered by Gauss.
Edward Lorenz discovers the butterfly effect on a computer, attracting interest in chaos theory.
Kruskal and Zabusky follow up the Fermi–Pasta–Ulam–Tsingou problem with further numerical experiments, and coin the term "soliton".
Birch and Swinnerton-Dyer conjecture formulated through investigations on a computer.
Grobner bases and Buchberger's algorithm invented for algebra
Frenchman Verlet (re)discovers a numerical integration algorithm, (first used in 1791 by Delambre, by Cowell and Crommelin in 1909, and by Carl Fredrik Störmer in 1907, hence the alternative names Störmer's method or the Verlet-Störmer method) for dynamics.
Risch invents algorithm for symbolic integration.

1970s

Computer algebra replicates and extends the work of Delaunay in lunar theory.
Mandelbrot, from studies of the Fatou, Julia and Mandelbrot sets, coined and popularized the term 'fractal' to describe these structures' self-similarity.
Kenneth Appel and Wolfgang Haken prove the four colour theorem, the first theorem to be proved by computer.

1980s

Fast multipole method invented by Rokhlin and Greengard (voted one of the top 10 algorithms of the 20th century).

1990s

The appearance of the first research grids using volunteer computing – GIMPS (1996) and distributed.net (1997).
Kepler conjecture is almost all but certainly proved algorithmically by Thomas Hales in 1998.

2000s

In computational group theory, God's number is shown to be 20.
Mathematicians completely map the E8-group.

2010s

Hales completes the proof of Kepler's conjecture.

timeline-of-computational-mathematics's People

Contributors

Recommend Projects

React

A declarative, efficient, and flexible JavaScript library for building user interfaces.
Vue.js

🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
Typescript

TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
TensorFlow

An Open Source Machine Learning Framework for Everyone
Django

The Web framework for perfectionists with deadlines.
Laravel

A PHP framework for web artisans
D3

Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

javascript

JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
web

Some thing interesting about web. New door for the world.
server

A server is a program made to process requests and deliver data to clients.
Machine learning

Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Visualization

Some thing interesting about visualization, use data art
Game

Some thing interesting about game, make everyone happy.

Recommend Org

Facebook

We are working to build community through open source technology. NB: members must have two-factor auth.
Microsoft

Open source projects and samples from Microsoft.
Google

Google ❤️ Open Source for everyone.
Alibaba

Alibaba Open Source for everyone
D3

Data-Driven Documents codes.
Tencent

China tencent open source team.