Kalpana Kalpana (Editor)

Timeline of numerical analysis after 1945

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

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.

Contents

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.
  • Crank–Nicolson method was developed by Crank and Nicolson.
  • Dantzig introduces the simplex method (voted one of the top 10 algorithms of the 20th century) in 1947.
  • Turing formulated the LU decomposition method.
  • 1950s

  • Successive over-relaxation was devised simultaneously by D.M. Young, Jr. 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. Voted one of the top 10 algorithms of the 20th century.
  • Equations of State Calculations by Fast Computing Machines introduces the Metropolis–Hastings algorithm.
  • Householder invents his eponymous matrices and transformation method (voted one of the top 10 algorithms of the 20th century).
  • 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, Galerkin and Zienkiewicz, among others. See also here.
  • In computational fluid dynamics and numerical differential equations, Lax and Wendroff invent the Lax-Wendroff method.
  • Fast Fourier Transform (voted one of the top 10 algorithms of the 20th century) invented by Cooley and Tukey.
  • First edition of Handbook of Mathematical Functions by Abramowitz and Stegun, both of the U.S.National Bureau of Standards.
  • The MacCormack method, for the numerical solution of hyperbolic partial differential equations in computational fluid dynamics, is introduced by MacCormack in 1969.
  • 1980s

  • Fast multipole method (voted one of the top 10 algorithms of the 20th century) invented by Rokhlin and Greengard.
  • First edition of Numerical Recipes by Press, Teukolsky, et al.
  • References

    Timeline of numerical analysis after 1945 Wikipedia


    Similar Topics