Computing in Science &
Engineering |
Guest Editors Introduction to the top 10 algorithms Dongarra, J.; Sullivan, F. Page(s): 22 -23 |
Integer relation detection Bailey, D.H. Page(s): 24 -28 |
The (Dantzig) simplex method for linear programming Nash, J.C. Page(s): 29 -31 |
Krylov subspace iteration van der Vorst, H.A. Page(s): 32 -37 |
The QR algorithm Parlett, B.N. Page(s): 38 -42 |
A perspective on Quicksort JaJa, J. Page(s): 43 -49 |
The decompositional approach to matrix computation Stewart, G.W. Page(s): 50 -59 |
The FFT: an algorithm the whole family can use Rockmore, D.N. Page(s): 60 -64 |
The Metropolis Algorithm Beichl, I.; Sullivan, F. Page(s): 65 -69 |
The Fortran I compiler Padua, D. Page(s): 70 -75 |
The fast multipole algorithm Board, J.; Schulten, L. Page(s): 76 -79 |