New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 20 | older 20) (20 | 50 | 100 | 250 | 500)
- 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"