This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
January/February 2000 (vol. 2 no. 1)
pp. 22-23
In putting together this issue of CiSE, we knew three things: it would be difficult to list just 10 algorithms; it would be fun to assemble the authors and read their papers; and, whatever we came up with in the end, it would be controversial. We tried to assemble the 10 algorithms with the greatest influence on the development and practice of science and engineering in the 20th century. Following is our list (in chronological order): Metropolis Algorithm for Monte Carlo Simplex Method for Linear Programming Krylov Subspace Iteration Methods The Decompositional Approach to Matrix Computations The Fortran Optimizing Compiler QR Algorithm for Computing Eigenvalues Quicksort Algorithm for Sorting Fast Fourier Transform Integer Relation Detection Fast Multipole Method
Citation:
Jack Dongarra, Francis Sullivan, "Guest Editors' Introduction: The Top 10 Algorithms," Computing in Science and Engineering, vol. 2, no. 1, pp. 22-23, Jan.-Feb. 2000, doi:10.1109/MCISE.2000.814652
Usage of this product signifies your acceptance of the Terms of Use.