Timeline of computational mathematics: Difference between revisions

Revision as of 18:10, 29 August 2017

Revision as of 18:16, 29 August 2017

Line 22:

|doi=10.1063/1.1699114

|bibcode = 1953JChPh..21.1087M }}</ref> Also, important earlier independent work by Alder and S. Frankel.<ref>Unfortunately, Alder's thesis advisor was unimpressed, so Alder and Frankel delayed publication of their results until much later. [http://scitation.aip.org/content/aip/journal/jcp/23/3/10.1063/1.1742004 Alder, B. J. , Frankel, S. P. , and Lewinson, B. A. , J. Chem. Phys., 23, 3 (1955)].</ref><ref>[http://www.hp9825.com/html/stan_frankel.html Stanley P. Frankel, Unrecognized Genius], HP9825.COM (accessed 29 Aug 2015).</ref>

* [[Enrico Fermi]], [[Stanislaw Ulam]], and[[John Pasta]], with help fromand [[Mary Tsingou]], discover the [[Fermi–Pasta–UlamFermi–Pasta–Ulam–Tsingou problem]].<ref>Fermi, E. (posthumously); Pasta, J.; Ulam, S. (1955) : [http://www.osti.gov/accomplishments/documents/fullText/ACC0041.pdf Studies of Nonlinear Problems (accessed 25 Sep 2012)]. Los Alamos Laboratory Document LA-1940. [http://www.cs.princeton.edu/courses/archive/fall09/cos323/papers/fpu55.pdf Also appeared] in 'Collected Works of Enrico Fermi', E. Segre ed. , [[University of Chicago Press]], Vol.II,978–988,1965. Recovered 21 Dec 2012</ref>

*In network theory, Ford & Fulkerson compute [[Ford–Fulkerson algorithm|a solution to the maximum flow problem]].<ref>Ford, L. R.; Fulkerson, D. R. (1956). [http://www.cs.yale.edu/homes/lans/readings/routing/ford-max_flow-1956.pdf "Maximal flow through a network"] . [[Canadian Journal of Mathematics]]. 8: 399–404.</ref>

* Householder invents his [[Householder matrix|eponymous matrices]] and [[Householder transformation|transformation method]] (voted one of the top 10 algorithms of the 20th century).<ref>{{cite journal|first=A. S. |last=Householder |title=Unitary Triangularization of a Nonsymmetric Matrix|journal=[[Journal of the ACM]]