20世纪10大算法
1.The Monte Carlo method (1946): John von Neumann, Stanislaw Ulam, and NickMetropolis at the Los Alamos Scientific Laboratory.
2.The simplex method for linear programming (1947): George Dantzig at the RA
ND Corporation.
3.Krylov subspace iteration methods (1950): Magnus Hestenes, Eduard Stiefel,
and Cornelius Lanczos at the National Bureau of Standards.
4.The decompositional approach to matrix computations (1951): Alston Househo
lder at Oak Ridge National Laboratory.
5.FORTRAN optimizing compiler (1957): John Backus and team at IBM.
6.The QR algorithm (1959--61): J.G.F. Francis at Ferranti Ltd., London.
7.Quicksort (1962): Tony Hoare at Elliott Brothers, Ltd. London.
8.The fast Fourier transform (1965): James Cooley at IBM T.J. Watson Researc
h Center and John Tukey at Princeton University and ATT Bell Laboratories.
9.The integer relation detection algorithm (1977): Helaman Ferguson and Rodn
ey Forcade at Brigham Young University.
10.The fast multiple algorithm (1987): Leslie Greengard and Vladimir Rokhlin
at Yale University.
页:
[1]