Pages with the most revisions

Showing below up to 50 results in range #21 to #70.

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

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. The dqds algorithm for calculating singular values of bidiagonal matrices‏‎ (10 revisions)
33. Orthogonalization method‏‎ (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)
51. Givens (rotations) method for the QR decomposition of a (real) Hessenberg matrix‏‎ (5 revisions)
52. Glossary‏‎ (5 revisions)
53. BFS, Ligra‏‎ (5 revisions)
54. BFS, Python/C++, NetworKit‏‎ (4 revisions)
55. Purdom's, Boost Graph Library‏‎ (4 revisions)
56. Cholesky decomposition, scalability‏‎ (4 revisions)
57. Triangular decomposition of a Gram matrix‏‎ (4 revisions)
58. Gaussian elimination, compact scheme for tridiagonal matrices, serial version‏‎ (4 revisions)
59. Graph connectivity‏‎ (4 revisions)
60. Cholesky decomposition, locality‏‎ (4 revisions)
61. Help‏‎ (3 revisions)
62. Unitary-triangular factorizations‏‎ (3 revisions)
63. Two-sided Thomas algorithm, pointwise version‏‎ (3 revisions)
64. Transitive closure of a directed graph‏‎ (3 revisions)
65. Cooley-Tukey, locality‏‎ (3 revisions)
66. All Pairs Shortest Path (APSP)‏‎ (3 revisions)
67. LU decomposition using Gaussian elimination without pivoting‏‎ (3 revisions)
68. Floyd-Warshall algorithm‏‎ (3 revisions)
69. Shiloach-Vishkin algorithm for finding the connected components‏‎ (3 revisions)
70. Dijkstra, VGL, push‏‎ (3 revisions)

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