User contributions
Jump to navigation
Jump to search
- 18:42, 10 March 2018 diff hist -446 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Использование разложений
- 18:20, 10 March 2018 diff hist -618 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Разложения для трёхдиагональных матриц специального вида
- 17:51, 10 March 2018 diff hist -61 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →LDL^* decomposition
- 17:39, 10 March 2018 diff hist -84 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →LDL^* decomposition
- 17:36, 10 March 2018 diff hist -100 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →LDL^*-разложение
- 17:29, 10 March 2018 diff hist -136 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →LL^* decomposition
- 17:25, 10 March 2018 diff hist -223 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →LL^*-разложение
- 16:30, 10 March 2018 diff hist +2 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Compact scheme of triangular decomposition for tri-diagonal Hermitian matrices and its modifications
- 16:29, 10 March 2018 diff hist -209 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Компактная схема треугольного разложения для трёхдиагональной эрмитовой матрицы и её модификации
- 16:16, 10 March 2018 diff hist -515 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →LDU-разложение
- 15:48, 10 March 2018 diff hist -379 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Serial-parallel algorithm for the LU decomposition of tri-diagonal matrices
- 15:24, 10 March 2018 diff hist -148 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Последовательно-параллельный алгоритм для LU-разложения трёхдиагональной матрицы
- 11:50, 10 March 2018 diff hist +4 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →LU-разложение
- 11:49, 10 March 2018 diff hist -589 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Алгоритм Стоуна для LU-разложения трёхдиагональной матрицы
- 11:19, 10 March 2018 diff hist -82 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Existing implementations of the algorithm
- 11:13, 10 March 2018 diff hist -115 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Conclusions for different classes of computer architecture
- 10:59, 10 March 2018 diff hist -248 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Dynamic characteristics and efficiency of the algorithm implementation
- 10:50, 10 March 2018 diff hist 0 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Locality of data and computations
- 10:48, 10 March 2018 diff hist -442 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Locality of data and computations
- 21:16, 9 March 2018 diff hist -66 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Scalability of the algorithm and its implementations
- 20:58, 9 March 2018 diff hist -45 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Possible methods and considerations for parallel implementation of the algorithm
- 16:55, 9 March 2018 diff hist 0 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Implementation peculiarities of the serial algorithm
- 16:52, 9 March 2018 diff hist -192 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Implementation peculiarities of the serial algorithm
- 15:06, 9 March 2018 diff hist -335 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Properties of the algorithm
- 14:52, 9 March 2018 diff hist -365 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Input and output data of the algorithm
- 14:35, 9 March 2018 diff hist -243 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Parallelization resource of the algorithm
- 14:19, 9 March 2018 diff hist -184 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Information graph
- 14:09, 9 March 2018 diff hist -66 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Information graph
- 14:01, 9 March 2018 diff hist -186 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Serial complexity of the algorithm
- 13:47, 9 March 2018 diff hist -199 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Implementation scheme of the serial algorithm
- 13:35, 9 March 2018 diff hist -50 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Macro structure of the algorithm
- 13:26, 9 March 2018 diff hist -132 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Computational kernel of the algorithm
- 12:50, 9 March 2018 diff hist -188 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Mathematical description of the algorithm
- 12:34, 9 March 2018 diff hist -180 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Mathematical description of the algorithm
- 11:32, 9 March 2018 diff hist -40 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →Mathematical description of the algorithm
- 11:28, 9 March 2018 diff hist -141 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →General description of the algorithm
- 11:11, 9 March 2018 diff hist -329 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →General description of the algorithm
- 10:54, 9 March 2018 diff hist -378 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →General description of the algorithm
- 10:34, 9 March 2018 diff hist -1 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix
- 10:33, 9 March 2018 diff hist -32 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →General description of the algorithm
- 10:27, 9 March 2018 diff hist -57 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix →General description of the algorithm
- 22:03, 8 March 2018 diff hist -355 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Compact scheme of Gaussian elimination for tri-diagonal matrices
- 21:44, 8 March 2018 diff hist +44 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Compact scheme of Gaussian elimination for tri-diagonal matrices
- 21:39, 8 March 2018 diff hist -201 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →LU-разложение
- 21:31, 8 March 2018 diff hist -19 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Compact scheme of Gaussian elimination for tri-diagonal matrices and its modifications
- 21:29, 8 March 2018 diff hist +18 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Compact scheme of Gaussian elimination for tri-diagonal matrices and its modifications
- 21:27, 8 March 2018 diff hist -166 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Compact scheme of Gaussian elimination for tri-diagonal matrices and its modifications
- 21:19, 8 March 2018 diff hist -106 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Compact scheme of Gaussian elimination for tri-diagonal matrices and its modifications
- 21:17, 8 March 2018 diff hist +38 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Compact scheme of Gaussian elimination for tri-diagonal matrices and its modifications
- 21:12, 8 March 2018 diff hist -200 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Compact scheme of Gaussian elimination for tri-diagonal matrices and its modifications
- 21:01, 8 March 2018 diff hist -96 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications →Compact scheme of Gaussian elimination for tri-diagonal matrices and its modifications
- 18:51, 8 March 2018 diff hist -94 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications
- 18:44, 8 March 2018 diff hist -316 QR decomposition methods for dense Hessenberg matrices
- 17:47, 8 March 2018 diff hist -1 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant
- 17:46, 8 March 2018 diff hist +4 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Conclusions for different classes of computer architecture
- 17:44, 8 March 2018 diff hist -178 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Conclusions for different classes of computer architecture
- 17:38, 8 March 2018 diff hist -120 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Scalability of the algorithm and its implementations
- 17:29, 8 March 2018 diff hist -151 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Possible methods and considerations for parallel implementation of the algorithm
- 17:19, 8 March 2018 diff hist -466 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Possible methods and considerations for parallel implementation of the algorithm
- 15:40, 8 March 2018 diff hist +8 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Possible methods and considerations for parallel implementation of the algorithm
- 15:33, 8 March 2018 diff hist -429 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Locality of data and computations
- 15:14, 8 March 2018 diff hist -37 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Implementation peculiarities of the serial algorithm
- 15:11, 8 March 2018 diff hist -269 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Implementation peculiarities of the serial algorithm
- 14:52, 8 March 2018 diff hist -215 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Properties of the algorithm
- 14:43, 8 March 2018 diff hist -502 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Properties of the algorithm
- 14:38, 8 March 2018 diff hist +314 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Properties of the algorithm
- 14:27, 8 March 2018 diff hist -358 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Input and output data of the algorithm
- 13:59, 8 March 2018 diff hist +12 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Parallelization resource of the algorithm
- 12:03, 8 March 2018 diff hist -59 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Parallelization resource of the algorithm
- 11:54, 8 March 2018 diff hist -375 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Parallelization resource of the algorithm
- 20:12, 6 March 2018 diff hist -116 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Information graph
- 20:04, 6 March 2018 diff hist -111 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Information graph
- 19:56, 6 March 2018 diff hist +2 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Serial complexity of the algorithm
- 19:55, 6 March 2018 diff hist -289 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Serial complexity of the algorithm
- 19:36, 6 March 2018 diff hist -68 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Implementation scheme of the serial algorithm
- 19:30, 6 March 2018 diff hist -27 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Implementation scheme of the serial algorithm
- 19:16, 6 March 2018 diff hist -102 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant
- 19:02, 6 March 2018 diff hist -69 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Computational kernel of the algorithm
- 18:56, 6 March 2018 diff hist -8 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Mathematical description of the algorithm
- 18:51, 6 March 2018 diff hist -7 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →General description of the algorithm
- 18:45, 6 March 2018 diff hist -408 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →Properties and structure of the algorithm
- 18:26, 6 March 2018 diff hist -44 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →General description of the algorithm
- 18:24, 6 March 2018 diff hist -33 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant →General description of the algorithm
- 07:35, 6 March 2018 diff hist -85 Unitary-triangular factorizations
- 19:55, 5 March 2018 diff hist 0 Template:Reflection matrix current
- 19:34, 5 March 2018 diff hist +2 Template:Reflection matrix
- 19:32, 5 March 2018 diff hist -97 Template:Reflection matrix
- 19:17, 5 March 2018 diff hist -450 Triangular decomposition of a Gram matrix
- 18:53, 5 March 2018 diff hist -2 QR decomposition of dense nonsingular matrices
- 18:45, 5 March 2018 diff hist -502 Orthogonalization method
- 18:27, 5 March 2018 diff hist -28 Orthogonalization method
- 18:23, 5 March 2018 diff hist -224 Orthogonalization method
- 18:09, 5 March 2018 diff hist -164 Orthogonalization method
- 17:56, 5 March 2018 diff hist -935 Orthogonalization method
- 17:22, 5 March 2018 diff hist +88 Orthogonalization method
- 17:12, 5 March 2018 diff hist -10 Orthogonalization method
- 15:28, 5 March 2018 diff hist -10 QR decomposition of dense nonsingular matrices
- 15:25, 5 March 2018 diff hist -315 QR decomposition of dense nonsingular matrices
- 15:02, 5 March 2018 diff hist -227 QR decomposition of dense nonsingular matrices
- 14:42, 5 March 2018 diff hist -294 QR decomposition of dense nonsingular matrices
- 13:51, 5 March 2018 diff hist -260 QR decomposition of dense nonsingular matrices
- 13:30, 5 March 2018 diff hist -138 QR decomposition of dense nonsingular matrices
- 13:15, 5 March 2018 diff hist -237 QR decomposition of dense nonsingular matrices
- 12:55, 5 March 2018 diff hist -286 QR decomposition of dense nonsingular matrices
- 12:45, 5 March 2018 diff hist -99 QR decomposition of dense nonsingular matrices
- 11:51, 5 March 2018 diff hist -1 QR decomposition of dense nonsingular matrices
- 11:50, 5 March 2018 diff hist -97 QR decomposition of dense nonsingular matrices
- 11:40, 5 March 2018 diff hist +6 LU decomposition using Gaussian elimination with pivoting current
- 11:39, 5 March 2018 diff hist +2 LU decomposition using Gaussian elimination with pivoting
- 11:38, 5 March 2018 diff hist -39 LU decomposition using Gaussian elimination with pivoting
- 11:23, 5 March 2018 diff hist -5 LU decomposition using Gaussian elimination without pivoting current
- 11:23, 5 March 2018 diff hist -171 LU decomposition using Gaussian elimination with pivoting
- 11:20, 5 March 2018 diff hist -21 LU decomposition using Gaussian elimination with pivoting
- 11:10, 5 March 2018 diff hist -203 LU decomposition using Gaussian elimination without pivoting
- 10:52, 29 November 2017 diff hist -2 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 10:49, 29 November 2017 diff hist +2 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Computational kernel of the algorithm
- 10:44, 29 November 2017 diff hist -60 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Computational kernel of the algorithm
- 10:05, 29 November 2017 diff hist -79 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Computational kernel of the algorithm
- 00:24, 29 November 2017 diff hist -40 Boruvka's algorithm →Existing implementations of the algorithm
- 00:19, 29 November 2017 diff hist -998 Boruvka's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 23:44, 28 November 2017 diff hist +1 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 23:33, 28 November 2017 diff hist -437 Boruvka's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 23:09, 28 November 2017 diff hist +6 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 23:08, 28 November 2017 diff hist 0 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 23:02, 28 November 2017 diff hist +1 Boruvka's algorithm →Scalability of the algorithm implementation
- 22:59, 28 November 2017 diff hist -968 Boruvka's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 20:07, 28 November 2017 diff hist -658 Boruvka's algorithm →Scalability of the algorithm implementation
- 19:32, 28 November 2017 diff hist -166 Boruvka's algorithm →Scalability of the algorithm implementation
- 19:22, 28 November 2017 diff hist -231 Boruvka's algorithm →Scalability of the algorithm
- 17:43, 28 November 2017 diff hist -216 Boruvka's algorithm →Possible methods and considerations for parallel implementation of the algorithm
- 17:19, 28 November 2017 diff hist -33 Boruvka's algorithm →Possible methods and considerations for parallel implementation of the algorithm
- 17:15, 28 November 2017 diff hist -3 Boruvka's algorithm →Scalability of of the algorithm implementation
- 17:14, 28 November 2017 diff hist +4 Boruvka's algorithm →Possible methods and considerations for parallel implementation of the algorithm
- 17:12, 28 November 2017 diff hist -280 Boruvka's algorithm →Possible methods and considerations for parallel implementation of the algorithm
- 16:45, 28 November 2017 diff hist 0 Boruvka's algorithm →Quantitative estimation of locality
- 16:45, 28 November 2017 diff hist -37 Boruvka's algorithm →Quantitative estimation of locality
- 16:33, 28 November 2017 diff hist -900 Boruvka's algorithm →Quantitative estimation of locality
- 16:15, 28 November 2017 diff hist +2 Bellman-Ford algorithm →Quantitative estimation of locality
- 16:10, 28 November 2017 diff hist +2 Boruvka's algorithm →Structure of memory access and a qualitative estimation of locality
- 16:08, 28 November 2017 diff hist +5 Boruvka's algorithm →Structure of memory access and a qualitative estimation of locality
- 16:05, 28 November 2017 diff hist -658 Boruvka's algorithm →Structure of memory access and a qualitative estimation of locality
- 13:42, 28 November 2017 diff hist -629 Boruvka's algorithm →Structure of memory access and a qualitative estimation of locality
- 12:58, 28 November 2017 diff hist -787 Boruvka's algorithm →Structure of memory access and a qualitative estimation of locality
- 12:21, 28 November 2017 diff hist -313 Boruvka's algorithm →Structure of memory access and a qualitative estimation of locality
- 12:08, 28 November 2017 diff hist -32 Boruvka's algorithm →Structure of memory access and a qualitative estimation of locality
- 12:01, 28 November 2017 diff hist +2 Boruvka's algorithm →Locality of data and computations
- 12:01, 28 November 2017 diff hist +1 Boruvka's algorithm →Locality of data and computations
- 11:59, 28 November 2017 diff hist -1 Boruvka's algorithm →Locality of data and computations
- 11:56, 28 November 2017 diff hist -624 Boruvka's algorithm →Locality of data and computations
- 00:44, 28 November 2017 diff hist -236 Boruvka's algorithm →Properties of the algorithm
- 00:23, 28 November 2017 diff hist -205 Boruvka's algorithm →Input and output data of the algorithm
- 00:03, 28 November 2017 diff hist -3 Boruvka's algorithm →Parallelization resource of the algorithm
- 23:56, 27 November 2017 diff hist -366 Boruvka's algorithm →Parallelization resource of the algorithm
- 20:06, 27 November 2017 diff hist -144 Boruvka's algorithm →Parallelization resource of the algorithm
- 18:53, 27 November 2017 diff hist +2 Boruvka's algorithm →Information graph
- 18:51, 27 November 2017 diff hist -683 Boruvka's algorithm →Information graph
- 18:19, 27 November 2017 diff hist -253 Boruvka's algorithm →Information graph
- 17:22, 27 November 2017 diff hist +1 Boruvka's algorithm →Information graph
- 17:15, 27 November 2017 diff hist -661 Boruvka's algorithm →Information graph
- 16:31, 27 November 2017 diff hist -85 Boruvka's algorithm →Serial complexity of the algorithm
- 16:24, 27 November 2017 diff hist -1 Boruvka's algorithm →Implementation scheme of the serial algorithm
- 16:23, 27 November 2017 diff hist -968 Boruvka's algorithm →Implementation scheme of the serial algorithm
- 13:03, 27 November 2017 diff hist -257 Boruvka's algorithm →Implementation scheme of the serial algorithm
- 12:47, 27 November 2017 diff hist -723 Boruvka's algorithm →Последовательная версия
- 12:12, 27 November 2017 diff hist -207 Boruvka's algorithm →Auxiliary algorithm: system of disjoint sets (Union-Find)
- 11:38, 27 November 2017 diff hist -187 Boruvka's algorithm →Auxiliary algorithm: system of disjoint sets (Union-Find)
- 11:26, 27 November 2017 diff hist -271 Boruvka's algorithm →Вспомогательный алгоритм: система непересекающихся множеств (Union-Find)
- 11:12, 27 November 2017 diff hist -383 Boruvka's algorithm →Macro structure of the algorithm
- 03:48, 27 November 2017 diff hist -279 Boruvka's algorithm →Macro structure of the algorithm
- 03:36, 27 November 2017 diff hist -90 Boruvka's algorithm →Computational kernel of the algorithm
- 03:30, 27 November 2017 diff hist -256 Boruvka's algorithm →Mathematical description of the algorithm
- 03:19, 27 November 2017 diff hist -579 Boruvka's algorithm →Mathematical description of the algorithm
- 02:50, 27 November 2017 diff hist -47 Boruvka's algorithm →General description of the algorithm
- 02:49, 27 November 2017 diff hist -166 Boruvka's algorithm →General description of the algorithm
- 22:11, 26 November 2017 diff hist -17 Bellman-Ford algorithm →Existing implementations of the algorithm
- 22:09, 26 November 2017 diff hist -632 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 20:17, 26 November 2017 diff hist -51 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 20:11, 26 November 2017 diff hist -284 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 18:01, 26 November 2017 diff hist -256 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 17:49, 26 November 2017 diff hist -163 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 17:42, 26 November 2017 diff hist -54 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 17:36, 26 November 2017 diff hist -325 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 17:13, 26 November 2017 diff hist -60 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 17:01, 26 November 2017 diff hist -230 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 16:52, 26 November 2017 diff hist -760 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 16:47, 26 November 2017 diff hist +373 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 16:36, 26 November 2017 diff hist -25 Bellman-Ford algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 16:32, 26 November 2017 diff hist +1 Bellman-Ford algorithm →Scalability of of the algorithm implementation
- 16:27, 26 November 2017 diff hist -493 Bellman-Ford algorithm →Scalability of of the algorithm implementation
- 15:00, 26 November 2017 diff hist -30 Bellman-Ford algorithm →Scalability of of the algorithm implementation
- 14:58, 26 November 2017 diff hist -67 Bellman-Ford algorithm →Scalability of of the algorithm implementation
- 14:52, 26 November 2017 diff hist -174 Bellman-Ford algorithm →Scalability of of the algorithm implementation
- 14:21, 26 November 2017 diff hist -385 Bellman-Ford algorithm →Scalability of the algorithm
- 13:55, 26 November 2017 diff hist -173 Bellman-Ford algorithm →Possible methods and considerations for parallel implementation of the algorithm
- 13:39, 26 November 2017 diff hist -950 Bellman-Ford algorithm →Quantitative estimation of locality
- 13:02, 26 November 2017 diff hist -152 Bellman-Ford algorithm →Structure of memory access and a qualitative estimation of locality
- 12:52, 26 November 2017 diff hist -150 Bellman-Ford algorithm →Structure of memory access and a qualitative estimation of locality
- 12:48, 26 November 2017 diff hist -91 Bellman-Ford algorithm →Structure of memory access and a qualitative estimation of locality
- 12:43, 26 November 2017 diff hist -171 Bellman-Ford algorithm →Structure of memory access and a qualitative estimation of locality
- 12:38, 26 November 2017 diff hist -55 Bellman-Ford algorithm →Structure of memory access and a qualitative estimation of locality
- 00:16, 26 November 2017 diff hist -915 Bellman-Ford algorithm →Structure of memory access and a qualitative estimation of locality
- 23:15, 25 November 2017 diff hist -63 Bellman-Ford algorithm →Structure of memory access and a qualitative estimation of locality
- 20:53, 25 November 2017 diff hist -560 Bellman-Ford algorithm →Structure of memory access and a qualitative estimation of locality
- 20:18, 25 November 2017 diff hist -1 Bellman-Ford algorithm →Properties of the algorithm
- 20:16, 25 November 2017 diff hist -155 Bellman-Ford algorithm →Properties of the algorithm
- 19:53, 25 November 2017 diff hist -199 Bellman-Ford algorithm →Input and output data of the algorithm
- 19:49, 25 November 2017 diff hist -126 Bellman-Ford algorithm →Input and output data of the algorithm
- 19:46, 25 November 2017 diff hist +1 Bellman-Ford algorithm →Parallelization resource of the algorithm
- 19:44, 25 November 2017 diff hist -258 Bellman-Ford algorithm →Parallelization resource of the algorithm
- 19:25, 25 November 2017 diff hist -371 Bellman-Ford algorithm →Parallelization resource of the algorithm
- 17:50, 25 November 2017 diff hist +3 Bellman-Ford algorithm →Information graph
- 17:46, 25 November 2017 diff hist -552 Bellman-Ford algorithm →Information graph
- 17:14, 25 November 2017 diff hist -113 Bellman-Ford algorithm →Information graph
- 16:50, 25 November 2017 diff hist -473 Bellman-Ford algorithm →Serial complexity of the algorithm
- 21:24, 24 November 2017 diff hist -97 Bellman-Ford algorithm →Implementation scheme of the serial algorithm
- 21:17, 24 November 2017 diff hist -61 Bellman-Ford algorithm →Implementation scheme of the serial algorithm
- 19:28, 24 November 2017 diff hist -679 Bellman-Ford algorithm →Macro structure of the algorithm
- 17:58, 24 November 2017 diff hist -73 Bellman-Ford algorithm →Computational kernel of the algorithm
- 17:49, 24 November 2017 diff hist -156 Bellman-Ford algorithm →Mathematical description of the algorithm
- 17:22, 24 November 2017 diff hist -359 Bellman-Ford algorithm →General description of the algorithm
- 17:04, 24 November 2017 diff hist -70 Bellman-Ford algorithm →Properties and structure of the algorithm
- 11:57, 24 November 2017 diff hist -12 Dijkstra's algorithm →Existing implementations of the algorithm
- 11:55, 24 November 2017 diff hist -135 Dijkstra's algorithm →Existing implementations of the algorithm
- 11:50, 24 November 2017 diff hist +1 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 11:47, 24 November 2017 diff hist -113 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 11:43, 24 November 2017 diff hist -81 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 11:41, 24 November 2017 diff hist -134 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 11:38, 24 November 2017 diff hist -134 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 10:48, 24 November 2017 diff hist -381 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 23:18, 23 November 2017 diff hist -2 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 23:16, 23 November 2017 diff hist -667 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 22:34, 23 November 2017 diff hist -340 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 22:20, 23 November 2017 diff hist -46 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 22:12, 23 November 2017 diff hist -315 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 20:21, 23 November 2017 diff hist -454 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 19:52, 23 November 2017 diff hist 0 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 19:50, 23 November 2017 diff hist -75 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 19:38, 23 November 2017 diff hist -358 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 18:43, 23 November 2017 diff hist -308 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 18:14, 23 November 2017 diff hist -186 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 17:57, 23 November 2017 diff hist +1 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 17:53, 23 November 2017 diff hist -317 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 16:44, 23 November 2017 diff hist -256 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 16:37, 23 November 2017 diff hist -48 Dijkstra's algorithm →Dynamic characteristics and efficiency of the algorithm implementation
- 16:06, 23 November 2017 diff hist -3 Dijkstra's algorithm →Scalability of of the algorithm implementation
- 16:03, 23 November 2017 diff hist -32 Dijkstra's algorithm →Scalability of of the algorithm implementation
- 15:54, 23 November 2017 diff hist -812 Dijkstra's algorithm →Scalability of of the algorithm implementation
- 15:04, 23 November 2017 diff hist -101 Dijkstra's algorithm →Scalability of of the algorithm implementation
- 14:59, 23 November 2017 diff hist -50 Dijkstra's algorithm →Scalability of of the algorithm implementation
- 14:01, 23 November 2017 diff hist -531 Dijkstra's algorithm →Quantitative estimation of locality
- 13:32, 23 November 2017 diff hist -946 Dijkstra's algorithm →Quantitative estimation of locality
- 13:18, 23 November 2017 diff hist -111 Dijkstra's algorithm →Quantitative estimation of locality
- 13:06, 23 November 2017 diff hist -6 Dijkstra's algorithm →Structure of memory access and a qualitative estimation of locality
- 13:05, 23 November 2017 diff hist +5 Dijkstra's algorithm →Structure of memory access and a qualitative estimation of locality
- 13:02, 23 November 2017 diff hist -167 Dijkstra's algorithm →Structure of memory access and a qualitative estimation of locality
- 12:54, 23 November 2017 diff hist -569 Dijkstra's algorithm →Structure of memory access and a qualitative estimation of locality
- 22:37, 22 November 2017 diff hist -157 Dijkstra's algorithm →Structure of memory access and a qualitative estimation of locality
- 22:31, 22 November 2017 diff hist -132 Dijkstra's algorithm →Structure of memory access and a qualitative estimation of locality
- 22:27, 22 November 2017 diff hist -481 Dijkstra's algorithm →Structure of memory access and a qualitative estimation of locality
- 21:28, 22 November 2017 diff hist -504 Dijkstra's algorithm →Structure of memory access and a qualitative estimation of locality
- 19:16, 22 November 2017 diff hist -1,062 Dijkstra's algorithm →Structure of memory access and a qualitative estimation of locality
- 18:06, 22 November 2017 diff hist -325 Dijkstra's algorithm →Input and output data of the algorithm
- 16:50, 22 November 2017 diff hist -126 Dijkstra's algorithm →Parallelization resource of the algorithm
- 16:39, 22 November 2017 diff hist -162 Dijkstra's algorithm →Information graph
- 16:10, 22 November 2017 diff hist +8 Dijkstra's algorithm →Serial complexity of the algorithm
- 16:08, 22 November 2017 diff hist -428 Dijkstra's algorithm →Serial complexity of the algorithm
- 15:37, 22 November 2017 diff hist -375 Dijkstra's algorithm →Implementation scheme of the serial algorithm
- 15:08, 22 November 2017 diff hist -4 Dijkstra's algorithm →Computational kernel of the algorithm
- 15:05, 22 November 2017 diff hist -116 Dijkstra's algorithm →Macro structure of the algorithm
- 13:47, 22 November 2017 diff hist -10 Dijkstra's algorithm →Macro structure of the algorithm
- 13:45, 22 November 2017 diff hist -86 Dijkstra's algorithm →Computational kernel of the algorithm
- 13:28, 22 November 2017 diff hist -471 Dijkstra's algorithm →Mathematical description of the algorithm
- 12:46, 22 November 2017 diff hist -519 Dijkstra's algorithm →General description of the algorithm
- 12:36, 22 November 2017 diff hist +100 Dijkstra's algorithm →General description of the algorithm
- 12:23, 22 November 2017 diff hist -6 DCSC algorithm for finding the strongly connected components →Existing implementations of the algorithm
- 12:21, 22 November 2017 diff hist -67 DCSC algorithm for finding the strongly connected components →Existing implementations of the algorithm
- 12:15, 22 November 2017 diff hist +13 DCSC algorithm for finding the strongly connected components →Scalability of the algorithm
- 12:12, 22 November 2017 diff hist +2 DCSC algorithm for finding the strongly connected components →Software implementation of the algorithm
- 23:10, 21 November 2017 diff hist -687 DCSC algorithm for finding the strongly connected components →Scalability of of the algorithm implementation
- 22:25, 21 November 2017 diff hist -405 DCSC algorithm for finding the strongly connected components →Scalability of the algorithm
- 22:14, 21 November 2017 diff hist -81 DCSC algorithm for finding the strongly connected components →Properties of the algorithm
- 20:16, 21 November 2017 diff hist -238 DCSC algorithm for finding the strongly connected components →Input and output data of the algorithm
- 19:55, 21 November 2017 diff hist -675 DCSC algorithm for finding the strongly connected components →Parallelization resource of the algorithm
- 18:07, 21 November 2017 diff hist -681 DCSC algorithm for finding the strongly connected components →Parallelization resource of the algorithm
- 17:07, 21 November 2017 diff hist -163 DCSC algorithm for finding the strongly connected components →Parallelization resource of the algorithm
- 15:57, 21 November 2017 diff hist +9 DCSC algorithm for finding the strongly connected components →Parallelization resource of the algorithm
- 15:56, 21 November 2017 diff hist -748 DCSC algorithm for finding the strongly connected components →Parallelization resource of the algorithm
- 14:52, 21 November 2017 diff hist -631 DCSC algorithm for finding the strongly connected components →Parallelization resource of the algorithm
- 14:04, 21 November 2017 diff hist -70 DCSC algorithm for finding the strongly connected components →Parallelization resource of the algorithm
- 13:18, 21 November 2017 diff hist -13 DCSC algorithm for finding the strongly connected components →Parallelization resource of the algorithm
- 13:13, 21 November 2017 diff hist -108 DCSC algorithm for finding the strongly connected components →Parallelization resource of the algorithm
- 12:51, 21 November 2017 diff hist -6 DCSC algorithm for finding the strongly connected components →Information graph
- 12:49, 21 November 2017 diff hist -561 DCSC algorithm for finding the strongly connected components →Information graph
- 11:46, 21 November 2017 diff hist -359 DCSC algorithm for finding the strongly connected components →Information graph
- 11:26, 21 November 2017 diff hist -22 DCSC algorithm for finding the strongly connected components →Information graph
- 11:18, 21 November 2017 diff hist -89 DCSC algorithm for finding the strongly connected components →Information graph
- 11:13, 21 November 2017 diff hist -103 DCSC algorithm for finding the strongly connected components →Information graph
- 23:18, 20 November 2017 diff hist -95 DCSC algorithm for finding the strongly connected components →Serial complexity of the algorithm
- 21:09, 20 November 2017 diff hist -225 DCSC algorithm for finding the strongly connected components →Implementation scheme of the serial algorithm
- 20:55, 20 November 2017 diff hist -2 DCSC algorithm for finding the strongly connected components →Macro structure of the algorithm
- 20:49, 20 November 2017 diff hist +7 DCSC algorithm for finding the strongly connected components →Macro structure of the algorithm
- 20:46, 20 November 2017 diff hist +3 DCSC algorithm for finding the strongly connected components →Macro structure of the algorithm
- 20:44, 20 November 2017 diff hist -1,156 DCSC algorithm for finding the strongly connected components →Macro structure of the algorithm
- 13:00, 20 November 2017 diff hist -537 DCSC algorithm for finding the strongly connected components →Computational kernel of the algorithm
- 12:14, 20 November 2017 diff hist -358 DCSC algorithm for finding the strongly connected components →Mathematical description of the algorithm
- 11:58, 20 November 2017 diff hist +3 DCSC algorithm for finding the strongly connected components →General description of the algorithm
- 11:55, 20 November 2017 diff hist -414 DCSC algorithm for finding the strongly connected components →General description of the algorithm
- 11:21, 20 November 2017 diff hist -671 DCSC algorithm for finding the strongly connected components →General description of the algorithm
- 03:36, 20 November 2017 diff hist -197 DCSC algorithm for finding the strongly connected components →General description of the algorithm
- 03:29, 20 November 2017 diff hist -311 DCSC algorithm for finding the strongly connected components →General description of the algorithm
- 00:07, 20 November 2017 diff hist -129 Purdom's algorithm →Computational kernel of the algorithm
- 22:07, 19 November 2017 diff hist -1 Purdom's algorithm →Scalability of the algorithm implementation
- 22:03, 19 November 2017 diff hist -217 Purdom's algorithm →Scalability of the algorithm implementation
- 21:53, 19 November 2017 diff hist -237 Purdom's algorithm →Scalability of the algorithm implementation
- 21:28, 19 November 2017 diff hist -151 Purdom's algorithm →Scalability of of the algorithm implementation
- 21:17, 19 November 2017 diff hist -116 Purdom's algorithm →Scalability of of the algorithm implementation
- 21:11, 19 November 2017 diff hist +12 Purdom's algorithm →Scalability of of the algorithm implementation
- 21:09, 19 November 2017 diff hist -287 Purdom's algorithm →Scalability of of the algorithm implementation
- 20:48, 19 November 2017 diff hist -116 Purdom's algorithm →Scalability of of the algorithm implementation
- 20:39, 19 November 2017 diff hist -280 Purdom's algorithm →Possible methods and considerations for parallel implementation of the algorithm
- 16:39, 19 November 2017 diff hist -228 Purdom's algorithm →Input and output data of the algorithm
- 16:28, 19 November 2017 diff hist -131 Purdom's algorithm →Input and output data of the algorithm
- 16:17, 19 November 2017 diff hist -4 Purdom's algorithm →Computational kernel of the algorithm
- 16:16, 19 November 2017 diff hist -117 Purdom's algorithm →Input and output data of the algorithm
- 15:55, 19 November 2017 diff hist 0 Purdom's algorithm →Parallelization resource of the algorithm
- 15:54, 19 November 2017 diff hist -8 Purdom's algorithm →Parallelization resource of the algorithm
- 15:53, 19 November 2017 diff hist -125 Purdom's algorithm →Parallelization resource of the algorithm
- 15:40, 19 November 2017 diff hist -471 Purdom's algorithm →Parallelization resource of the algorithm
- 15:23, 19 November 2017 diff hist -311 Purdom's algorithm →Parallelization resource of the algorithm
- 15:03, 19 November 2017 diff hist -176 Purdom's algorithm →Parallelization resource of the algorithm
- 14:48, 19 November 2017 diff hist -89 Purdom's algorithm →Information graph
- 14:42, 19 November 2017 diff hist -852 Purdom's algorithm →Information graph
- 13:42, 19 November 2017 diff hist -82 Purdom's algorithm →Information graph
- 12:55, 19 November 2017 diff hist -420 Purdom's algorithm →Serial complexity of the algorithm
- 12:34, 19 November 2017 diff hist -307 Purdom's algorithm →Serial complexity of the algorithm
- 15:59, 18 November 2017 diff hist -37 Purdom's algorithm →Implementation scheme of the serial algorithm
- 15:54, 18 November 2017 diff hist -109 Purdom's algorithm →Implementation scheme of the serial algorithm
- 12:29, 18 November 2017 diff hist -346 Purdom's algorithm →Implementation scheme of the serial algorithm
- 12:11, 18 November 2017 diff hist -476 Purdom's algorithm →Implementation scheme of the serial algorithm
- 11:39, 18 November 2017 diff hist -478 Purdom's algorithm →Macro structure of the algorithm
- 11:13, 18 November 2017 diff hist -1,019 Purdom's algorithm →Computational kernel of the algorithm
- 10:29, 18 November 2017 diff hist -141 Purdom's algorithm →Computational kernel of the algorithm
- 10:25, 18 November 2017 diff hist -152 Purdom's algorithm →Computational kernel of the algorithm
- 03:15, 18 November 2017 diff hist -14 Purdom's algorithm →General description of the algorithm
- 02:48, 18 November 2017 diff hist -504 Purdom's algorithm →Mathematical description of the algorithm
- 20:49, 17 November 2017 diff hist -204 Purdom's algorithm →General description of the algorithm
- 16:11, 16 November 2017 diff hist -242 Breadth-first search (BFS) →Input and output data of the algorithm
- 15:48, 16 November 2017 diff hist -1 Breadth-first search (BFS) →Parallelization resource of the algorithm
- 15:47, 16 November 2017 diff hist -4 Breadth-first search (BFS) →Parallelization resource of the algorithm
- 15:45, 16 November 2017 diff hist -546 Breadth-first search (BFS) →Parallelization resource of the algorithm
- 14:07, 16 November 2017 diff hist -282 Breadth-first search (BFS) →Parallelization resource of the algorithm
- 13:40, 16 November 2017 diff hist -197 Breadth-first search (BFS) →Information graph
- 12:59, 16 November 2017 diff hist -787 Breadth-first search (BFS) →Information graph
- 12:01, 16 November 2017 diff hist -590 Breadth-first search (BFS) →Information graph
- 10:30, 16 November 2017 diff hist -134 Breadth-first search (BFS) →Information graph
- 23:03, 15 November 2017 diff hist -164 Breadth-first search (BFS) →Information graph
- 23:01, 15 November 2017 diff hist +63 Breadth-first search (BFS) →Information graph
- 22:57, 15 November 2017 diff hist -314 Breadth-first search (BFS) →Serial complexity of the algorithm
- 22:37, 15 November 2017 diff hist -262 Breadth-first search (BFS) →Implementation scheme of the serial algorithm
- 22:11, 15 November 2017 diff hist -5 Breadth-first search (BFS) →Macro structure of the algorithm
- 22:09, 15 November 2017 diff hist -38 Breadth-first search (BFS) →Macro structure of the algorithm
- 22:07, 15 November 2017 diff hist -118 Breadth-first search (BFS) →Macro structure of the algorithm
- 21:50, 15 November 2017 diff hist -108 Breadth-first search (BFS) →Macro structure of the algorithm
- 19:58, 15 November 2017 diff hist -67 Breadth-first search (BFS) →Macro structure of the algorithm
- 19:52, 15 November 2017 diff hist -226 Breadth-first search (BFS) →Computational kernel of the algorithm
- 19:44, 15 November 2017 diff hist -2 Breadth-first search (BFS) →General description of the algorithm
- 19:42, 15 November 2017 diff hist +59 Breadth-first search (BFS) →Computational kernel of the algorithm
- 19:24, 15 November 2017 diff hist -3 Breadth-first search (BFS) →Mathematical description of the algorithm
- 19:22, 15 November 2017 diff hist -257 Breadth-first search (BFS) →Mathematical description of the algorithm
- 17:20, 15 November 2017 diff hist -227 Breadth-first search (BFS) →Mathematical description of the algorithm
- 16:40, 15 November 2017 diff hist -373 Breadth-first search (BFS) →General description of the algorithm
- 16:10, 15 November 2017 diff hist -83 Breadth-first search (BFS) →General description of the algorithm
- 15:43, 15 November 2017 diff hist -356 Breadth-first search (BFS) →General description of the algorithm
- 11:58, 8 November 2017 diff hist -159 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Existing implementations of the algorithm
- 11:42, 8 November 2017 diff hist -628 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Conclusions for different classes of computer architecture
- 10:38, 8 November 2017 diff hist -363 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 10:09, 8 November 2017 diff hist -511 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 09:40, 8 November 2017 diff hist -354 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 03:32, 8 November 2017 diff hist 0 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 03:29, 8 November 2017 diff hist +1 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 03:26, 8 November 2017 diff hist -1 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Quantitative estimation of locality
- 03:13, 8 November 2017 diff hist -192 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 03:02, 8 November 2017 diff hist -383 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 02:44, 8 November 2017 diff hist -252 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 02:27, 8 November 2017 diff hist -279 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 00:24, 8 November 2017 diff hist -138 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 00:08, 8 November 2017 diff hist -126 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 23:53, 7 November 2017 diff hist -175 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 23:06, 7 November 2017 diff hist -228 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 18:56, 7 November 2017 diff hist -416 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Dynamic characteristics and efficiency of the algorithm implementation
- 18:15, 7 November 2017 diff hist -253 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Scalability of of the algorithm implementation
- 18:07, 7 November 2017 diff hist -253 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Scalability of of the algorithm implementation
- 17:57, 7 November 2017 diff hist -766 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Scalability of of the algorithm implementation
- 17:51, 7 November 2017 diff hist +384 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Scalability of of the algorithm implementation
- 17:31, 7 November 2017 diff hist -351 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Quantitative estimation of locality
- 16:56, 7 November 2017 diff hist -540 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Quantitative estimation of locality
- 16:48, 7 November 2017 diff hist -502 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Structure of memory access and a qualitative estimation of locality
- 16:08, 7 November 2017 diff hist -1,226 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Structure of memory access and a qualitative estimation of locality
- 12:59, 7 November 2017 diff hist +180 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Structure of memory access and a qualitative estimation of locality
- 12:53, 7 November 2017 diff hist -563 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Structure of memory access and a qualitative estimation of locality
- 12:30, 7 November 2017 diff hist -72 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Structure of memory access and a qualitative estimation of locality
- 12:20, 7 November 2017 diff hist -467 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Structure of memory access and a qualitative estimation of locality
- 11:58, 7 November 2017 diff hist -125 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Structure of memory access and a qualitative estimation of locality
- 15:10, 3 November 2017 diff hist -118 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Structure of memory access and a qualitative estimation of locality
- 15:03, 3 November 2017 diff hist -122 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Locality of data and computations
- 14:40, 3 November 2017 diff hist +3 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Implementation peculiarities of the serial algorithm
- 14:36, 3 November 2017 diff hist -510 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Implementation peculiarities of the serial algorithm
- 12:38, 3 November 2017 diff hist -567 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Properties of the algorithm
- 12:37, 3 November 2017 diff hist +12 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Properties of the algorithm
- 12:33, 3 November 2017 diff hist -126 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Properties of the algorithm
- 12:23, 3 November 2017 diff hist +125 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Properties of the algorithm
- 11:58, 3 November 2017 diff hist -342 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Input and output data of the algorithm
- 11:42, 3 November 2017 diff hist -16 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Input and output data of the algorithm
- 11:40, 3 November 2017 diff hist -67 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Input and output data of the algorithm
- 11:01, 3 November 2017 diff hist +1 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Parallelization resource of the algorithm
- 10:59, 3 November 2017 diff hist +113 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Parallelization resource of the algorithm
- 10:52, 3 November 2017 diff hist -388 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Parallelization resource of the algorithm
- 10:43, 3 November 2017 diff hist -416 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Parallelization resource of the algorithm
- 10:21, 3 November 2017 diff hist -28 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Parallelization resource of the algorithm
- 10:02, 3 November 2017 diff hist -260 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Information graph
- 23:16, 2 November 2017 diff hist -294 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Serial complexity of the algorithm
- 23:08, 2 November 2017 diff hist -111 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Serial complexity of the algorithm
- 22:56, 2 November 2017 diff hist -471 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Implementation scheme of the serial algorithm
- 13:12, 2 November 2017 diff hist -520 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Macro structure of the algorithm
- 12:44, 2 November 2017 diff hist +207 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Macro structure of the algorithm
- 12:33, 2 November 2017 diff hist -240 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Computational kernel of the algorithm
- 11:57, 2 November 2017 diff hist -54 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Computational kernel of the algorithm
- 11:47, 2 November 2017 diff hist -201 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Computational kernel of the algorithm
- 11:30, 2 November 2017 diff hist -1 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Mathematical description of the algorithm
- 11:24, 2 November 2017 diff hist -415 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Mathematical description of the algorithm
- 00:10, 2 November 2017 diff hist -39 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Mathematical description of the algorithm
- 23:51, 1 November 2017 diff hist -119 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Mathematical description of the algorithm
- 23:44, 1 November 2017 diff hist -119 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Mathematical description of the algorithm
- 16:25, 1 November 2017 diff hist -139 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Mathematical description of the algorithm
- 16:01, 1 November 2017 diff hist -83 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Mathematical description of the algorithm
- 15:50, 1 November 2017 diff hist -12 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Mathematical description of the algorithm
- 15:49, 1 November 2017 diff hist -213 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →Mathematical description of the algorithm
- 15:18, 1 November 2017 diff hist -629 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form →General description of the algorithm
- 12:56, 1 November 2017 diff hist -214 Linpack benchmark →Scalability of of the algorithm implementation
- 12:48, 1 November 2017 diff hist -516 Linpack benchmark →Scalability of of the algorithm implementation
- 12:12, 1 November 2017 diff hist +2 The serial-parallel summation method →Scalability of of the algorithm implementation
- 12:10, 1 November 2017 diff hist +2 The serial-parallel summation method →Scalability of of the algorithm implementation
- 12:08, 1 November 2017 diff hist +3 Linpack benchmark →Scalability of of the algorithm implementation
- 12:05, 1 November 2017 diff hist -765 Linpack benchmark →Scalability of of the algorithm implementation
- 19:11, 31 October 2017 diff hist -187 Linpack benchmark →Scalability of of the algorithm implementation
- 19:07, 31 October 2017 diff hist +98 Linpack benchmark →Scalability of of the algorithm implementation
- 19:05, 31 October 2017 diff hist -197 Linpack benchmark →Scalability of of the algorithm implementation
- 18:56, 31 October 2017 diff hist -429 Linpack benchmark →Scalability of of the algorithm implementation
- 18:48, 31 October 2017 diff hist -30 Linpack benchmark →Scalability of of the algorithm implementation
- 18:33, 31 October 2017 diff hist -539 Linpack benchmark →Quantitative estimation of locality
- 18:16, 31 October 2017 diff hist -707 Linpack benchmark →Quantitative estimation of locality
- 18:07, 31 October 2017 diff hist -42 Linpack benchmark →Quantitative estimation of locality
- 18:04, 31 October 2017 diff hist -91 Linpack benchmark →Quantitative estimation of locality
- 17:52, 31 October 2017 diff hist -870 Linpack benchmark →Structure of memory access and a qualitative estimation of locality
- 16:20, 31 October 2017 diff hist -140 Linpack benchmark →Structure of memory access and a qualitative estimation of locality
- 16:08, 31 October 2017 diff hist -370 Linpack benchmark →Structure of memory access and a qualitative estimation of locality
- 15:54, 31 October 2017 diff hist -138 Linpack benchmark →Structure of memory access and a qualitative estimation of locality
- 15:10, 31 October 2017 diff hist -776 Linpack benchmark →Structure of memory access and a qualitative estimation of locality
- 14:04, 31 October 2017 diff hist -524 Linpack benchmark →Structure of memory access and a qualitative estimation of locality
- 13:40, 31 October 2017 diff hist -271 Linpack benchmark →Structure of memory access and a qualitative estimation of locality
- 12:01, 31 October 2017 diff hist -333 Linpack benchmark →Structure of memory access and a qualitative estimation of locality
- 11:31, 31 October 2017 diff hist -4 Linpack benchmark →Implementation peculiarities of the serial algorithm
- 11:29, 31 October 2017 diff hist -263 Linpack benchmark →Implementation peculiarities of the serial algorithm
- 11:12, 31 October 2017 diff hist -315 Linpack benchmark →Implementation peculiarities of the serial algorithm
- 10:45, 31 October 2017 diff hist -267 Linpack benchmark →Input and output data of the algorithm
- 10:09, 31 October 2017 diff hist -735 Linpack benchmark →Parallelization resource of the algorithm
- 22:56, 30 October 2017 diff hist +70 Linpack benchmark →Parallelization resource of the algorithm
- 22:41, 30 October 2017 diff hist -379 Linpack benchmark →Information graph
- 22:23, 30 October 2017 diff hist -97 Linpack benchmark →Information graph
- 20:20, 30 October 2017 diff hist -42 Linpack benchmark →Information graph
- 20:05, 30 October 2017 diff hist -256 Linpack benchmark →Information graph
- 19:43, 30 October 2017 diff hist -169 Linpack benchmark →Information graph
- 19:28, 30 October 2017 diff hist -177 Linpack benchmark →Serial complexity of the algorithm
- 19:17, 30 October 2017 diff hist -374 Linpack benchmark →Implementation scheme of the serial algorithm
- 18:12, 30 October 2017 diff hist -311 Linpack benchmark →Macro structure of the algorithm
- 16:32, 30 October 2017 diff hist -304 Linpack benchmark →Computational kernel of the algorithm
- 15:58, 30 October 2017 diff hist +1 Linpack benchmark →Mathematical description of the algorithm
- 15:57, 30 October 2017 diff hist -622 Linpack benchmark →Mathematical description of the algorithm
- 13:58, 30 October 2017 diff hist -534 Linpack benchmark →Mathematical description of the algorithm
- 12:42, 30 October 2017 diff hist -1,055 Linpack benchmark →General description of the algorithm
- 17:32, 29 October 2017 diff hist -2 Linpack benchmark →Implementation scheme of the serial algorithm
- 17:24, 29 October 2017 diff hist -24 One step of the dqds algorithm →Existing implementations of the algorithm
- 17:12, 29 October 2017 diff hist -90 One step of the dqds algorithm →Conclusions for different classes of computer architecture
- 17:06, 29 October 2017 diff hist -259 One step of the dqds algorithm →Scalability of the algorithm and its implementations
- 16:55, 29 October 2017 diff hist -433 One step of the dqds algorithm →Scalability of the algorithm and its implementations
- 16:38, 29 October 2017 diff hist -110 One step of the dqds algorithm →Scalability of the algorithm and its implementations
- 16:31, 29 October 2017 diff hist +7 One step of the dqds algorithm →Scalability of the algorithm and its implementations
- 16:29, 29 October 2017 diff hist -165 One step of the dqds algorithm →Scalability of the algorithm and its implementations
- 15:24, 29 October 2017 diff hist -268 One step of the dqds algorithm →Possible methods and considerations for parallel implementation of the algorithm
- 15:21, 29 October 2017 diff hist +100 One step of the dqds algorithm →Possible methods and considerations for parallel implementation of the algorithm
- 14:13, 29 October 2017 diff hist -866 One step of the dqds algorithm →Quantitative estimation of locality
- 13:11, 29 October 2017 diff hist -359 One step of the dqds algorithm →Quantitative estimation of locality
- 12:57, 29 October 2017 diff hist -453 One step of the dqds algorithm →Structure of memory access and a qualitative estimation of locality
- 12:15, 29 October 2017 diff hist -424 One step of the dqds algorithm →Structure of memory access and a qualitative estimation of locality
- 11:51, 29 October 2017 diff hist -4 One step of the dqds algorithm →Structure of memory access and a qualitative estimation of locality
- 11:50, 29 October 2017 diff hist -8 The serial-parallel summation method →Structure of memory access and a qualitative estimation of locality
- 11:47, 29 October 2017 diff hist -121 One step of the dqds algorithm →Locality of data and computations
- 11:40, 29 October 2017 diff hist -70 One step of the dqds algorithm →Locality of data and computations
- 11:32, 29 October 2017 diff hist -66 One step of the dqds algorithm →Implementation peculiarities of the serial algorithm
- 11:30, 29 October 2017 diff hist -27 One step of the dqds algorithm →Implementation peculiarities of the serial algorithm