New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 20 | older 20) (20 | 50 | 100 | 250 | 500)
- 11:14, 2 March 2018 Householder (reflections) method for the QR decomposition of a (real) Hessenberg matrix (hist) [197 bytes] ASA (talk | contribs) (Created page with "{{level-a}} '''Метод Хаусхолдера''' (в советской математической литературе чаще называется '''методом...")
- 11:09, 2 March 2018 Householder (reflections) method for the QR decomposition of a matrix (hist) [1,401 bytes] ASA (talk | contribs) (Created page with "{{level-m}} '''Метод Хаусхолдера''' (в советской математической литературе чаще называется '''методом...")
- 11:07, 2 March 2018 Triangular decomposition of a Gram matrix (hist) [950 bytes] ASA (talk | contribs) (Created page with "{{level-m}} '''Метод треугольного разложения матрицы Грама''' для нахождения QR-разложения квадратной...")
- 11:05, 2 March 2018 Orthogonalization method (hist) [4,430 bytes] ASA (talk | contribs) (Created page with "{{level-m}} Основные авторы описания: Инжелевская Дарья Валерьевна(текст), Участник:F...")
- 11:03, 2 March 2018 Givens (rotations) method for the QR decomposition of a (real) Hessenberg matrix (hist) [188 bytes] ASA (talk | contribs) (Created page with "{{level-a}} '''Метод Гивенса''' (в отечественной математической литературе называется также '''методо...")
- 11:01, 2 March 2018 Givens (rotations) method for the QR decomposition of a matrix (hist) [1,809 bytes] ASA (talk | contribs) (Created page with "{{level-m}} '''Метод Гивенса''' (в отечественной математической литературе называется также '''методо...")
- 11:00, 2 March 2018 Gaussian elimination, compact scheme for tridiagonal matrices, serial variant (hist) [9,486 bytes] ASA (talk | contribs) (Created page with "{{algorithm | name = Компактная схема метода Гаусса<br /> для трёхдиагональной матрицы | serial_complexity =...")
- 10:58, 2 March 2018 Gaussian elimination, compact scheme for tridiagonal matrices and its modifications (hist) [10,636 bytes] ASA (talk | contribs) (Created page with "{{level-m}} Основные авторы описания: А.В.Фролов == Компактная схема метода Гаусса дл...")
- 10:56, 2 March 2018 Stone doubling algorithm for the LU decomposition of a tridiagonal matrix (hist) [11,754 bytes] ASA (talk | contribs) (Created page with "{{algorithm | name = Метод сдваивания Стоуна для решения двудиагональных СЛАУ | serial_complexity = <math>3(n-1)...") originally created as "Stone doubling algorithm for the LU decomposition of tridiagonal matrices"
- 10:48, 2 March 2018 QR decomposition of dense nonsingular matrices (hist) [4,050 bytes] ASA (talk | contribs) (Created page with "{{level-p}} Нахождение разложения матриц в виде <math>A = QR</math>, где <math>Q</math> - унитарная, <math>R</math> — права...")
- 10:46, 2 March 2018 LU decomposition using Gaussian elimination with pivoting (hist) [1,423 bytes] ASA (talk | contribs) (Created page with "{{level-m}} '''Метод Гаусса с перестановками''' - метод получения для некоторой перестановки <math>P_{1} A P_{...")
- 10:44, 2 March 2018 LU decomposition using Gaussian elimination without pivoting (hist) [625 bytes] ASA (talk | contribs) (Created page with "{{level-m}} '''Метод Гаусса без перестановок''' - метод получения для невырожденной квадратной матриц...")
- 18:15, 13 November 2017 Boruvka's algorithm (hist) [14,885 bytes] ASA (talk | contribs) (Created page with "{{algorithm | name = Алгоритм Борувки | serial_complexity = <math>O(|E|ln(|V|))</math> | pf_height = <math>max O(ln(|V|)) </math> | pf_widt...")
- 17:58, 13 November 2017 Tarjan-Vishkin biconnected components algorithm (hist) [167 bytes] ASA (talk | contribs) (Created page with "{{algorithm | name = Алгоритм Тарьяна-Вишкина поиска компонент двусвязности/мостов в графе | serial_c...")
- 17:49, 13 November 2017 DCSC algorithm for finding the strongly connected components (hist) [16,575 bytes] ASA (talk | contribs) (Created page with "{{algorithm | name = Алгоритм DCSC поиска компонент сильной связности | serial_complexity = <math>O(|V| \ln(|V|))</math> |...")
- 17:33, 13 November 2017 Purdom's algorithm (hist) [14,464 bytes] ASA (talk | contribs) (Created page with "{{algorithm | name = Алгоритм Пурдома | serial_complexity = <math>O(|E| + \mu^2)</math> | pf_height = <math>N/A </math> | pf_width...")
- 17:22, 13 November 2017 Bellman-Ford algorithm (hist) [8,948 bytes] ASA (talk | contribs) (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 Dijkstra's algorithm (hist) [6,845 bytes] ASA (talk | contribs) (Created page with "Primary authors of this description: A.N.Daryin, Vad.V.Voevodin (#Locality of data and computations|Section...")
- 16:31, 13 November 2017 Breadth-first search (BFS) (hist) [11,853 bytes] ASA (talk | contribs) (Created page with "{{algorithm | name = Алгоритм поиска в ширину (BFS) | serial_complexity = <math>O(|V| + |E|)</math> | pf_height = <math>N/A, \max O(|...")
- 13:08, 25 October 2017 Linpack benchmark (hist) [11,057 bytes] ASA (talk | contribs) (Created page with "{{level-a}} Primary authors of this description: A.V.Frolov, Vad.V.Voevodin (#Locality of data and computat...")