Timeline of modern scientific computing
The following timeline starts with the invention of the modern computer in the late interwar period. For a fuller picture of the development of scientific computing (also known as computational science), see timeline of scientific computing article.
1930s
- 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.[1][2][3]
- First hydro simulations occurred at Los Alamos.[4][5]
- George Dantzig introduces the simplex method (voted one of the top 10 algorithms of the 20th century) in 1947.[6]
- Ulam and von Neumann introduce the notion of cellular automata.[7]
- Turing formulated the LU decomposition method.[8]
1950s
- First successful weather predictions on a computer occurred.[9][10]
- 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.[11][12][13][14] Voted one of the top 10 algorithms of the 20th century.
- A team led by Backus develops the FORTRAN compiler and programming language at IBM's research centre in San Jose, California. This sped the adoption of scientific programming,[15][16][17] and is one of the oldest extant programming languages, as well as one of the most popular in science and engineering.
- "Equations of State Calculations by Fast Computing Machines" introduces the Metropolis–Hastings algorithm.[18]
- Fermi, Ulam and Pasta with help from Mary Tsingou, discover the Fermi–Pasta–Ulam problem.[19]
- Molecular dynamics invented by Bernie Alder and Wainwright [20][21]
- Householder invents his eponymous matrices and transformation method (voted one of the top 10 algorithms of the 20th century).[22]
- John G.F. Francis [23][24] and Vera Kublanovskaya[25] 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,[26] 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.[27][28]
- Edward Lorenz discovers the butterfly effect on a computer, attracting interest in chaos theory.[29]
- Molecular dynamics invented independently by Aneesur Rahman.[30]
- Fast Fourier Transform (voted one of the top 10 algorithms of the 20th century) invented by Cooley and Tukey.[31]
- W Kohn instigates the development of density functional theory (with LJ Sham and P Hohenberg),[32][33] for which he shares the Nobel Chemistry Prize (1998).[34] This contribution is arguably the first Nobel given for a computer programme or computational technique.
1970s
- Mandelbrot, from studies of the Fatou, Julia and Mandelbrot sets, coined and popularized the term 'fractal' to describe these structures' self-similarity.[35][36]
- Kenneth Appel and Wolfgang Haken prove the four colour theorem, the first theorem to be proved by computer.[37][38][39]
1980s
- Fast multipole method (voted one of the top 10 algorithms of the 20th century) invented by Rokhlin and Leslie Greengard.[40][41][42]
1990s
- In computational genomics and sequence analysis, the Human Genome Project, an endeavour to sequence the entire human genome, begins in 1990.
- The appearance of the first research grids using volunteer computing - GIMPS (1996), distributed.net (1997) and Seti@Home (1999).
- 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 BOINC architecture is launched in 2002.
- The Human Genome Project completed in 2003.
Miscellaneous
- 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.[43]
Key organisations
By (research/non-review) publications:
- Los Alamos (7): Ulam et al. 1947; Metropolis & Ulam 1949; Richtmyer 1948; v. Neumann & Richtmyer 1950; Metropolis et al. 1953, Fermi et al. 1955; v. Neumann 1966.
- NIST (4): Hestenes & Stiefel 1952, Stiefel 1952, and Lanczos 1950, 1952.
By (unique) authors/innovators:
- IBM (2): Backus et al., Mandelbrot.
- Los Alamos (11): Fermi; Metropolis (2 pub.s); Pasta; Richtmeyer (3 pub.s); Rosenbluth, A.W.; Rosenbluth, M.N.; Teller, A.H.; Teller, E.; Tsingou; Ulam (3 pub.s); v. Neumann (4 pub.s);
- NIST(3): Hestenes, Lanczos(2 pub.s), Stiefel(2 pub.s).
See also
- Scientific computing
- Timeline of scientific computing
- Timeline of computing
- History of computing
- Timeline of algorithms
- Timeline of computational mathematics
- Timeline of computational physics
References
- ↑ Metropolis, N. (1987). "The Beginning of the Monte Carlo method" (PDF). 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.
- ↑ Metropolis, N.; Ulam, S. (1949). "The Monte Carlo method". Journal of the American Statistical Association. 44: 335–341. doi:10.1080/01621459.1949.10483310.
- ↑ Richtmyer, R. D. (1948). Proposed Numerical Method for Calculation of Shocks. Los Alamos, NM: Los Alamos Scientific Laboratory LA-671.
- ↑ Von Neumann, J.; Richtmyer, R. D. (1950). "A Method for the Numerical Calculation of Hydrodynamic Shocks". Journal of Applied Physics. 21: 232–237. doi:10.1063/1.1699639.
- ↑ "SIAM News, November 1994". Retrieved 6 June 2012. Hosted at Systems Optimization Laboratory, Stanford University, Huang Engineering Center.
- ↑ 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.) .
- ↑ Charney, J.; Fjørtoft, R.; von Neumann, J. (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" (PDF). 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).
- ↑ W.W. McDowell Award citation: "W. Wallace McDowell Award". Retrieved April 15, 2008.
- ↑ National Medal of Science citation: "The President's National Medal of Science: John Backus". National Science Foundation. Retrieved March 21, 2007.
- ↑ "ACM Turing Award Citation: John Backus". Association for Computing Machinery. Archived from the original on February 4, 2007. Retrieved March 22, 2007.
- ↑ Metropolis, N.; Rosenbluth, A.W.; Rosenbluth, M.N.; Teller, A.H.; Teller, E. (1953). "Equations of State Calculations by Fast Computing Machines" (PDF). Journal of Chemical Physics. 21 (6): 1087–1092. doi:10.1063/1.1699114.
- ↑ Fermi, E. (posthumously); Pasta, J.; Ulam, S. (1955) : Studies of Nonlinear Problems (accessed 25 Sep 2012). Los Alamos Laboratory Document LA-1940. Also appeared in 'Collected Works of Enrico Fermi', E. Segre ed. , University of Chicago Press, Vol.II,978–988,1965. Recovered 21 Dec 2012
- ↑ Alder, B. J.; Wainwright, T. E. (1957). "Phase Transition for a Hard Sphere System". J. Chem. Phys. 27 (5): 1208. doi:10.1063/1.1743957.
- ↑ Alder, B. J.; Wainwright, T. E. (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, 1961 "The QR Transformation, I", The Computer Journal, vol. 4, no. 3, pages 265-271 online at oxfordjournals.org
- ↑ J.G.F. Francis, 1962 "The QR Transformation, II" The Computer Journal, vol. 4, no. 4, pages 332-345 online
- ↑ 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.
- ↑ Minovitch, Michael: "A method for determining interplanetary free-fall reconnaissance trajectories," Jet Propulsion Laboratory Technical Memo TM-312-130, pages 38-44 (23 August 1961).
- ↑ Christopher Riley and Dallas Campbell, Oct 22, 2012. "The maths that made Voyager possible". BBC News Science and Environment. Recovered 16 Jun 2013.
- ↑ Lorenz, Edward N. (1963). "Deterministic Nonperiodic Flow" (PDF). Journal of the Atmospheric Sciences. 20 (2): 130–141. doi:10.1175/1520-0469(1963)020<0130:dnf>2.0.co;2.
- ↑ Rahman, A (1964). "Correlations in the Motion of Atoms in Liquid Argon". Phys Rev. 136 (2A): A405–A41. Bibcode:1964PhRv..136..405R. 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).
- ↑ Kohn, Walter; Hohenberg, Pierre (1964). "Inhomogeneous Electron Gas". Physical Review. 136 (3B): B864–B871. Bibcode:1964PhRv..136..864H. doi:10.1103/PhysRev.136.B864.
- ↑ Kohn, Walter; Sham, Lu Jeu (1965). "Self-Consistent Equations Including Exchange and Correlation Effects". Physical Review. 140 (4A): A1133–A1138. Bibcode:1965PhRv..140.1133K. doi:10.1103/PhysRev.136.B864.
- ↑ "The Nobel Prize in Chemistry 1998". Nobelprize.org. Retrieved 2008-10-06.
- ↑ B. Mandelbrot; Les objets fractals, forme, hasard et dimension (in French). Publisher: Flammarion (1975), 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.
- ↑ Appel, Kenneth; Haken, Wolfgang. "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. 60: 187–207. doi:10.1016/0021-9991(85)90002-6.
- ↑ Greengard, L.; Rokhlin, V. (1987). "A fast algorithm for particle simulations". J. Comput. Phys. 73 (2): 325–348. doi:10.1016/0021-9991(87)90140-9.
- ↑ 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)
- Ruttimann, Jacqueline (2006). "2020 computing: Milestones in scientific computing". Nature. 440: 399–405. doi:10.1038/440399a.
- Anderson, H. L. "Scientific Uses of the MANIAC". Journal of Statistical Physics. 43 (5-6): 731–748. Bibcode:1986JSP....43..731A. doi:10.1007/BF02628301.
This article is issued from Wikipedia - version of the 8/4/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.