New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 14:53, 14 March 2018 Gaussian elimination with row pivoting (hist) [185 bytes] ASA (talk | contribs) (Created page with "{{level-m}} {{Russian}} Category:Started articles ru:LU-разложение методом Гаусса с выбором ведущего элемента по ст...")
- 14:51, 14 March 2018 Gaussian elimination with column pivoting (hist) [187 bytes] ASA (talk | contribs) (Created page with "{{level-a}} {{Russian}} Category:Started articles ru:LU-разложение методом Гаусса с выбором ведущего элемента по ст...")
- 14:49, 14 March 2018 Serial-parallel algorithm for the LU decomposition of a tridiagonal matrix (hist) [215 bytes] ASA (talk | contribs) (Created page with "{{level-m}} {{Russian}} Category:Started articles ru:Последовательно-параллельный алгоритм для LU-разложения трёх...")
- 14:43, 14 March 2018 Gaussian elimination, compact scheme for tridiagonal matrices, serial version (hist) [9,330 bytes] ASA (talk | contribs) (Created page with "{{level-a}} {{Russian}} Category:Started articles ru:Компактная схема метода Гаусса для трёхдиагональной матрицы,...")
- 14:40, 14 March 2018 Compact scheme for Gaussian elimination and its modifications: Tridiagonal matrix (hist) [207 bytes] ASA (talk | contribs) (Created page with "{{level-m}} {{Russian}} Category:Started articles ru:Компактная схема метода Гаусса для трёхдиагональной матрицы...")
- 14:33, 14 March 2018 Gaussian elimination (finding the LU decomposition) (hist) [134 bytes] ASA (talk | contribs) (Created page with "{{level-m}} {{Russian}} Category:Started articles ru:Метод Гаусса (нахождение LU-разложения)") originally created as "Gaussian elimination (finding the LU decomposition))"
- 14:31, 14 March 2018 Triangular decompositions (hist) [107 bytes] ASA (talk | contribs) (Created page with "{{level-p}} {{Russian}} Category:Started articles ru:Треугольные разложения")
- 14:29, 14 March 2018 Matrix decomposition problem (hist) [110 bytes] ASA (talk | contribs) (Created page with "{{level-p}} {{Russian}} Category:Started articles ru:Задача разложения матриц")
- 14:26, 14 March 2018 Dense matrix multiplication (hist) [110 bytes] ASA (talk | contribs) (Created page with "{{level-p}} {{Russian}} Category:Started articles ru:Умножение плотных матриц")
- 14:22, 14 March 2018 Fast Fourier transform for powers-of-two (hist) [142 bytes] ASA (talk | contribs) (Created page with "{{level-m}} Category:Started articles ru:Быстрое преобразование Фурье для степеней двойки")
- 14:18, 14 March 2018 Uniform norm of a vector: Real version, serial-parallel variant (hist) [223 bytes] ASA (talk | contribs) (Created page with "{{level-a}} {{Russian}} Category:Started articles ru:Равномерная норма вектора, вещественная версия, последовател...")
- 14:14, 14 March 2018 Parallel prefix scan algorithm using pairwise summation (hist) [165 bytes] ASA (talk | contribs) (Created page with "{{level-a}} {{Russian}} Category:Started articles ru:Нахождение частных сумм элементов массива сдваиванием")
- 14:11, 14 March 2018 Pairwise summation (hist) [111 bytes] ASA (talk | contribs) (Created page with "{{level-m}} {{Russian}} Category:Started articles ru:Суммирование сдваиванием")
- 13:47, 2 March 2018 Householder (reflections) method for reducing of a matrix to Hessenberg form (hist) [2,422 bytes] ASA (talk | contribs) (Created page with "{{level-m}} '''Метод Хаусхолдера''' (в советской математической литературе чаще называется '''методом...") originally created as "Householder (reflections) reduction of a matrix to Hessenberg form"
- 11:22, 2 March 2018 Unitary-triangular factorizations (hist) [527 bytes] ASA (talk | contribs) (Created page with "{{level-p}} '''Унитарно-треугольные разложения''' - разложения матриц в произведение треугольной и ун...")
- 11:21, 2 March 2018 QR decomposition methods for dense Hessenberg matrices (hist) [687 bytes] ASA (talk | contribs) (Created page with "{{level-p}} Задача '''QR-разложения плотных хессенберговых матриц''' встречается в качестве этапа одно...")
- 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...")
- 11:29, 25 October 2017 Householder (reflections) method for reducing a symmetric matrix to tridiagonal form (hist) [16,217 bytes] ASA (talk | contribs) (Created page with "{{algorithm | name = Приведение симметричной вещественной матрицы к трёхдиагональному виду мето...") originally created as "The Householder (reflection) method for reducing symmetric matrices to tridiagonal form"
- 11:12, 25 October 2017 One step of the dqds algorithm (hist) [12,038 bytes] ASA (talk | contribs) (Created page with " {{algorithm | name = Алгоритм dqds нахождения<br /> сингулярных чисел двухдиагональной матрицы | serial_...") originally created as "The dqds algorithm iteration"
- 11:00, 25 October 2017 The dqds algorithm for calculating singular values of bidiagonal matrices (hist) [1,840 bytes] ASA (talk | contribs) (Created page with "=== General description of the algorithm === Алгоритм '''dqds''' (''differential quotient-difference algorithm with shifts'')<ref name="vla">Деммель Д. Выч...") originally created as "The dqds algorithm for calculating the singular values of a bidiagonal matrix"
- 10:40, 24 October 2017 Methods for solving tridiagonal SLAEs (hist) [10,435 bytes] ASA (talk | contribs) (Created page with "{{level-p}} == СЛАУ с трёхдиагональными матрицами == Во многих математических моделях одномерных явл...")
- 10:32, 24 October 2017 The serial-parallel summation method (hist) [7,465 bytes] ASA (talk | contribs) (Created page with "Primary authors of this description: A.V.Frolov, Vad.V.Voevodin (#Locality of data and computations|Section...")
- 19:46, 15 June 2016 Single-qubit transform of a state vector (hist) [11,023 bytes] Chernyavskiy (talk | contribs) (Created page with "{{algorithm | name = Однокубитное преобразование <br /> вектора-состояния | serial_complexity = <math>3 \cdot 2^n</math>...")
- 16:08, 10 May 2016 Two-sided Thomas algorithm, pointwise version (hist) [12,979 bytes] ASA (talk | contribs) (Created page with "{{algorithm | name = Two-sided Thomas algorithm,<br /> pointwise version | serial_complexity = <math>8n-2</math> | pf_height = <math>2.5n-1</math> | pf_wi...")
- 17:41, 1 March 2016 Thomas algorithm, pointwise version (hist) [11,793 bytes] ASA (talk | contribs) (Created page with "{{algorithm | name = Thomas algorithm, pointwise version | serial_complexity = <math>8n-7</math> | pf_height = <math>5n-4</math> | pf_width = <ma...")
- 23:05, 3 February 2016 Poisson equation, solving with DFT (hist) [23,205 bytes] Икрамов (talk | contribs) (Created page with " Primary authors of this description:V.M.stepanenko, E.V.Mortikov, Участн...")
- 16:27, 31 January 2016 Repeated Thomas algorithm, pointwise version (hist) [161 bytes] Икрамов (talk | contribs) (Created page with " Primary authors of this description: A.V.Frolov, Vad.V.Voevodin (Section 2.2), A.M.Teplov (Section 2.4) '''Contents''' 1 Properties and structure of the algorithm 1.1 Gen...") originally created as "Two-sided elimination method, pointwise version"
- 10:34, 28 January 2016 Elimination method, pointwise version (hist) [0 bytes] Икрамов (talk | contribs) (Created page with " Primary authors of this description: A.V.Frolov, Vad.V.Voevodin (Section 2.2), A.M.Teplov (Section 2.4) '''Contents''' 1 Properties and structure of the algorithm 1.1 G...")
- 19:00, 21 January 2016 Givens method (hist) [19,186 bytes] Икрамов (talk | contribs) (Created page with " Primary authors of this description: A.V.Frolov, Vad.V.Voevodin (Section 2.2) 1 Properties and structure of the algorithm[edit] 1.1 General description of the algorithm...")
- 18:26, 4 August 2015 Assignment problem (hist) [2,797 bytes] ASA (talk | contribs) (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 Finding maximal flow in a transportation network (hist) [3,721 bytes] ASA (talk | contribs) (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...")