Oldest pages

Jump to navigation Jump to search

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

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

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

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

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