User contributions
Jump to navigation
Jump to search
- 11:09, 2 March 2018 diff hist +1,421 N Householder (reflections) method for the QR decomposition of a matrix Created page with "{{level-m}} '''Метод Хаусхолдера''' (в советской математической литературе чаще называется '''методом..."
- 11:07, 2 March 2018 diff hist +1,510 N Triangular decomposition of a Gram matrix Created page with "{{level-m}} '''Метод треугольного разложения матрицы Грама''' для нахождения QR-разложения квадратной..."
- 11:05, 2 March 2018 diff hist +6,297 N Orthogonalization method Created page with "{{level-m}} Основные авторы описания: Инжелевская Дарья Валерьевна(текст), Участник:F..."
- 11:03, 2 March 2018 diff hist +2,694 N Givens (rotations) method for the QR decomposition of a (real) Hessenberg matrix Created page with "{{level-a}} '''Метод Гивенса''' (в отечественной математической литературе называется также '''методо..."
- 11:01, 2 March 2018 diff hist +1,830 N Givens (rotations) method for the QR decomposition of a matrix Created page with "{{level-m}} '''Метод Гивенса''' (в отечественной математической литературе называется также '''методо..."
- 11:00, 2 March 2018 diff hist +14,678 N Gaussian elimination, compact scheme for tridiagonal matrices, serial variant Created page with "{{algorithm | name = Компактная схема метода Гаусса<br /> для трёхдиагональной матрицы | serial_complexity =..."
- 10:58, 2 March 2018 diff hist +16,104 N Gaussian elimination, compact scheme for tridiagonal matrices and its modifications Created page with "{{level-m}} Основные авторы описания: А.В.Фролов == Компактная схема метода Гаусса дл..."
- 10:56, 2 March 2018 diff hist +17,637 N Stone doubling algorithm for the LU decomposition of a tridiagonal matrix Created page with "{{algorithm | name = Метод сдваивания Стоуна для решения двудиагональных СЛАУ | serial_complexity = <math>3(n-1)..."
- 10:48, 2 March 2018 diff hist +6,091 N QR decomposition of dense nonsingular matrices Created page with "{{level-p}} Нахождение разложения матриц в виде <math>A = QR</math>, где <math>Q</math> - унитарная, <math>R</math> — права..."
- 10:46, 2 March 2018 diff hist +1,646 N LU decomposition using Gaussian elimination with pivoting Created page with "{{level-m}} '''Метод Гаусса с перестановками''' - метод получения для некоторой перестановки <math>P_{1} A P_{..."
- 10:44, 2 March 2018 diff hist +833 N LU decomposition using Gaussian elimination without pivoting Created page with "{{level-m}} '''Метод Гаусса без перестановок''' - метод получения для невырожденной квадратной матриц..."
- 14:38, 22 February 2018 diff hist +17 Givens method
- 14:53, 5 February 2018 diff hist -22 Bellman-Ford algorithm
- 18:15, 13 November 2017 diff hist +41,464 N Boruvka's algorithm Created page with "{{algorithm | name = Алгоритм Борувки | serial_complexity = <math>O(|E|ln(|V|))</math> | pf_height = <math>max O(ln(|V|)) </math> | pf_widt..."
- 18:14, 13 November 2017 diff hist 0 Algorithm classification
- 17:58, 13 November 2017 diff hist +15,156 N Tarjan-Vishkin biconnected components algorithm Created page with "{{algorithm | name = Алгоритм Тарьяна-Вишкина поиска компонент двусвязности/мостов в графе | serial_c..."
- 17:52, 13 November 2017 diff hist 0 DCSC algorithm for finding the strongly connected components
- 17:49, 13 November 2017 diff hist +28,708 N DCSC algorithm for finding the strongly connected components Created page with "{{algorithm | name = Алгоритм DCSC поиска компонент сильной связности | serial_complexity = <math>O(|V| \ln(|V|))</math> |..."
- 17:33, 13 November 2017 diff hist +24,965 N Purdom's algorithm Created page with "{{algorithm | name = Алгоритм Пурдома | serial_complexity = <math>O(|E| + \mu^2)</math> | pf_height = <math>N/A </math> | pf_width..."
- 17:28, 13 November 2017 diff hist -18 Bellman-Ford algorithm
- 17:26, 13 November 2017 diff hist +1 Bellman-Ford algorithm
- 17:22, 13 November 2017 diff hist +29,928 N Bellman-Ford algorithm Created page with "{{algorithm | name = Алгоритм Беллмана-Форда | serial_complexity = <math>O(|V||E|)</math> | pf_height = <math>N/A, max O(|V|) </math>..."
- 17:08, 13 November 2017 diff hist +35,279 N Dijkstra's algorithm Created page with "Primary authors of this description: A.N.Daryin, Vad.V.Voevodin (#Locality of data and computations|Section..."
- 16:43, 13 November 2017 diff hist 0 Breadth-first search (BFS) →Information graph
- 16:31, 13 November 2017 diff hist +18,976 N Breadth-first search (BFS) Created page with "{{algorithm | name = Алгоритм поиска в ширину (BFS) | serial_complexity = <math>O(|V| + |E|)</math> | pf_height = <math>N/A, \max O(|..."
- 15:32, 9 November 2017 diff hist -318 Methods for solving tridiagonal SLAEs current
- 15:18, 9 November 2017 diff hist -76 Methods for solving tridiagonal SLAEs
- 15:15, 9 November 2017 diff hist -104 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form
- 15:14, 9 November 2017 diff hist -75 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form
- 14:56, 9 November 2017 diff hist -1 Algorithm classification
- 14:55, 9 November 2017 diff hist +7 Algorithm classification
- 14:53, 9 November 2017 diff hist +23 Algorithm classification
- 14:49, 9 November 2017 diff hist +4 Algorithm classification
- 13:06, 9 November 2017 diff hist +4 Linpack benchmark
- 13:04, 9 November 2017 diff hist +1 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form
- 13:02, 9 November 2017 diff hist +1 Methods for solving tridiagonal SLAEs
- 13:00, 9 November 2017 diff hist +1 The serial-parallel summation method
- 12:52, 9 November 2017 diff hist +1 One step of the dqds algorithm
- 12:52, 9 November 2017 diff hist +1 The dqds algorithm for calculating singular values of bidiagonal matrices
- 12:44, 9 November 2017 diff hist -53 The dqds algorithm for calculating singular values of bidiagonal matrices
- 16:17, 27 October 2017 diff hist +26 The serial-parallel summation method →Scalability of of the algorithm implementation
- 13:18, 25 October 2017 diff hist 0 Linpack benchmark →Quantitative estimation of locality
- 13:17, 25 October 2017 diff hist 0 Linpack benchmark →Quantitative estimation of locality
- 13:17, 25 October 2017 diff hist -3 Linpack benchmark →Quantitative estimation of locality
- 13:12, 25 October 2017 diff hist 0 Linpack benchmark →Information graph
- 13:08, 25 October 2017 diff hist +33,925 N Linpack benchmark Created page with "{{level-a}} Primary authors of this description: A.V.Frolov, Vad.V.Voevodin (#Locality of data and computat..."
- 11:29, 25 October 2017 diff hist +43,357 N Householder (reflections) method for reducing a symmetric matrix to tridiagonal form Created page with "{{algorithm | name = Приведение симметричной вещественной матрицы к трёхдиагональному виду мето..."
- 11:18, 25 October 2017 diff hist -24 The dqds algorithm for calculating singular values of bidiagonal matrices
- 11:17, 25 October 2017 diff hist -1 One step of the dqds algorithm →Information graph
- 11:12, 25 October 2017 diff hist +24,649 N One step of the dqds algorithm Created page with " {{algorithm | name = Алгоритм dqds нахождения<br /> сингулярных чисел двухдиагональной матрицы | serial_..."