20世紀10大算法

1.The Monte Carlo method (1946): John von Neumann, Stanislaw Ulam, and Nick Metropolis at the Los Alamos Scientific Laboratory.
蒙特卡洛算法。

 

2.The simplex method for linear programming (1947): George Dantzig at the RAND Corporation.
單純形方法。

 

3.Krylov subspace iteration methods (1950): Magnus Hestenes, Eduard Stiefel,and Cornelius Lanczos at the National Bureau of Standards.
Krylov 子空間迭代算法。

 

4.The decompositional approach to matrix computations (1951): Alston Householder at Oak Ridge National Laboratory.
矩陣分解算法。

 

5.FORTRAN optimizing compiler (1957): John Backus and team at IBM.
Fotran 最優化編譯器。

 

6.The QR algorithm (1959--61): J.G.F. Francis at Ferranti Ltd., London.
QR算法。

 

7.Quicksort (1962): Tony Hoare at Elliott Brothers, Ltd. London.
快速排序算法。

 

8.The fast Fourier transform (1965): James Cooley at IBM T.J. Watson Research Center and John Tukey at Princeton University and ATT Bell Laboratories.
FFT算法。

 

9.The integer relation detection algorithm (1977): Helaman Ferguson and Rodney Forcade at Brigham Young University.
整數關係確定算法

 

10.The fast multiple algorithm (1987): Leslie Greengard and Vladimir Rokhlin at Yale University.
快速多極算法