Pages with the most revisions

Showing below up to 50 results in range #1 to #50.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

1. Cholesky decomposition‏‎ (120 revisions)
2. Givens method‏‎ (78 revisions)
3. Householder (reflections) method for reducing a symmetric matrix to tridiagonal form‏‎ (75 revisions)
4. Poisson equation, solving with DFT‏‎ (72 revisions)
5. Elimination method, pointwise version‏‎ (62 revisions)
6. Bellman-Ford algorithm‏‎ (60 revisions)
7. Dijkstra's algorithm‏‎ (59 revisions)
8. One step of the dqds algorithm‏‎ (58 revisions)
9. Boruvka's algorithm‏‎ (55 revisions)
10. The serial-parallel summation method‏‎ (54 revisions)
11. Repeated Thomas algorithm, pointwise version‏‎ (53 revisions)
12. Single-qubit transform of a state vector‏‎ (50 revisions)
13. Linpack benchmark‏‎ (48 revisions)
14. Methods for solving tridiagonal SLAEs‏‎ (45 revisions)
15. DCSC algorithm for finding the strongly connected components‏‎ (39 revisions)
16. Purdom's algorithm‏‎ (38 revisions)
17. Stone doubling algorithm for the LU decomposition of a tridiagonal matrix‏‎ (37 revisions)
18. Gaussian elimination, compact scheme for tridiagonal matrices, serial variant‏‎ (34 revisions)
19. Breadth-first search (BFS)‏‎ (34 revisions)
20. Algorithm classification‏‎ (32 revisions)
21. Horners method‏‎ (30 revisions)
22. Gaussian elimination, compact scheme for tridiagonal matrices and its modifications‏‎ (30 revisions)
23. Cholesky method‏‎ (30 revisions)
24. Back substitution‏‎ (28 revisions)
25. Dense matrix multiplication (serial version for real matrices)‏‎ (15 revisions)
26. QR decomposition of dense nonsingular matrices‏‎ (14 revisions)
27. Forward substitution‏‎ (13 revisions)
28. Dot product‏‎ (13 revisions)
29. Single Source Shortest Path (SSSP)‏‎ (12 revisions)
30. Description of algorithm properties and structure‏‎ (11 revisions)
31. Cooley–Tukey Fast Fourier Transform, radix-2 case‏‎ (10 revisions)
32. Orthogonalization method‏‎ (10 revisions)
33. The dqds algorithm for calculating singular values of bidiagonal matrices‏‎ (10 revisions)
34. About project‏‎ (9 revisions)
35. Δ-stepping algorithm‏‎ (8 revisions)
36. Dense matrix-vector multiplication‏‎ (8 revisions)
37. BFS, C++, MPI, Boost Graph Library‏‎ (7 revisions)
38. Cooley-Tukey, scalability‏‎ (7 revisions)
39. BFS, RCC for CPU‏‎ (7 revisions)
40. BFS, RCC for GPU‏‎ (7 revisions)
41. LU decomposition via Gaussian elimination‏‎ (6 revisions)
42. Pairwise summation of numbers‏‎ (6 revisions)
43. BFS, GAP‏‎ (6 revisions)
44. Backward substitution‏‎ (6 revisions)
45. BFS, C++, Boost Graph Library‏‎ (6 revisions)
46. LU decomposition using Gaussian elimination with pivoting‏‎ (6 revisions)
47. Construction of the minimum spanning tree (MST)‏‎ (5 revisions)
48. QR decomposition methods for dense Hessenberg matrices‏‎ (5 revisions)
49. BFS, Java, WebGraph‏‎ (5 revisions)
50. BFS, Python, NetworkX‏‎ (5 revisions)

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)