Timeline of scientific computing
The following is a timeline of scientific computing, also known as computational science.
Before modern computers
18th century
- The French naturalist Comte de Buffon poses his needle problem in 1733; generalized to the Buffon-Laplace problem, and then further into Clean Tile Problem.[1][2]
19th century
- Lovelace's note G on the Analytical Engine (1842) describes an algorithm for generating Bernoulli numbers. It is considered the first algorithm ever specifically tailored for implementation on a computer, and thus the first-ever computer programme.[3][4] The engine was never completed, however, so her code was never tested.[5]
1900s
- MW Kutta and CT Runge invent the Runge-Kutta method.[6][7]
1920s
- Richardson introduces numerical weather forecasting by manual calculation.[8]
- Douglas Hartree creates the first ab-initio method.
1930s
This decade marks the first major strides to a modern computer, and hence the start of the modern era.
- Fermi's Rome physics research group (informal name I ragazzi di Via Panisperna) develop statistical algorithms based on Comte de Buffon's work, that would later become the foundation of the Monte Carlo method. See also FERMIAC.
- John Vincent Atanasoff and Clifford Berry create the first electronic non-programmable, digital computing device, the Atanasoff–Berry Computer, from 1937-42.
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.[9][10][11]
- George Dantzig introduces the simplex method (voted one of the top 10 algorithms of the 20th century) in 1947.[12]
- Ulam and von Neumann introduce the notion of cellular automata.[13]
- Turing formulated the LU decomposition method.[14]
- Philips creates (invents?) the MONIAC hydraulic computer at LSE, better known as "Philip's Economic Computer".[15][16]
1950s
- First successful weather predictions on a computer occurred.[17][18]
- 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.[19][20][21][22] Voted one of the top 10 algorithms of the 20th century.
- Equations of State Calculations by Fast Computing Machines introduces the Metropolis–Hastings algorithm.[23]
- Molecular dynamics invented by Bernie Alder and Wainwright [24][25]
- Householder invents his eponymous matrices and transformation method (voted one of the top 10 algorithms of the 20th century).[26]
- John G.F. Francis[27] and Vera Kublanovskaya[28] 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,[29] to describe the methods of Courant, Hrenikoff and Zienkiewicz, among others. See also here.
- Edward Lorenz discovers the butterfly effect on a computer, attracting interest in chaos theory.[30]
- Molecular dynamics invented independently by Aneesur Rahman.[31]
- Fast Fourier Transform (voted one of the top 10 algorithms of the 20th century) invented by Cooley and Tukey.[32]
1970s
- Mandelbrot, from studies of the Fatou, Julia and Mandelbrot sets, coined and popularized the term 'fractal' to describe these structures' self-similarity.[33][34]
- Kenneth Appel and Wolfgang Haken prove the four colour theorem, the first theorem to be proved by computer.[35][36][37]
1980s
- Fast multipole method (voted one of the top 10 algorithms of the 20th century) invented by Rokhlin and Leslie Greengard.[38][39][40]
1990s
- In computational genomics and sequence analysis, the Human Genome Project, an endeavour to sequence the entire human genome, begins in 1990.
- Kepler conjecture is almost all but certainly proved algorithmically by Thomas Hales in 1998.
2000s
- The Human Genome Project completes a rough draft of human genome in 2000.
- The Human Genome Project completed in 2003.
Miscelleaneous
- Technology and Society
- Tim Berners-Lee created Hypertext Transfer Protocol (HTTP) and the World Wide Web in 1989 and 1990 respectively, while working at CERN.
- The world's first graphical internet browser, Mosaic released at the National Center for Supercomputing Applications (NCSA) at the University of Illinois Urbana-Champaign, in 1993.[41]
See also
- Scientific computing
- History of computing
- Timeline of computing
- History of mathematics
- Timeline of mathematics
- Timeline of algorithms
- History of computing hardware
- Timeline of modern scientific computing
References
- ↑ Buffon, G. Editor's note concerning a lecture given 1733 by Mr. Le Clerc de Buffon to the Royal Academy of Sciences in Paris. Histoire de l'Acad. Roy. des Sci., pp. 43-45, 1733; according to Weisstein, Eric W. "Buffon's Needle Problem." From MathWorld--A Wolfram Web Resource. 20 Dec 2012 20 Dec 2012.
- ↑ Buffon, G. "Essai d'arithmétique morale." Histoire naturelle, générale er particulière, Supplément 4, 46-123, 1777; according to Weisstein, Eric W. "Buffon's Needle Problem." From MathWorld--A Wolfram Web Resource. 20 Dec 2012
- ↑ Simonite, Tom (24 March 2009). "Short Sharp Science: Celebrating Ada Lovelace: the 'world's first programmer'". New Scientist. Retrieved 14 April 2012.
- ↑ http://www.newyorker.com/online/blogs/books/2013/08/tom-stoppards-arcadia-at-twenty.html
- ↑
- ↑ MW Kutta (1900). "Beiträge zur näherungsweisen Integration totaler Differentialgleichungen" [Contributions to the approximate integration of total differential equations] (in German). Thesis, University of Munich.
- "Reprinted", Z. Math. Phys. 46, 1901: 435–453 and in B.G Teubner, 1901.
- ↑ Runge, C., "Über die numerische Auflösung von Differentialgleichungen" [About the numerical solution of differential equations](in German), Math. Ann. 46 (1895) 167-178.
- ↑ L F Richardson, Weather Prediction by Numerical Process. Cambridge University Press (1922).
- ↑ Metropolis, N. (1987). "The Beginning of the Monte Carlo method". Los Alamos Science. No. 15, Page 125.. Accessed 5 may 2012.
- ↑ S. Ulam, R. D. Richtmyer, and J. von Neumann(1947). Statistical methods in neutron diffusion. Los Alamos Scientific Laboratory report LAMS–551.
- ↑ N. Metropolis and S. Ulam (1949). The Monte Carlo method. Journal of the American Statistical Association 44:335-341.
- ↑ "SIAM News, November 1994.". Retrieved 6 June 2012. Systems Optimization Laboratory, Stanford University Huang Engineering Center (site host/mirror).
- ↑ Von Neumann, J., Theory of Self-Reproduiing Automata, Univ. of Illinois Press, Urbana, 1966.
- ↑ A. M. Turing, Rounding-off errors in matrix processes. Quart. J Mech. Appl. Math. 1 (1948), 287–308 (according to Poole, David (2006), Linear Algebra: A Modern Introduction (2nd ed.), Canada: Thomson Brooks/Cole, ISBN 0-534-99845-3.) .
- ↑ The computer model that once explained the British economy. Larry Elliott, The Guardian, Thursday 8 May 2008.
- ↑ Phillip's Economic Computer, 1949. Exhibit at London Science Museum.
- ↑ Charney, J.; Fjørtoft, R.; von Neumann, J. (November 1950). "Numerical Integration of the Barotropic Vorticity Equation". Tellus 2 (4).
- ↑ See the review article:- Smagorinsky, J (1983). "The Beginnings of Numerical Weather Prediction and General Circulation Modelling: Early Recollections". Advances in Geophysics 25. Retrieved 6 June 2012.
- ↑ Magnus R. Hestenes and Eduard Stiefel, Methods of Conjugate Gradients for Solving Linear Systems, J. Res. Natl. Bur. Stand. 49, 409-436 (1952).
- ↑ Eduard Stiefel,U¨ ber einige Methoden der Relaxationsrechnung (in German), Z. Angew. Math. Phys. 3, 1-33 (1952).
- ↑ Cornelius Lanczos, Solution of Systems of Linear Equations by Minimized Iterations, J. Res. Natl. Bur. Stand. 49, 33-53 (1952).
- ↑ Cornelius Lanczos, An Iteration Method for the Solution of the Eigenvalue Problem of Linear Differential and Integral Operators, J. Res. Natl. Bur. Stand. 45, 255-282 (1950).
- ↑ Metropolis, N.; Rosenbluth, A.W.; Rosenbluth, M.N.; Teller, A.H.; Teller, E. (1953): Equations of State Calculations by Fast Computing Machines (Retrieved 3 May 2012). Journal of Chemical Physics 21 (6): 1087–1092. Bibcode 1953JChPh..21.1087M. doi:10.1063/1.1699114.
- ↑ B. J. Alder and T. E. Wainwright (1957). "Phase Transition for a Hard Sphere System". J. Chem. Phys. 27 (5): 1208. doi:10.1063/1.1743957.
- ↑ B. J. Alder and T. E. Wainwright (1962). "Phase Transition in Elastic Disks". Phys. Rev. 127 (2): 359–361. doi:10.1103/PhysRev.127.359.
- ↑ Householder, A. S. (1958). "Unitary Triangularization of a Nonsymmetric Matrix". Journal of the ACM 5 (4): 339–342. doi:10.1145/320941.320947. MR 0111128.
- ↑ J.G.F. Francis, "The QR Transformation, I", The Computer Journal, 4(3), pages 265–271 (1961, received October 1959) online at oxfordjournals.org;J.G.F. Francis, "The QR Transformation, II" The Computer Journal, 4(4), pages 332–345 (1962) online at oxfordjournals.org.
- ↑ Vera N. Kublanovskaya (1961), "On some algorithms for the solution of the complete eigenvalue problem," USSR Computational Mathematics and Mathematical Physics, 1(3), pages 637–657 (1963, received Feb 1961). Also published in: Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki [Journal of Computational Mathematics and Mathematical Physics], 1(4), pages 555–570 (1961).
- ↑ RW Clough, “The Finite Element Method in Plane Stress Analysis,” Proceedings of 2nd ASCE Conference on Electronic Computation, Pittsburgh, PA, Sept. 8, 9, 1960.
- ↑ Lorenz, Edward N. (1963). "Deterministic Nonperiodic Flow". Journal of the Atmospheric Sciences 20 (2): 130–141.
- ↑ Rahman, A (1964). "Correlations in the Motion of Atoms in Liquid Argon". Phys Rev 136 (2A): A405–A41. doi:10.1103/PhysRev.136.A405.
- ↑ Cooley, James W., and John W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Comput. 19, 297–301 (1965).
- ↑ B. Mandelbrot; Les objets fractals, forme, hasard et dimension (in French). Publisher: Flammarion (1975), ISBN ISBN 9782082106474 ; English translation Fractals: Form, Chance and Dimension. Publisher: Freeman, W. H & Company. (1977). ISBN 9780716704737.
- ↑ Mandelbrot, Benoît B.; (1983). The Fractal Geometry of Nature. San Francisco: W.H. Freeman. ISBN 0-7167-1186-9.
- ↑ Kenneth Appel and Wolfgang Haken, "Every planar map is four colorable, Part I: Discharging," Illinois Journal of Mathematics 21: 429–490, 1977.
- ↑ Appel, K. and Haken, W. "Every Planar Map is Four-Colorable, II: Reducibility." Illinois J. Math. 21, 491-567, 1977.
- ↑ Appel, K. and Haken, W. "The Solution of the Four-Color Map Problem." Sci. Amer. 237, 108-121, 1977.
- ↑ L. Greengard, The Rapid Evaluation of Potential Fields in Particle Systems, MIT, Cambridge, (1987).
- ↑ Rokhlin, Vladimir (1985). "Rapid Solution of Integral Equations of Classic Potential Theory." J. Computational Physics Vol. 60, pp. 187-207.
- ↑ L. Greengard and V. Rokhlin, "A fast algorithm for particle simulations," J. Comput. Phys., 73 (1987), no. 2, pp. 325–348.
- ↑ NCSA Mosaic. National Center for Supercomputing Applications homepage. Retrieved 11 Nov 2012.
External links
- SIAM (Society for Industrial and Applied Mathematics) News. Top 10 Algorithms of the 20th Century.
- The History of Numerical Analysis and Scientific Computing @ SIAM (Society for Industrial and Applied Mathematics)
- Jacqueline Ruttimann. 2020 computing: Milestones in scientific computing (HTML document) and (PDF link). Nature 440, 399-405 (23 March 2006), doi:10.1038/440399a. Nature.com news feature; recovered 20 Oct 2012.
- Anderson, H. L. Scientific Uses of the MANIAC and alternate link(recovered 20 Oct 2012). Journal of Statistical Physics, Volume 43, Issue 5-6, pp. 731–748. doi:10.1007/BF02628301.