Oldest pages

Jump to navigation Jump to search

Showing below up to 250 results in range #51 to #300.

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

  1. High Performance Conjugate Gradient (HPCG) benchmark‏‎ (15:43, 14 March 2018)
  2. Biconjugate gradient stabilized method (BiCGStab)‏‎ (15:45, 14 March 2018)
  3. Kaczmarz's algorithm‏‎ (15:46, 14 March 2018)
  4. QR algorithm‏‎ (15:48, 14 March 2018)
  5. QR algorithm as implemented in SCALAPACK‏‎ (15:50, 14 March 2018)
  6. Hessenberg QR algorithm as implemented in SCALAPACK‏‎ (15:52, 14 March 2018)
  7. Symmetric QR algorithm as implemented in SCALAPACK‏‎ (15:54, 14 March 2018)
  8. QR algorithm for complex Hermitian matrices as implemented in SCALAPACK‏‎ (15:57, 14 March 2018)
  9. Householder (reflections) method for reducing a complex Hermitian matrix to symmetric tridiagonal form‏‎ (16:00, 14 March 2018)
  10. The Jacobi (rotations) method for solving the symmetric eigenvalue problem‏‎ (16:05, 14 March 2018)
  11. The classical Jacobi (rotations) method with pivoting for symmetric matrices‏‎ (16:07, 14 March 2018)
  12. Serial Jacobi (rotations) method for symmetric matrices‏‎ (16:08, 14 March 2018)
  13. Serial Jacobi (rotations) method with thresholds for symmetric matrices‏‎ (16:10, 14 March 2018)
  14. Lanczos algorithm in exact algorithm (without reorthogonalization)‏‎ (16:12, 14 March 2018)
  15. Jacobi (rotations) method for finding singular values‏‎ (16:13, 14 March 2018)
  16. Binary search: Finding the position of a target value within a sorted array‏‎ (16:17, 14 March 2018)
  17. Depth-first search (DFS)‏‎ (16:38, 14 March 2018)
  18. Johnson's algorithm‏‎ (16:42, 14 March 2018)
  19. Longest shortest path‏‎ (16:45, 14 March 2018)
  20. Kruskal's algorithm‏‎ (16:46, 14 March 2018)
  21. Prim's algorithm‏‎ (16:47, 14 March 2018)
  22. GHS algorithm‏‎ (16:49, 14 March 2018)
  23. Ullman's algorithm‏‎ (16:50, 14 March 2018)
  24. VF2 algorithm‏‎ (16:51, 14 March 2018)
  25. Disjoint set union‏‎ (16:54, 14 March 2018)
  26. Tarjan's strongly connected components algorithm‏‎ (16:55, 14 March 2018)
  27. Tarjan's biconnected components algorithm‏‎ (16:57, 14 March 2018)
  28. Tarjan's algorithm for finding the bridges of a graph‏‎ (16:58, 14 March 2018)
  29. Vertex connectivity of a graph‏‎ (16:59, 14 March 2018)
  30. Gabow's edge connectivity algorithm‏‎ (17:00, 14 March 2018)
  31. Ford–Fulkerson algorithm‏‎ (17:01, 14 March 2018)
  32. Preflow-Push algorithm‏‎ (17:04, 14 March 2018)
  33. Finding minimal-cost flow in a transportation network‏‎ (17:06, 14 March 2018)
  34. Hungarian algorithm‏‎ (17:08, 14 March 2018)
  35. Auction algorithm‏‎ (17:09, 14 March 2018)
  36. Hopcroft–Karp algorithm‏‎ (17:10, 14 March 2018)
  37. Two-qubit transform of a state vector‏‎ (17:12, 14 March 2018)
  38. K-means clustering‏‎ (17:14, 14 March 2018)
  39. Face recognition‏‎ (17:20, 14 March 2018)
  40. Stochastic dual dynamic programming (SDDP)‏‎ (17:23, 14 March 2018)
  41. Newton's method for systems of nonlinear equations‏‎ (17:24, 14 March 2018)
  42. Cubature rules‏‎ (17:26, 14 March 2018)
  43. Numerical quadrature (cubature) rules on an interval (for a multidimensional cube)‏‎ (17:28, 14 March 2018)
  44. Meet-in-the-middle attack‏‎ (17:30, 14 March 2018)
  45. Householder (reflections) method for reducing of a matrix to Hessenberg form‏‎ (13:03, 15 March 2018)
  46. Algorithm classification‏‎ (13:06, 15 March 2018)
  47. QR decomposition of dense nonsingular matrices‏‎ (16:14, 16 March 2018)
  48. Gaussian elimination, compact scheme for tridiagonal matrices and its modifications‏‎ (16:41, 16 March 2018)
  49. Gaussian elimination, compact scheme for tridiagonal matrices, serial variant‏‎ (16:53, 16 March 2018)
  50. Orthogonalization method‏‎ (16:58, 16 March 2018)
  51. Triangular decomposition of a Gram matrix‏‎ (17:02, 16 March 2018)
  52. QR decomposition methods for dense Hessenberg matrices‏‎ (17:09, 16 March 2018)
  53. Unitary-triangular factorizations‏‎ (17:11, 16 March 2018)
  54. Шаблон:Buttonlinkimp‏‎ (14:20, 19 June 2018)
  55. Construction of the minimum spanning tree (MST)‏‎ (14:56, 19 June 2018)
  56. Shiloach-Vishkin algorithm for finding the connected components‏‎ (15:03, 19 June 2018)
  57. Single Source Shortest Path (SSSP)‏‎ (17:48, 19 June 2018)
  58. Cholesky method‏‎ (13:01, 10 August 2018)
  59. Участник:VolkovNikita94‏‎ (21:58, 10 May 2019)
  60. About project‏‎ (16:30, 11 September 2019)
  61. Givens (rotations) method for the QR decomposition of a matrix‏‎ (10:14, 6 April 2020)
  62. Cooley-Tukey, scalability‏‎ (16:24, 1 July 2022)
  63. Cooley–Tukey Fast Fourier Transform, radix-2 case‏‎ (16:45, 1 July 2022)
  64. BFS, C++, Boost Graph Library‏‎ (10:42, 2 July 2022)
  65. BFS, C++, MPI, Boost Graph Library‏‎ (10:44, 2 July 2022)
  66. BFS, GAP‏‎ (10:48, 2 July 2022)
  67. BFS, Java, WebGraph‏‎ (10:51, 2 July 2022)
  68. BFS, Python, NetworkX‏‎ (10:57, 2 July 2022)
  69. BFS, Python/C++, NetworKit‏‎ (11:01, 2 July 2022)
  70. Dijkstra, C++, Boost Graph Library‏‎ (10:03, 4 July 2022)
  71. Dijkstra, Python‏‎ (10:26, 4 July 2022)
  72. Dijkstra, Python/C++‏‎ (10:30, 4 July 2022)
  73. Dijkstra, C++, MPI: Parallel Boost Graph Library, 1‏‎ (10:36, 4 July 2022)
  74. Dijkstra, C++, MPI: Parallel Boost Graph Library, 2‏‎ (10:39, 4 July 2022)
  75. Dijkstra, locality‏‎ (11:00, 4 July 2022)
  76. Dijkstra, Google‏‎ (11:10, 4 July 2022)
  77. Dijkstra's algorithm‏‎ (15:02, 4 July 2022)
  78. Bellman-Ford, C++, Boost Graph Library‏‎ (15:17, 4 July 2022)
  79. Bellman-Ford, Python, NetworkX‏‎ (15:21, 4 July 2022)
  80. Bellman-Ford, Java, JGraphT‏‎ (15:27, 4 July 2022)
  81. Bellman-Ford, OpenMP, Stinger‏‎ (15:35, 4 July 2022)
  82. Bellman-Ford, Nvidia nvGraph‏‎ (15:40, 4 July 2022)
  83. Bellman-Ford, MPI, Graph500‏‎ (15:47, 4 July 2022)
  84. BFS, Ligra‏‎ (15:52, 4 July 2022)
  85. Bellman-Ford, Ligra‏‎ (15:54, 4 July 2022)
  86. Bellman-Ford, locality‏‎ (16:11, 4 July 2022)
  87. Bellman-Ford, scalability‏‎ (16:25, 4 July 2022)
  88. BFS, MPI, Graph500‏‎ (16:29, 4 July 2022)
  89. Bellman-Ford algorithm‏‎ (16:33, 4 July 2022)
  90. Δ-stepping, C++, MPI, Parallel Boost Graph Library‏‎ (10:06, 5 July 2022)
  91. Δ-stepping, Gap‏‎ (10:19, 5 July 2022)
  92. Δ-stepping algorithm‏‎ (10:23, 5 July 2022)
  93. Johnson's, C++, Boost Graph Library‏‎ (10:29, 5 July 2022)
  94. Floyd-Warshall, C++, Boost Graph Library‏‎ (10:38, 5 July 2022)
  95. Floyd-Warshall, Python, NetworkX‏‎ (10:42, 5 July 2022)
  96. Floyd-Warshall, Java, JGraphT‏‎ (10:45, 5 July 2022)
  97. Floyd-Warshall algorithm‏‎ (10:52, 5 July 2022)
  98. Floyd-Warshall, scalability‏‎ (10:53, 5 July 2022)
  99. Purdom's algorithm‏‎ (13:00, 5 July 2022)
  100. Boruvka's, C++, MPI, Parallel Boost Graph Library‏‎ (13:15, 5 July 2022)
  101. Boruvka's, RCC for CPU‏‎ (13:19, 5 July 2022)
  102. Boruvka's, RCC for GPU‏‎ (13:24, 5 July 2022)
  103. Boruvka's, scalability‏‎ (13:37, 5 July 2022)
  104. Boruvka's, locality‏‎ (13:49, 5 July 2022)
  105. Boruvka's algorithm‏‎ (13:54, 5 July 2022)
  106. BFS, RCC for CPU‏‎ (14:01, 5 July 2022)
  107. BFS, RCC for GPU‏‎ (14:02, 5 July 2022)
  108. Kruskal's, C++, Boost Graph Library‏‎ (09:47, 6 July 2022)
  109. Kruskal's, C++, MPI, Parallel Boost Graph Library‏‎ (09:54, 6 July 2022)
  110. Kruskal's, Python, NetworkX‏‎ (09:58, 6 July 2022)
  111. Kruskal's, Java, JGraphT‏‎ (10:02, 6 July 2022)
  112. Prim's, C++, Boost Graph Library‏‎ (10:08, 6 July 2022)
  113. Prim's, Java, JGraphT‏‎ (10:12, 6 July 2022)
  114. Ullman's, C++, Chemical Descriptors Library‏‎ (12:09, 6 July 2022)
  115. Ullman's, C++, VF Library‏‎ (12:12, 6 July 2022)
  116. VF2, C++, VF Library‏‎ (12:20, 6 July 2022)
  117. VF2, C++, Boost Graph Library‏‎ (12:23, 6 July 2022)
  118. VF2, Python, NetworkX‏‎ (12:26, 6 July 2022)
  119. Disjoint set union, Boost Graph Library‏‎ (14:16, 6 July 2022)
  120. Disjoint set union, Java, JGraphT‏‎ (14:20, 6 July 2022)
  121. Tarjan's strongly connected components, C++, Boost Graph Library‏‎ (14:28, 6 July 2022)
  122. Tarjan's strongly connected components, Java, WebGraph‏‎ (14:32, 6 July 2022)
  123. Tarjan's strongly connected components, Java, JGraphT‏‎ (14:35, 6 July 2022)
  124. Tarjan's strongly connected components, Python, NetworkX‏‎ (14:41, 6 July 2022)
  125. Tarjan's strongly connected components, Python/C++, NetworKit‏‎ (14:45, 6 July 2022)
  126. Purdom's, Boost Graph Library‏‎ (15:06, 6 July 2022)
  127. DCSC algorithm for finding the strongly connected components‏‎ (15:11, 6 July 2022)
  128. DCSC for finding the strongly connected components, C++, MPI, Parallel Boost Graph Library‏‎ (15:21, 6 July 2022)
  129. Tarjan's biconnected components, C++, Boost Graph Library‏‎ (15:29, 6 July 2022)
  130. Tarjan's biconnected components, Python, NetworkX‏‎ (15:32, 6 July 2022)
  131. Tarjan's biconnected components, Java, JGraphT‏‎ (15:36, 6 July 2022)
  132. Tarjan-Vishkin biconnected components algorithm‏‎ (15:47, 6 July 2022)
  133. Tarjan-Vishkin biconnected components, scalability‏‎ (15:48, 6 July 2022)
  134. Ford–Fulkerson, C++, Boost Graph Library‏‎ (09:19, 7 July 2022)
  135. Ford–Fulkerson, Python, NetworkX‏‎ (09:23, 7 July 2022)
  136. Ford–Fulkerson, Java, JGraphT‏‎ (09:30, 7 July 2022)
  137. Preflow-Push, C++, Boost Graph Library‏‎ (09:38, 7 July 2022)
  138. Preflow-Push, Python, NetworkX‏‎ (09:41, 7 July 2022)
  139. Hungarian, Java, JGraphT‏‎ (09:47, 7 July 2022)
  140. Hopcroft–Karp, Java, JGraphT‏‎ (09:54, 7 July 2022)
  141. Longest shortest path, Java, WebGraph‏‎ (10:01, 7 July 2022)
  142. Longest shortest path, Python/C++, NetworKit‏‎ (10:04, 7 July 2022)
  143. DFS, C++, Boost Graph Library‏‎ (10:11, 7 July 2022)
  144. DFS, C++, MPI, Parallel Boost Graph Library‏‎ (10:14, 7 July 2022)
  145. DFS, Python, NetworkX‏‎ (10:17, 7 July 2022)
  146. Breadth-first search (BFS)‏‎ (10:20, 7 July 2022)
  147. Householder (reflections) method for reducing a symmetric matrix to tridiagonal form‏‎ (12:09, 7 July 2022)
  148. Cholesky decomposition, locality‏‎ (12:46, 7 July 2022)
  149. Cholesky decomposition, SCALAPACK‏‎ (12:51, 7 July 2022)
  150. Cholesky decomposition, scalability‏‎ (12:53, 7 July 2022)
  151. Cooley-Tukey, locality‏‎ (13:50, 7 July 2022)
  152. Lanczos, MPI, OpenMP‏‎ (16:47, 7 July 2022)
  153. Lanczos, C++, MPI‏‎ (17:03, 7 July 2022)
  154. Lanczos, C++, MPI, 2‏‎ (17:57, 7 July 2022)
  155. Lanczos, C, MPI‏‎ (18:02, 7 July 2022)
  156. Lanczos, C++, MPI, 3‏‎ (18:07, 7 July 2022)
  157. One step of the dqds, LAPACK‏‎ (09:46, 8 July 2022)
  158. One step of the dqds algorithm‏‎ (09:51, 8 July 2022)
  159. Horners, locality‏‎ (10:11, 8 July 2022)
  160. Horners method‏‎ (10:15, 8 July 2022)
  161. Dense matrix-vector multiplication, locality‏‎ (10:24, 8 July 2022)
  162. Dense matrix-vector multiplication, scalability‏‎ (10:30, 8 July 2022)
  163. Dense matrix multiplication, locality‏‎ (10:44, 8 July 2022)
  164. Dense matrix multiplication, scalability‏‎ (10:50, 8 July 2022)
  165. Dense matrix multiplication (serial version for real matrices)‏‎ (10:55, 8 July 2022)
  166. Pairwise summation of numbers, locality‏‎ (12:46, 8 July 2022)
  167. Pairwise summation of numbers, scalability‏‎ (12:50, 8 July 2022)
  168. Pairwise summation of numbers‏‎ (12:52, 8 July 2022)
  169. Dense matrix-vector multiplication‏‎ (12:54, 8 July 2022)
  170. Uniform norm of a vector, locality‏‎ (14:29, 8 July 2022)
  171. Dot product, locality‏‎ (14:38, 8 July 2022)
  172. Dot product, scalability‏‎ (14:45, 8 July 2022)
  173. Dot product‏‎ (14:49, 8 July 2022)
  174. The serial-parallel summation method, locality‏‎ (14:59, 8 July 2022)
  175. The serial-parallel summation method, scalability‏‎ (15:08, 8 July 2022)
  176. The serial-parallel summation method‏‎ (15:12, 8 July 2022)
  177. Gaussian elimination, compact scheme for tridiagonal matrices, serial version‏‎ (15:45, 8 July 2022)
  178. Stone doubling algorithm for the LU decomposition of a tridiagonal matrix‏‎ (15:51, 8 July 2022)
  179. LU decomposition via Gaussian elimination, locality‏‎ (16:03, 8 July 2022)
  180. LU decomposition via Gaussian elimination, scalability‏‎ (16:09, 8 July 2022)
  181. LU decomposition via Gaussian elimination‏‎ (16:13, 8 July 2022)
  182. Givens method, locality‏‎ (16:27, 8 July 2022)
  183. Givens method‏‎ (16:32, 8 July 2022)
  184. Householder (reflections) method for the QR decomposition, locality‏‎ (08:20, 9 July 2022)
  185. Householder (reflections) method for the QR decomposition, SCALAPACK‏‎ (08:33, 9 July 2022)
  186. Householder (reflections) method for reducing a symmetric matrix to tridiagonal form, locality‏‎ (08:41, 9 July 2022)
  187. Householder (reflections) method for reducing a symmetric matrix to tridiagonal form, SCALAPACK‏‎ (08:44, 9 July 2022)
  188. Householder (reflections) method for the QR decomposition of a (real) Hessenberg matrix‏‎ (08:51, 9 July 2022)
  189. Givens (rotations) method for the QR decomposition of a (real) Hessenberg matrix‏‎ (08:52, 9 July 2022)
  190. Householder (reflections) reduction of a matrix to bidiagonal form, locality‏‎ (11:05, 12 July 2022)
  191. Householder (reflections) reduction of a matrix to bidiagonal form, SCALAPACK‏‎ (11:09, 12 July 2022)
  192. HPCG, locality‏‎ (11:27, 12 July 2022)
  193. HPCG, scalability‏‎ (11:31, 12 July 2022)
  194. BiCGStab, MIT‏‎ (11:41, 12 July 2022)
  195. BiCGStab, HYPRE‏‎ (11:49, 12 July 2022)
  196. BiCGStab, NVIDIA AmgX‏‎ (11:52, 12 July 2022)
  197. Kaczmarz's, MATLAB1‏‎ (15:29, 12 July 2022)
  198. Kaczmarz's, MATLAB2‏‎ (15:32, 12 July 2022)
  199. Kaczmarz's, MATLAB3‏‎ (15:37, 12 July 2022)
  200. Linpack, locality‏‎ (16:06, 12 July 2022)
  201. Linpack, HPL‏‎ (16:11, 12 July 2022)
  202. Linpack benchmark‏‎ (16:15, 12 July 2022)
  203. Thomas algorithm, locality‏‎ (09:15, 14 July 2022)
  204. Thomas algorithm, pointwise version‏‎ (09:20, 14 July 2022)
  205. Thomas, locality‏‎ (09:29, 14 July 2022)
  206. Repeated Thomas, locality‏‎ (11:02, 14 July 2022)
  207. Two-sided Thomas, locality‏‎ (11:50, 14 July 2022)
  208. Two-sided Thomas algorithm, pointwise version‏‎ (11:57, 14 July 2022)
  209. Repeated two-sided Thomas, locality‏‎ (13:22, 14 July 2022)
  210. Complete cyclic reduction, locality‏‎ (13:49, 14 July 2022)
  211. Complete cyclic reduction, scalability‏‎ (13:55, 14 July 2022)
  212. Forward substitution‏‎ (09:48, 18 July 2022)
  213. Backward substitution, locality‏‎ (10:01, 18 July 2022)
  214. Backward substitution, scalability‏‎ (14:27, 18 July 2022)
  215. Backward substitution‏‎ (14:31, 18 July 2022)
  216. Binary search, locality‏‎ (16:23, 18 July 2022)
  217. Binary search, С‏‎ (16:27, 18 July 2022)
  218. Binary search, C++‏‎ (16:30, 18 July 2022)
  219. Binary search, Java‏‎ (16:33, 18 July 2022)
  220. Binary search, .NET Framework 2.0‏‎ (16:36, 18 July 2022)
  221. Binary search, Python‏‎ (16:39, 18 July 2022)
  222. Single-qubit transform of a state vector, locality‏‎ (15:38, 19 July 2022)
  223. Single-qubit transform of a state vector, scalability‏‎ (15:48, 19 July 2022)
  224. Single-qubit transform of a state vector‏‎ (15:56, 19 July 2022)
  225. K-means clustering, scalability1‏‎ (16:09, 19 July 2022)
  226. K-means clustering, scalability2‏‎ (16:15, 19 July 2022)
  227. K-means clustering, scalability3‏‎ (16:21, 19 July 2022)
  228. K-means clustering, scalability4‏‎ (16:28, 19 July 2022)
  229. K-means clustering, CrimeStat‏‎ (16:33, 19 July 2022)
  230. K-means clustering, Julia‏‎ (16:35, 19 July 2022)
  231. K-means clustering, Apache Mahout‏‎ (16:38, 19 July 2022)
  232. K-means clustering, Octave‏‎ (16:40, 19 July 2022)
  233. K-means clustering, Spark‏‎ (16:43, 19 July 2022)
  234. K-means clustering, Torch‏‎ (16:51, 19 July 2022)
  235. K-means clustering, Weka‏‎ (16:54, 19 July 2022)
  236. K-means clustering, Accord.NET‏‎ (16:57, 19 July 2022)
  237. K-means clustering, OpenCV‏‎ (17:04, 19 July 2022)
  238. K-means clustering, MLPACK‏‎ (17:07, 19 July 2022)
  239. K-means clustering, SciPy‏‎ (17:09, 19 July 2022)
  240. K-means clustering, scikit-learn‏‎ (17:12, 19 July 2022)
  241. K-means clustering, R‏‎ (17:14, 19 July 2022)
  242. K-means clustering, ELKI‏‎ (17:16, 19 July 2022)
  243. K-means clustering, Ayasdi‏‎ (17:19, 19 July 2022)
  244. K-means clustering, Stata‏‎ (17:24, 19 July 2022)
  245. K-means clustering, Mathematica‏‎ (17:27, 19 July 2022)
  246. K-means clustering, MATLAB‏‎ (17:30, 19 July 2022)
  247. K-means clustering, SAS‏‎ (17:33, 19 July 2022)
  248. K-means clustering, RapidMiner‏‎ (17:37, 19 July 2022)
  249. K-means clustering, SAP HANA‏‎ (17:40, 19 July 2022)
  250. Face recognition, scalability‏‎ (16:26, 20 July 2022)

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

Retrieved from "https://algowiki-project.org/en/Special:AncientPages"