User contributions
Jump to navigation
Jump to search
- 14:38, 10 February 2016 diff hist +72 Cholesky method
- 14:36, 10 February 2016 diff hist +259 Forward substitution
- 14:29, 10 February 2016 diff hist -6,891 Cooley–Tukey Fast Fourier Transform, radix-2 case
- 14:17, 10 February 2016 diff hist -3 Backward substitution
- 14:11, 10 February 2016 diff hist +90 Single Source Shortest Path (SSSP)
- 14:09, 10 February 2016 diff hist +95 All Pairs Shortest Path (APSP)
- 14:08, 10 February 2016 diff hist +81 Transitive closure of a directed graph
- 14:07, 10 February 2016 diff hist +93 Construction of the minimum spanning tree (MST)
- 14:06, 10 February 2016 diff hist +60 Search for isomorphic subgraphs
- 14:04, 10 February 2016 diff hist +44 Graph connectivity
- 13:57, 10 February 2016 diff hist +119 Finding maximal flow in a transportation network
- 17:23, 9 February 2016 diff hist -140 Glossary
- 16:40, 5 February 2016 diff hist +28 Dense matrix multiplication (serial version for real matrices)
- 16:25, 5 February 2016 diff hist -3 Dot product
- 16:20, 5 February 2016 diff hist +1 Elimination method, pointwise version →Implementation peculiarities of the serial algorithm
- 16:19, 5 February 2016 diff hist -107 Elimination method, pointwise version →Implementation peculiarities of the serial algorithm
- 16:17, 5 February 2016 diff hist +11 Elimination method, pointwise version →Properties of the algorithm
- 16:16, 5 February 2016 diff hist +64 Elimination method, pointwise version →Parallelization resource of the algorithm
- 16:13, 5 February 2016 diff hist +25 Elimination method, pointwise version →Serial complexity of the algorithm
- 16:12, 5 February 2016 diff hist +77 Elimination method, pointwise version →Implementation scheme of the serial algorithm
- 16:09, 5 February 2016 diff hist 0 Cholesky decomposition
- 16:09, 5 February 2016 diff hist +287 Elimination method, pointwise version
- 16:08, 5 February 2016 diff hist +39 Givens method
- 16:01, 5 February 2016 diff hist +255 Horners method
- 15:50, 5 February 2016 diff hist +8 Givens method
- 15:48, 5 February 2016 diff hist +6 Cholesky decomposition
- 11:50, 4 February 2016 diff hist -73 Elimination method, pointwise version
- 11:47, 4 February 2016 diff hist +535 Elimination method, pointwise version
- 11:29, 4 February 2016 diff hist +747 Elimination method, pointwise version
- 11:23, 4 February 2016 diff hist +107 Elimination method, pointwise version
- 11:22, 4 February 2016 diff hist -59 Elimination method, pointwise version
- 17:54, 3 February 2016 diff hist +133 Template:Tridiagonal SLAE current
- 17:39, 3 February 2016 diff hist -1,396 Elimination method, pointwise version
- 17:38, 3 February 2016 diff hist +1,464 N Template:Tridiagonal SLAE Created page with ":<math> A = \begin{bmatrix} a_{11} & a_{12} & 0 & \cdots & \cdots & 0 \\ a_{21} & a_{22} & a_{23}& \cdots & \cdots & 0 \\ 0 & a_{32} & a_{33} & \cdots & \cdots..."
- 17:36, 3 February 2016 diff hist -810 Elimination method, pointwise version
- 16:42, 3 February 2016 diff hist -51 Cholesky decomposition
- 16:41, 3 February 2016 diff hist -199 Cholesky decomposition
- 17:16, 2 February 2016 diff hist +22 Algorithm classification
- 16:39, 2 February 2016 diff hist -107 Givens method →General description of the algorithm
- 16:38, 2 February 2016 diff hist -5 Givens method →General description of the algorithm
- 16:37, 2 February 2016 diff hist -16 Givens method
- 16:30, 2 February 2016 diff hist -3 Horners method
- 16:28, 2 February 2016 diff hist -1 Algorithm classification
- 17:25, 1 February 2016 diff hist -1 Givens method
- 17:24, 1 February 2016 diff hist -5 Givens method →Information graph
- 17:20, 1 February 2016 diff hist +3 Givens method →Information graph
- 16:15, 1 February 2016 diff hist +1,396 Givens method
- 16:17, 6 August 2015 diff hist -2 About project
- 18:26, 4 August 2015 diff hist +2,784 N Assignment problem Created page with "== Formulation of the problem == Suppose that there are <math>n</math> agents and <math>m</math> tasks, which can be distributed between these agents. Only one task can be as..."
- 18:25, 4 August 2015 diff hist +3,589 N Finding maximal flow in a transportation network Created page with "== Formulation of the problem == A ''transportation network'' is a directed graph <math>G = (V, E)</math> in which a nonnegative capacity <math>c(e) \ge 0</math> is assigned..."