二十世纪十大优秀算法 (SIAM News,2000) 秦 1.Monte Carlo method (1946) 2.Simplex Method for Linear Programming(1947) 3.Krylov Subspace Iteration Methods(1950) 4.The Decompositional Approach to Matrix Computations(1951) 5.The Fortran Optimizing Compiler(1957) 6.QR Algorithm for Computing Eigenvalues(1959-61) 7.Quicksort Algorithm for Sorting(1962) 8.Fast Fourier Transform(1965) 9.Integer Relation Detection Algorithm(1977) 10.Fast Multipole Method (1987) The Best of the 20th Century:Editors Name Top 10 Algorithms,B.A.Cipra,SIAM News,2000. http://math.ecnu.edu.cn/~jypan 12/14 二十世纪十大优秀算法 (SIAM News, 2000) 1. Monte Carlo method (1946) 2. Simplex Method for Linear Programming (1947) 3. Krylov Subspace Iteration Methods (1950) 4. The Decompositional Approach to Matrix Computations (1951) 5. The Fortran Optimizing Compiler (1957) 6. QR Algorithm for Computing Eigenvalues (1959­61) 7. Quicksort Algorithm for Sorting (1962) 8. Fast Fourier Transform (1965) 9. Integer Relation Detection Algorithm (1977) 10. Fast Multipole Method (1987)  The Best of the 20th Century: Editors Name Top 10 Algorithms, B. A. Cipra, SIAM News, 2000. http://math.ecnu.edu.cn/~jypan 12/14