Short pages

Jump to navigation Jump to search

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

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

  1. (hist) ‎Back substitution ‎[0 bytes]
  2. (hist) ‎Elimination method, pointwise version ‎[0 bytes]
  3. (hist) ‎Шаблон:Buttonlinkimp ‎[75 bytes]
  4. (hist) ‎BiCGStab, MIT ‎[77 bytes]
  5. (hist) ‎HPCG, locality ‎[78 bytes]
  6. (hist) ‎Lanczos, C, MPI ‎[79 bytes]
  7. (hist) ‎BiCGStab, HYPRE ‎[79 bytes]
  8. (hist) ‎Thomas algorithm ‎[80 bytes]
  9. (hist) ‎Lanczos, C++, MPI ‎[81 bytes]
  10. (hist) ‎HPCG, scalability ‎[81 bytes]
  11. (hist) ‎Binary search, С ‎[81 bytes]
  12. (hist) ‎SDDP, scalability ‎[81 bytes]
  13. (hist) ‎Binary search, C++ ‎[82 bytes]
  14. (hist) ‎QR algorithm ‎[83 bytes]
  15. (hist) ‎Kaczmarz's, MATLAB1 ‎[83 bytes]
  16. (hist) ‎Kaczmarz's, MATLAB2 ‎[83 bytes]
  17. (hist) ‎Kaczmarz's, MATLAB3 ‎[83 bytes]
  18. (hist) ‎Binary search, Java ‎[83 bytes]
  19. (hist) ‎GHS algorithm ‎[84 bytes]
  20. (hist) ‎VF2 algorithm ‎[84 bytes]
  21. (hist) ‎Lanczos, MPI, OpenMP ‎[84 bytes]
  22. (hist) ‎Lanczos, C++, MPI, 2 ‎[84 bytes]
  23. (hist) ‎Lanczos, C++, MPI, 3 ‎[84 bytes]
  24. (hist) ‎BiCGStab, NVIDIA AmgX ‎[85 bytes]
  25. (hist) ‎Binary search, Python ‎[85 bytes]
  26. (hist) ‎K-means clustering, R ‎[85 bytes]
  27. (hist) ‎Floyd-Warshall algorithm ‎[87 bytes]
  28. (hist) ‎Binary search, locality ‎[87 bytes]
  29. (hist) ‎K-means clustering, Weka ‎[88 bytes]
  30. (hist) ‎K-means clustering, ELKI ‎[88 bytes]
  31. (hist) ‎Repeated Thomas, locality ‎[89 bytes]
  32. (hist) ‎K-means clustering, Julia ‎[89 bytes]
  33. (hist) ‎K-means clustering, Spark ‎[89 bytes]
  34. (hist) ‎K-means clustering, Torch ‎[89 bytes]
  35. (hist) ‎K-means clustering, SciPy ‎[89 bytes]
  36. (hist) ‎Floyd-Warshall, scalability ‎[90 bytes]
  37. (hist) ‎K-means clustering, Octave ‎[90 bytes]
  38. (hist) ‎K-means clustering, OpenCV ‎[90 bytes]
  39. (hist) ‎K-means clustering, MLPACK ‎[90 bytes]
  40. (hist) ‎Binary search: Finding the position of a target value within a sorted array ‎[91 bytes]
  41. (hist) ‎Prim's algorithm ‎[91 bytes]
  42. (hist) ‎K-means clustering, CrimeStat ‎[93 bytes]
  43. (hist) ‎Face recognition, scalability ‎[93 bytes]
  44. (hist) ‎K-means clustering, Accord.NET ‎[94 bytes]
  45. (hist) ‎Block Thomas algorithm ‎[95 bytes]
  46. (hist) ‎Kaczmarz's algorithm ‎[95 bytes]
  47. (hist) ‎Ullman's algorithm ‎[95 bytes]
  48. (hist) ‎Участник:VolkovNikita94 ‎[95 bytes]
  49. (hist) ‎K-means clustering, scalability1 ‎[96 bytes]
  50. (hist) ‎K-means clustering, scalability2 ‎[96 bytes]
  51. (hist) ‎K-means clustering, scalability3 ‎[96 bytes]
  52. (hist) ‎K-means clustering, scalability4 ‎[96 bytes]
  53. (hist) ‎K-means clustering, scikit-learn ‎[96 bytes]
  54. (hist) ‎Δ-stepping algorithm ‎[97 bytes]
  55. (hist) ‎Johnson's algorithm ‎[97 bytes]
  56. (hist) ‎Kruskal's algorithm ‎[97 bytes]
  57. (hist) ‎Auction algorithm ‎[97 bytes]
  58. (hist) ‎Face recognition ‎[97 bytes]
  59. (hist) ‎Binary search, .NET Framework 2.0 ‎[97 bytes]
  60. (hist) ‎K-means clustering, Apache Mahout ‎[97 bytes]
  61. (hist) ‎Depth-first search (DFS) ‎[98 bytes]
  62. (hist) ‎Uniform norm of a vector, locality ‎[98 bytes]
  63. (hist) ‎Backward substitution, scalability ‎[98 bytes]
  64. (hist) ‎Repeated two-sided Thomas, locality ‎[99 bytes]
  65. (hist) ‎Complete cyclic reduction, locality ‎[99 bytes]
  66. (hist) ‎Hungarian algorithm ‎[101 bytes]
  67. (hist) ‎Complete cyclic reduction, scalability ‎[102 bytes]
  68. (hist) ‎Meet-in-the-middle attack, scalability ‎[102 bytes]
  69. (hist) ‎Cubature rules ‎[103 bytes]
  70. (hist) ‎Pairwise summation of numbers, locality ‎[103 bytes]
  71. (hist) ‎Pairwise summation of numbers, scalability ‎[106 bytes]
  72. (hist) ‎Meet-in-the-middle attack, implementation1 ‎[106 bytes]
  73. (hist) ‎Meet-in-the-middle attack, implementation2 ‎[106 bytes]
  74. (hist) ‎Meet-in-the-middle attack, implementation3 ‎[106 bytes]
  75. (hist) ‎Triangular decompositions ‎[107 bytes]
  76. (hist) ‎K-means clustering ‎[107 bytes]
  77. (hist) ‎Stone doubling algorithm ‎[108 bytes]
  78. (hist) ‎Dense matrix-vector multiplication, locality ‎[108 bytes]
  79. (hist) ‎Open Encyclopedia of Parallel Algorithmic Features ‎[110 bytes]
  80. (hist) ‎Dense matrix multiplication ‎[110 bytes]
  81. (hist) ‎Matrix decomposition problem ‎[110 bytes]
  82. (hist) ‎Hopcroft–Karp algorithm ‎[110 bytes]
  83. (hist) ‎Meet-in-the-middle attack ‎[110 bytes]
  84. (hist) ‎Pairwise summation ‎[111 bytes]
  85. (hist) ‎Dense matrix-vector multiplication, scalability ‎[111 bytes]
  86. (hist) ‎Ford–Fulkerson algorithm ‎[112 bytes]
  87. (hist) ‎Longest shortest path ‎[114 bytes]
  88. (hist) ‎Tarjan-Vishkin biconnected components, scalability ‎[114 bytes]
  89. (hist) ‎High Performance Conjugate Gradient (HPCG) benchmark ‎[116 bytes]
  90. (hist) ‎Newton's method for systems of nonlinear equations, PETSc ‎[121 bytes]
  91. (hist) ‎QR algorithm as implemented in SCALAPACK ‎[122 bytes]
  92. (hist) ‎Newton's method for systems of nonlinear equations, Sundials ‎[124 bytes]
  93. (hist) ‎Newton's method for systems of nonlinear equations, ALIAS C++ ‎[125 bytes]
  94. (hist) ‎Newton's method for systems of nonlinear equations, parallel1 ‎[125 bytes]
  95. (hist) ‎Newton's method for systems of nonlinear equations, parallel2 ‎[125 bytes]
  96. (hist) ‎Newton's method for systems of nonlinear equations, parallel3 ‎[125 bytes]
  97. (hist) ‎Complete cyclic reduction ‎[127 bytes]
  98. (hist) ‎Disjoint set union ‎[128 bytes]
  99. (hist) ‎Preflow-Push algorithm ‎[128 bytes]
  100. (hist) ‎Newton's method for systems of nonlinear equations, scalability1 ‎[128 bytes]
  101. (hist) ‎Newton's method for systems of nonlinear equations, scalability2 ‎[128 bytes]
  102. (hist) ‎Newton's method for systems of nonlinear equations, scalability3 ‎[128 bytes]
  103. (hist) ‎Newton's method for systems of nonlinear equations, scalability4 ‎[128 bytes]
  104. (hist) ‎Classical orthogonalization method ‎[130 bytes]
  105. (hist) ‎Two-sided Thomas algorithm, block variant ‎[130 bytes]
  106. (hist) ‎Householder (reflections) method for the QR decomposition, locality ‎[131 bytes]
  107. (hist) ‎Householder (reflections) method for the QR decomposition, SCALAPACK ‎[132 bytes]
  108. (hist) ‎Newton's method for systems of nonlinear equations, Numerical Recipes ‎[133 bytes]
  109. (hist) ‎Gaussian elimination (finding the LU decomposition) ‎[134 bytes]
  110. (hist) ‎Vertex connectivity of a graph ‎[135 bytes]
  111. (hist) ‎Orthogonalization method with reorthogonalization ‎[136 bytes]
  112. (hist) ‎Tarjan's algorithm for finding the bridges of a graph ‎[139 bytes]
  113. (hist) ‎Householder (reflections) reduction of a matrix to bidiagonal form, locality ‎[140 bytes]
  114. (hist) ‎Householder (reflections) reduction of a matrix to bidiagonal form, SCALAPACK ‎[141 bytes]
  115. (hist) ‎Fast Fourier transform for powers-of-two ‎[142 bytes]
  116. (hist) ‎Newton's method for systems of nonlinear equations ‎[149 bytes]
  117. (hist) ‎Newton's method for systems of nonlinear equations, Numerical Mathematics - NewtonLib ‎[149 bytes]
  118. (hist) ‎Repeated two-sided Thomas algorithm, pointwise version ‎[151 bytes]
  119. (hist) ‎Two-qubit transform of a state vector ‎[151 bytes]
  120. (hist) ‎Tarjan's biconnected components algorithm ‎[152 bytes]
  121. (hist) ‎Reducing matrices to compact forms ‎[156 bytes]
  122. (hist) ‎Numerical quadrature (cubature) rules on an interval (for a multidimensional cube), scalability ‎[159 bytes]
  123. (hist) ‎Repeated Thomas algorithm, pointwise version ‎[161 bytes]
  124. (hist) ‎Shiloach-Vishkin algorithm for finding the connected components ‎[161 bytes]
  125. (hist) ‎Tarjan's strongly connected components algorithm ‎[161 bytes]
  126. (hist) ‎Gabow's edge connectivity algorithm ‎[163 bytes]
  127. (hist) ‎Parallel prefix scan algorithm using pairwise summation ‎[165 bytes]
  128. (hist) ‎Finding minimal-cost flow in a transportation network ‎[166 bytes]
  129. (hist) ‎Tarjan-Vishkin biconnected components algorithm ‎[167 bytes]
  130. (hist) ‎Symmetric QR algorithm as implemented in SCALAPACK ‎[167 bytes]
  131. (hist) ‎Biconjugate gradient stabilized method (BiCGStab) ‎[168 bytes]
  132. (hist) ‎Stone doubling algorithm for solving bidiagonal SLAEs ‎[170 bytes]
  133. (hist) ‎Hessenberg QR algorithm as implemented in SCALAPACK ‎[173 bytes]
  134. (hist) ‎Stochastic dual dynamic programming (SDDP) ‎[182 bytes]
  135. (hist) ‎QR algorithm for complex Hermitian matrices as implemented in SCALAPACK ‎[184 bytes]
  136. (hist) ‎Lanczos algorithm in exact algorithm (without reorthogonalization) ‎[184 bytes]
  137. (hist) ‎Gaussian elimination with row pivoting ‎[185 bytes]
  138. (hist) ‎Gaussian elimination with column pivoting ‎[187 bytes]
  139. (hist) ‎Givens (rotations) method for the QR decomposition of a (real) Hessenberg matrix ‎[188 bytes]
  140. (hist) ‎Singular value decomposition (finding singular values and singular vectors) ‎[190 bytes]
  141. (hist) ‎Eigenvalue decomposition (finding eigenvalues and eigenvectors) ‎[192 bytes]
  142. (hist) ‎Gaussian elimination with complete pivoting ‎[196 bytes]
  143. (hist) ‎Householder (reflections) method for the QR decomposition of a (real) Hessenberg matrix ‎[197 bytes]
  144. (hist) ‎Serial Jacobi (rotations) method for symmetric matrices ‎[198 bytes]
  145. (hist) ‎Unitary reductions to Hessenberg form ‎[200 bytes]
  146. (hist) ‎Householder (reflections) reduction of a matrix to bidiagonal form ‎[201 bytes]
  147. (hist) ‎The Jacobi (rotations) method for solving the symmetric eigenvalue problem ‎[205 bytes]
  148. (hist) ‎Gaussian elimination with diagonal pivoting ‎[206 bytes]
  149. (hist) ‎Unitary reductions to tridiagonal form ‎[206 bytes]
  150. (hist) ‎Compact scheme for Gaussian elimination and its modifications: Tridiagonal matrix ‎[207 bytes]
  151. (hist) ‎Jacobi (rotations) method for finding singular values ‎[208 bytes]
  152. (hist) ‎Serial-parallel algorithm for the LU decomposition of a tridiagonal matrix ‎[215 bytes]
  153. (hist) ‎Serial Jacobi (rotations) method with thresholds for symmetric matrices ‎[220 bytes]
  154. (hist) ‎The classical Jacobi (rotations) method with pivoting for symmetric matrices ‎[221 bytes]
  155. (hist) ‎Uniform norm of a vector: Real version, serial-parallel variant ‎[223 bytes]
  156. (hist) ‎Numerical quadrature (cubature) rules on an interval (for a multidimensional cube) ‎[230 bytes]
  157. (hist) ‎Householder (reflections) method for the QR decomposition of a square matrix, real point-wise version ‎[236 bytes]
  158. (hist) ‎Serial-parallel method for solving tridiagonal matrices based on the LU decomposition and backward substitutions ‎[269 bytes]
  159. (hist) ‎Classical point-wise Householder (reflections) method for reducing a matrix to Hessenberg form ‎[275 bytes]
  160. (hist) ‎Householder (reflections) method for reducing a complex Hermitian matrix to symmetric tridiagonal form ‎[275 bytes]
  161. (hist) ‎Help ‎[379 bytes]
  162. (hist) ‎Unitary-triangular factorizations ‎[527 bytes]
  163. (hist) ‎K-means clustering, Stata ‎[579 bytes]
  164. (hist) ‎K-means clustering, SAS ‎[590 bytes]
  165. (hist) ‎K-means clustering, Mathematica ‎[605 bytes]
  166. (hist) ‎BFS, GAP ‎[608 bytes]
  167. (hist) ‎BFS, RCC for CPU ‎[615 bytes]
  168. (hist) ‎K-means clustering, MATLAB ‎[616 bytes]
  169. (hist) ‎K-means clustering, RapidMiner ‎[621 bytes]
  170. (hist) ‎BFS, MPI, Graph500 ‎[624 bytes]
  171. (hist) ‎LU decomposition using Gaussian elimination without pivoting ‎[625 bytes]
  172. (hist) ‎Boruvka's, RCC for GPU ‎[625 bytes]
  173. (hist) ‎K-means clustering, Ayasdi ‎[635 bytes]
  174. (hist) ‎BFS, RCC for GPU ‎[637 bytes]
  175. (hist) ‎BFS, Ligra ‎[642 bytes]
  176. (hist) ‎VF2, C++, VF Library ‎[669 bytes]
  177. (hist) ‎K-means clustering, SAP HANA ‎[674 bytes]
  178. (hist) ‎Boruvka's, RCC for CPU ‎[677 bytes]
  179. (hist) ‎QR decomposition methods for dense Hessenberg matrices ‎[687 bytes]
  180. (hist) ‎Δ-stepping, Gap ‎[698 bytes]
  181. (hist) ‎Cooley-Tukey, scalability ‎[701 bytes]
  182. (hist) ‎Bellman-Ford, Ligra ‎[703 bytes]
  183. (hist) ‎Bellman-Ford, MPI, Graph500 ‎[705 bytes]
  184. (hist) ‎Bellman-Ford, OpenMP, Stinger ‎[712 bytes]
  185. (hist) ‎Bellman-Ford, Nvidia nvGraph ‎[719 bytes]
  186. (hist) ‎Ullman's, C++, VF Library ‎[723 bytes]
  187. (hist) ‎HITS, VGL ‎[726 bytes]
  188. (hist) ‎PageRank, VGL ‎[731 bytes]
  189. (hist) ‎Disjoint set union, Java, JGraphT ‎[741 bytes]
  190. (hist) ‎BFS, VGL ‎[743 bytes]
  191. (hist) ‎Prim's, Java, JGraphT ‎[752 bytes]
  192. (hist) ‎VF2, Python, NetworkX ‎[754 bytes]
  193. (hist) ‎BFS, Python/C++, NetworKit ‎[757 bytes]
  194. (hist) ‎Bellman-Ford, Java, JGraphT ‎[758 bytes]
  195. (hist) ‎BFS, C++, MPI, Boost Graph Library ‎[761 bytes]
  196. (hist) ‎Kruskal's, Java, JGraphT ‎[761 bytes]
  197. (hist) ‎Floyd-Warshall, Java, JGraphT ‎[765 bytes]
  198. (hist) ‎Ullman's, C++, Chemical Descriptors Library ‎[767 bytes]
  199. (hist) ‎BFS, Java, WebGraph ‎[772 bytes]
  200. (hist) ‎BFS, Python, NetworkX ‎[773 bytes]
  201. (hist) ‎VF2, C++, Boost Graph Library ‎[773 bytes]
  202. (hist) ‎Hopcroft–Karp, Java, JGraphT ‎[773 bytes]
  203. (hist) ‎Tarjan's biconnected components, Java, JGraphT ‎[777 bytes]
  204. (hist) ‎Dijkstra, VGL, push ‎[779 bytes]
  205. (hist) ‎Dijkstra, VGL, pull ‎[779 bytes]
  206. (hist) ‎Bellman-Ford, C++, Boost Graph Library ‎[791 bytes]
  207. (hist) ‎Tarjan's strongly connected components, Java, JGraphT ‎[792 bytes]
  208. (hist) ‎Disjoint set union, Boost Graph Library ‎[794 bytes]
  209. (hist) ‎Floyd-Warshall, C++, Boost Graph Library ‎[797 bytes]
  210. (hist) ‎Dijkstra, Python/C++ ‎[803 bytes]
  211. (hist) ‎Johnson's, C++, Boost Graph Library ‎[804 bytes]
  212. (hist) ‎Tarjan's strongly connected components, C++, Boost Graph Library ‎[809 bytes]
  213. (hist) ‎Tarjan's biconnected components, C++, Boost Graph Library ‎[812 bytes]
  214. (hist) ‎DFS, Python, NetworkX ‎[817 bytes]
  215. (hist) ‎Ford–Fulkerson, Java, JGraphT ‎[819 bytes]
  216. (hist) ‎BFS, C++, Boost Graph Library ‎[820 bytes]
  217. (hist) ‎Tarjan's strongly connected components, Java, WebGraph ‎[820 bytes]
  218. (hist) ‎Kruskal's, Python, NetworkX ‎[821 bytes]
  219. (hist) ‎Preflow-Push, C++, Boost Graph Library ‎[823 bytes]
  220. (hist) ‎Bellman-Ford, Python, NetworkX ‎[827 bytes]
  221. (hist) ‎Floyd-Warshall, Python, NetworkX ‎[830 bytes]
  222. (hist) ‎Prim's, C++, Boost Graph Library ‎[831 bytes]
  223. (hist) ‎Kruskal's, C++, Boost Graph Library ‎[832 bytes]
  224. (hist) ‎Hungarian, Java, JGraphT ‎[837 bytes]
  225. (hist) ‎Longest shortest path, Python/C++, NetworKit ‎[842 bytes]
  226. (hist) ‎DFS, C++, MPI, Parallel Boost Graph Library ‎[845 bytes]
  227. (hist) ‎Tarjan's biconnected components, Python, NetworkX ‎[865 bytes]
  228. (hist) ‎Ford–Fulkerson, Python, NetworkX ‎[871 bytes]
  229. (hist) ‎Poisson equation, solving with DFT, FFTW ‎[882 bytes]
  230. (hist) ‎Preflow-Push, Python, NetworkX ‎[886 bytes]
  231. (hist) ‎Poisson equation, solving with DFT, P3DFFT ‎[890 bytes]
  232. (hist) ‎Dijkstra, Python ‎[891 bytes]
  233. (hist) ‎Tarjan's strongly connected components, Python, NetworkX ‎[893 bytes]
  234. (hist) ‎Tarjan's strongly connected components, Python/C++, NetworKit ‎[897 bytes]
  235. (hist) ‎Poisson equation, solving with DFT, cuFFT ‎[897 bytes]
  236. (hist) ‎Poisson equation, solving with DFT, FFTE ‎[898 bytes]
  237. (hist) ‎Poisson equation, solving with DFT, MKL FFT ‎[902 bytes]
  238. (hist) ‎Poisson equation, solving with DFT, AccFFT ‎[908 bytes]
  239. (hist) ‎Poisson equation, solving with DFT, PFFT ‎[918 bytes]
  240. (hist) ‎Ford–Fulkerson, C++, Boost Graph Library ‎[937 bytes]
  241. (hist) ‎LU decomposition via Gaussian elimination ‎[943 bytes]
  242. (hist) ‎Triangular decomposition of a Gram matrix ‎[950 bytes]
  243. (hist) ‎DFS, C++, Boost Graph Library ‎[957 bytes]
  244. (hist) ‎Dijkstra, C++, Boost Graph Library ‎[963 bytes]
  245. (hist) ‎Δ-stepping, C++, MPI, Parallel Boost Graph Library ‎[964 bytes]
  246. (hist) ‎Dijkstra, C++, MPI: Parallel Boost Graph Library, 1 ‎[1,009 bytes]
  247. (hist) ‎Cooley-Tukey, locality ‎[1,114 bytes]
  248. (hist) ‎Longest shortest path, Java, WebGraph ‎[1,256 bytes]
  249. (hist) ‎Boruvka's, C++, MPI, Parallel Boost Graph Library ‎[1,261 bytes]
  250. (hist) ‎Dijkstra, C++, MPI: Parallel Boost Graph Library, 2 ‎[1,350 bytes]
  251. (hist) ‎Householder (reflections) method for the QR decomposition of a matrix ‎[1,401 bytes]
  252. (hist) ‎LU decomposition using Gaussian elimination with pivoting ‎[1,423 bytes]
  253. (hist) ‎Kruskal's, C++, MPI, Parallel Boost Graph Library ‎[1,457 bytes]
  254. (hist) ‎Search for isomorphic subgraphs ‎[1,659 bytes]
  255. (hist) ‎Givens (rotations) method for the QR decomposition of a matrix ‎[1,809 bytes]
  256. (hist) ‎The dqds algorithm for calculating singular values of bidiagonal matrices ‎[1,840 bytes]
  257. (hist) ‎Purdom's, Boost Graph Library ‎[2,304 bytes]
  258. (hist) ‎Householder (reflections) method for reducing of a matrix to Hessenberg form ‎[2,422 bytes]
  259. (hist) ‎Poisson equation, solving with DFT, scalability ‎[2,604 bytes]
  260. (hist) ‎DCSC for finding the strongly connected components, C++, MPI, Parallel Boost Graph Library ‎[2,639 bytes]
  261. (hist) ‎Assignment problem ‎[2,797 bytes]
  262. (hist) ‎Dot product, scalability ‎[3,105 bytes]
  263. (hist) ‎LU decomposition via Gaussian elimination, scalability ‎[3,407 bytes]
  264. (hist) ‎Givens method, locality ‎[3,509 bytes]
  265. (hist) ‎The serial-parallel summation method, locality ‎[3,524 bytes]
  266. (hist) ‎Dense matrix multiplication, scalability ‎[3,550 bytes]
  267. (hist) ‎The serial-parallel summation method, scalability ‎[3,552 bytes]
  268. (hist) ‎Finding maximal flow in a transportation network ‎[3,721 bytes]
  269. (hist) ‎Dot product, locality ‎[3,730 bytes]
  270. (hist) ‎Linpack, HPL ‎[4,026 bytes]
  271. (hist) ‎QR decomposition of dense nonsingular matrices ‎[4,050 bytes]
  272. (hist) ‎Orthogonalization method ‎[4,430 bytes]
  273. (hist) ‎Cholesky decomposition, scalability ‎[4,546 bytes]
  274. (hist) ‎One step of the dqds, LAPACK ‎[4,696 bytes]
  275. (hist) ‎Pairwise summation of numbers ‎[4,707 bytes]
  276. (hist) ‎Bellman-Ford, locality ‎[4,769 bytes]
  277. (hist) ‎Boruvka's, locality ‎[5,049 bytes]
  278. (hist) ‎Householder (reflections) method for reducing a symmetric matrix to tridiagonal form, locality ‎[5,336 bytes]
  279. (hist) ‎Cholesky decomposition, SCALAPACK ‎[5,529 bytes]
  280. (hist) ‎Bellman-Ford, scalability ‎[5,787 bytes]
  281. (hist) ‎Single-qubit transform of a state vector, scalability ‎[5,789 bytes]
  282. (hist) ‎Horners, locality ‎[5,792 bytes]
  283. (hist) ‎Boruvka's, scalability ‎[5,868 bytes]
  284. (hist) ‎Single-qubit transform of a state vector, locality ‎[6,157 bytes]
  285. (hist) ‎Cholesky decomposition, locality ‎[6,337 bytes]
  286. (hist) ‎Dijkstra, locality ‎[6,409 bytes]
  287. (hist) ‎Linpack, locality ‎[6,582 bytes]
  288. (hist) ‎Poisson equation, solving with DFT, locality ‎[6,763 bytes]
  289. (hist) ‎Horners method ‎[6,835 bytes]
  290. (hist) ‎Dijkstra's algorithm ‎[6,845 bytes]
  291. (hist) ‎Single Source Shortest Path (SSSP) ‎[7,288 bytes]
  292. (hist) ‎The serial-parallel summation method ‎[7,465 bytes]
  293. (hist) ‎Householder (reflections) method for reducing a symmetric matrix to tridiagonal form, SCALAPACK ‎[7,498 bytes]
  294. (hist) ‎Transitive closure of a directed graph ‎[7,508 bytes]
  295. (hist) ‎LU decomposition via Gaussian elimination, locality ‎[7,632 bytes]
  296. (hist) ‎Backward substitution, locality ‎[7,648 bytes]
  297. (hist) ‎About project ‎[7,657 bytes]
  298. (hist) ‎Dijkstra, Google ‎[8,387 bytes]
  299. (hist) ‎Dense matrix-vector multiplication ‎[8,409 bytes]
  300. (hist) ‎Thomas, locality ‎[8,488 bytes]
  301. (hist) ‎Thomas algorithm, locality ‎[8,498 bytes]
  302. (hist) ‎Dense matrix multiplication (serial version for real matrices) ‎[8,676 bytes]
  303. (hist) ‎Dot product ‎[8,732 bytes]
  304. (hist) ‎Bellman-Ford algorithm ‎[8,948 bytes]
  305. (hist) ‎Construction of the minimum spanning tree (MST) ‎[9,031 bytes]
  306. (hist) ‎Two-sided Thomas, locality ‎[9,199 bytes]
  307. (hist) ‎Gaussian elimination, compact scheme for tridiagonal matrices, serial version ‎[9,330 bytes]
  308. (hist) ‎Dense matrix multiplication, locality ‎[9,363 bytes]
  309. (hist) ‎Gaussian elimination, compact scheme for tridiagonal matrices, serial variant ‎[9,486 bytes]
  310. (hist) ‎Graph connectivity ‎[9,572 bytes]
  311. (hist) ‎All Pairs Shortest Path (APSP) ‎[10,383 bytes]
  312. (hist) ‎Methods for solving tridiagonal SLAEs ‎[10,435 bytes]
  313. (hist) ‎Forward substitution ‎[10,596 bytes]
  314. (hist) ‎Cooley–Tukey Fast Fourier Transform, radix-2 case ‎[10,606 bytes]
  315. (hist) ‎Gaussian elimination, compact scheme for tridiagonal matrices and its modifications ‎[10,636 bytes]
  316. (hist) ‎Single-qubit transform of a state vector ‎[11,023 bytes]
  317. (hist) ‎Linpack benchmark ‎[11,057 bytes]
  318. (hist) ‎Stone doubling algorithm for the LU decomposition of a tridiagonal matrix ‎[11,754 bytes]
  319. (hist) ‎Thomas algorithm, pointwise version ‎[11,793 bytes]
  320. (hist) ‎Breadth-first search (BFS) ‎[11,853 bytes]
  321. (hist) ‎One step of the dqds algorithm ‎[12,038 bytes]
  322. (hist) ‎Two-sided Thomas algorithm, pointwise version ‎[12,979 bytes]
  323. (hist) ‎Algorithm classification ‎[14,160 bytes]
  324. (hist) ‎Purdom's algorithm ‎[14,464 bytes]
  325. (hist) ‎Boruvka's algorithm ‎[14,885 bytes]
  326. (hist) ‎Householder (reflections) method for reducing a symmetric matrix to tridiagonal form ‎[16,217 bytes]
  327. (hist) ‎Backward substitution ‎[16,438 bytes]
  328. (hist) ‎DCSC algorithm for finding the strongly connected components ‎[16,575 bytes]
  329. (hist) ‎Givens method ‎[19,186 bytes]
  330. (hist) ‎Poisson equation, solving with DFT ‎[23,205 bytes]
  331. (hist) ‎Description of algorithm properties and structure ‎[23,254 bytes]
  332. (hist) ‎Cholesky decomposition ‎[27,885 bytes]
  333. (hist) ‎Glossary ‎[35,612 bytes]
  334. (hist) ‎Cholesky method ‎[36,489 bytes]

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

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