Timeline of numerical analysis after 1945

The following is a timeline of numerical analysis after 1945, and deals with developments after the invention of the modern electronic computer, which began during Second World War. For a fuller history of the subject before this period, see timeline and history of 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.{{cite journal|last=Metropolis|first=N.|title=The Beginning of the Monte Carlo method|journal=Los Alamos Science|year=1987|volume=15 |page=125|url=http://library.lanl.gov/cgi-bin/getfile?15-12.pdf}}. Accessed 5 may 2012.S. Ulam, R. D. Richtmyer, and J. von Neumann (1947). [http://library.lanl.gov/cgi-bin/getfile?00329286.pdf Statistical methods in neutron diffusion]. Los Alamos Scientific Laboratory report LAMS–551.{{cite journal | last1 = Metropolis | first1 = N. | last2 = Ulam | first2 = S. | year = 1949 | title = The Monte Carlo method | journal = Journal of the American Statistical Association | volume = 44 | issue = 247| pages = 335–341 | doi=10.1080/01621459.1949.10483310 | pmid = 18139350}}
Crank–Nicolson method was developed by Crank and Nicolson.{{Cite journal

| title = A practical method for numerical evaluation of solutions of partial differential equations of the heat conduction type

| journal = Proc. Camb. Phil. Soc.

| volume = 43

| issue = 1

| year = 1947

| pages = 50–67

| doi = 10.1007/BF02127704

| last1 = Crank

| first1 = J. (John)

| last2 = Nicolson

| first2 = P. (Phyllis)

| s2cid = 16676040

}}

Dantzig introduces the simplex method (voted one of the top 10 algorithms of the 20th century) in 1947.{{cite web|title=SIAM News, November 1994.|url=http://www.stanford.edu/group/SOL/dantzig.html|access-date=6 June 2012}} Hosted at [http://www.stanford.edu/group/SOL/ Systems Optimization Laboratory], Stanford University, [http://soe-oldwebserver.stanford.edu/visit/huang_center/index.html Huang Engineering Center] {{Webarchive|url=https://web.archive.org/web/20121112155545/http://soe-oldwebserver.stanford.edu/visit/huang_center/index.html |date=12 November 2012 }}.
Turing formulated the LU decomposition method.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}}.) .

1950s

Successive over-relaxation was devised simultaneously by D.M. Young Jr.{{citation

|last=Young |first=David M. |author-link=David M. Young

|title=Iterative methods for solving partial difference equations of elliptical type

|url=http://www.ma.utexas.edu/CNA/DMY/david_young_thesis.pdf

|date=1 May 1950

|series=PhD thesis, Harvard University

|access-date=15 June 2009

}} and by H. Frankel in 1950.

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.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). Voted one of the top 10 algorithms of the 20th century.
Equations of State Calculations by Fast Computing Machines introduces the Metropolis–Hastings algorithm.{{cite journal | last1 = Metropolis | first1 = N. | last2 = Rosenbluth | first2 = A.W. | last3 = Rosenbluth | first3 = M.N. | last4 = Teller | first4 = A.H. | last5 = Teller | first5 = E. | year = 1953 | title = Equation of State Calculations by Fast Computing Machines| journal = Journal of Chemical Physics | volume = 21 | issue = 6| pages = 1087–1092 | doi = 10.1063/1.1699114 | bibcode=1953JChPh..21.1087M| osti = 4390578 | s2cid = 1046577 }}
In numerical differential equations, Lax and Friedrichs invent the Lax-Friedrichs method.{{cite journal | last1 = Lax | first1 = PD | year = 1954 | title = Weak solutions of nonlinear hyperbolic equations and their numerical approximation | journal = Comm. Pure Appl. Math. | volume = 7 | pages = 159–193 | doi=10.1002/cpa.3160070112}}{{cite journal | last1 = Friedrichs | first1 = KO | year = 1954 | title = Symmetric hyperbolic linear differential equations | journal = Comm. Pure Appl. Math. | volume = 7 | issue = 2| pages = 345–392 | doi=10.1002/cpa.3160070206}}
Householder invents his eponymous matrices and transformation method (voted one of the top 10 algorithms of the 20th century).{{cite journal|first=A. S. |last=Householder |title=Unitary Triangularization of a Nonsymmetric Matrix|journal=Journal of the ACM

|volume=5 |issue=4 |year=1958 |pages=339–342|doi=10.1145/320941.320947 |mr=0111128|s2cid=9858625 |url=https://hal.archives-ouvertes.fr/hal-01316095/file/p339householderb.pdf }}

Romberg integration1955
John G.F. FrancisJ.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. and Vera KublanovskayaVera 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). 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,RW Clough, "The Finite Element Method in Plane Stress Analysis", Proceedings of 2nd ASCE Conference on Electronic Computation, Pittsburgh, PA, 8, 9 Sept. 1960. to describe the methods of Courant, Hrenikoff, Galerkin and Zienkiewicz, among others. See also here.
Exponential integration by Certaine and Pope.
In computational fluid dynamics and numerical differential equations, Lax and Wendroff invent the Lax-Wendroff method.{{ cite journal | author = P.D Lax |author2=B. Wendroff | year = 1960 | title = Systems of conservation laws | journal = Commun. Pure Appl. Math. | volume = 13 | pages = 217–237 | doi = 10.1002/cpa.3160130205 | issue = 2 | url = http://www.dtic.mil/get-tr-doc/pdf?AD=ADA385056 | archive-url = https://web.archive.org/web/20170925220837/http://www.dtic.mil/get-tr-doc/pdf?AD=ADA385056 | url-status = dead | archive-date = 25 September 2017 }}
Fast Fourier Transform (voted one of the top 10 algorithms of the 20th century) invented by Cooley and Tukey.{{cite journal | last1 = Cooley | first1 = James W. | last2 = Tukey | first2 = John W. | year = 1965 | title = An algorithm for the machine calculation of complex Fourier series | url = http://attach3.bdwm.net/attach/0Announce/groups/GROUP_3/MathTools/D6714701A/D69595345/M.1089260001.A/CooleyJ_AlgMCC.pdf | journal = Math. Comput. | volume = 19 | issue = 90| pages = 297–301 | doi=10.1090/s0025-5718-1965-0178586-1| doi-access = free }}
First edition of Handbook of Mathematical Functions by Abramowitz and Stegun, both of the U.S.National Bureau of Standards.M Abramowitz and I Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Publisher: Dover Publications. Publication date: 1964; {{ISBN|0-486-61272-4}};OCLC Number:[http://worldcat.org/oclc/18003605 18003605] .
Broyden does new quasi-Newton method for finding roots in 1965.
The MacCormack method, for the numerical solution of hyperbolic partial differential equations in computational fluid dynamics, is introduced by MacCormack in 1969.MacCormack, R. W., The Effect of viscosity in hypervelocity impact cratering, AIAA Paper, 69-354 (1969).
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.

1970s

Creation of LINPACK and associated benchmark by Dongarra et al.,{{cite journal|author1=J. Bunch|author2=G. W. Stewart.|author3=Cleve Moler|author4=Jack J. Dongarra|title=LINPACK User's Guide |publisher=SIAM |location=Philadelphia, PA |year=1979}}[http://www.netlib.org/utk/people/JackDongarra/PAPERS/hpl.pdf The LINPACK Benchmark: Past, Present, and Future.] Jack J. Dongarra, Piotr Luszczeky, and Antoine Petitetz. December 2001. as well as BLAS.

1980s

Progress in wavelet theory throughout the decade, led by Daubechies et al.
Creation of MINPACK.
Fast multipole method (voted one of the top 10 algorithms of the 20th century) invented by Rokhlin and Greengard.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.{{cite journal | last1 = Greengard | first1 = L. | last2 = Rokhlin | first2 = V. | year = 1987 | title = A fast algorithm for particle simulations | journal = J. Comput. Phys. | volume = 73 | issue = 2| pages = 325–348 | doi=10.1016/0021-9991(87)90140-9| bibcode = 1987JCoPh..73..325G }}
First edition of Numerical Recipes by Press, Teukolsky, et al.Press, William H.; Teukolsky, Saul A.; Vetterling, William T.; Flannery, Brian P. (1986). Numerical Recipes: The Art of Scientific Computing. New York: Cambridge University Press. {{ISBN|0-521-30811-9}}.
In numerical linear algebra, the GMRES algorithm invented in 1986.{{cite journal | last1 = Saad | first1 = Y. | last2 = Schultz | first2 = M.H. | year = 1986 | title = GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems | journal = SIAM J. Sci. Stat. Comput. | volume = 7 | issue = 3| pages = 856–869 | doi = 10.1137/0907058 | citeseerx = 10.1.1.476.951 }}

References

External links

[http://history.siam.org/ The History of Numerical Analysis and Scientific Computing] @ SIAM (Society for Industrial and Applied Mathematics)
{{cite journal | doi = 10.1038/440399a | volume=440 | issue=7083 | title=2020 computing: Milestones in scientific computing | year=2006 | journal=Nature | pages=399–405 | last1 = Ruttimann | first1 = Jacqueline | pmid=16554772| bibcode=2006Natur.440..399R | s2cid=21967804 | doi-access=free }}
[https://web.archive.org/web/20140822045448/http://home.gwu.edu/~stroud/mc-classics.html The Monte Carlo Method: Classic Papers]
[http://scienze-como.uninsubria.it/bressanini/montecarlo-history/ Monte Carlo Landmark Papers]
[https://mathoverflow.net/q/102413 “Must read” papers in numerical analysis.] Discussion at MathOverflow based upon a selected reading list on Lloyd N. Trefethen's [http://people.maths.ox.ac.uk/trefethen/classic_papers.txt personal site].

nume

Category:Numerical analysis