New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 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...")
- 18:23, 4 August 2015 Graph connectivity (hist) [9,572 bytes] ASA (talk | contribs) (Created page with "== Basic definitions == Let <math>G = (V, E)</math> be a given (directed or undirected) graph. The sequence <math>P(u, v)</math> of edges <math>e_1 = (u, w_1)</math>, <math>...")
- 18:22, 4 August 2015 Search for isomorphic subgraphs (hist) [1,659 bytes] ASA (talk | contribs) (Created page with "== Formulation of the problem == Let <math>G</math> and <math>H</math> be given graphs. '''Search for isomorphic subgraphs''' consists in finding out whether the graph <math>...")
- 18:21, 4 August 2015 Construction of the minimum spanning tree (MST) (hist) [9,031 bytes] ASA (talk | contribs) (Created page with "== Formulation of the problem == Let <math>G = (V, E)</math> be a given connected, undirected graph with edge weights <math>f(e)</math>. A subgraph that is a tree and connect...")
- 18:20, 4 August 2015 Transitive closure of a directed graph (hist) [7,508 bytes] ASA (talk | contribs) (Created page with "== Formulation of the problem == Let <math>G = (V, E)</math> be a directed graph. The sequence <math>P(u, v)</math> of edges <math>e_1 = (u, w_1)</math>, <math>e_2 = (w_1, w...")
- 18:20, 4 August 2015 All Pairs Shortest Path (APSP) (hist) [10,383 bytes] ASA (talk | contribs) (Created page with "== Formulation of the problem == Let <math>G = (V, E)</math> be a given graph with edge weights <math>f(e)</math>, <math>e \in E</math>. The sequence <math>P(u, v)</math> o...")
- 18:18, 4 August 2015 Single Source Shortest Path (SSSP) (hist) [7,288 bytes] ASA (talk | contribs) (Created page with "= Single Source Shortest Path (SSSP) = == Formulation of the problem == Let <math>G = (V, E)</math> be a given graph with edge weights <math>f(e)</math> and a marked verte...")
- 14:19, 30 July 2015 Backward substitution (hist) [16,438 bytes] ASA (talk | contribs) (Created page with "Primary authors of this description: A.V.Frolov, Vad.V.Voevodin (#Locality of data and computations|Section...")
- 16:43, 28 July 2015 LU decomposition via Gaussian elimination (hist) [943 bytes] ASA (talk | contribs) (Created page with "Primary authors of this description: Vad.V.Voevodin (Section 2.2), :ru:Участник:Teplov|A.M.Te...") originally created as "Gaussian elimination"
- 15:57, 22 July 2015 Open Encyclopedia of Parallel Algorithmic Features (hist) [110 bytes] ASA (talk | contribs) (Created page with "__NOTOC__ {{Main page}} ru:Открытая энциклопедия свойств алгоритмов")
- 17:53, 20 July 2015 Glossary (hist) [35,612 bytes] ASA (talk | contribs) (Created page with " === Временна́я локальность === '''Временная локальность''' (temporal locality) показывает среднее число обр...")
- 14:01, 16 July 2015 Dense matrix-vector multiplication (hist) [8,409 bytes] ASA (talk | contribs) (Created page with "Основные авторы описания: А.В.Фролов, Вад.В.Воеводин (#Описание л...")
- 09:32, 14 July 2015 Cooley–Tukey Fast Fourier Transform, radix-2 case (hist) [10,606 bytes] ASA (talk | contribs) (Created page with "Основные авторы описания: А.В.Фролов, Вад.В.Воеводин (#Описание л...")
- 09:26, 6 July 2015 Forward substitution (hist) [10,596 bytes] ASA (talk | contribs) (Created page with "Основные авторы описания: А.В.Фролов, Вад.В.Воеводин (#Описание л...")
- 18:18, 23 June 2015 Dot product (hist) [8,732 bytes] ASA (talk | contribs) (Created page with "== Программная реализация == === Особенности реализации последовательного алгоритма === В простей...")
- 11:03, 18 June 2015 Back substitution (hist) [0 bytes] ASA (talk | contribs) (Created page with "Основные авторы описания: А.В.Фролов, Вад.В.Воеводин (#Описание л...")
- 14:18, 14 May 2015 Horners method (hist) [6,835 bytes] ASA (talk | contribs) (Created page with "Основные авторы описания: А.В.Фролов, Вад.В.Воеводин (#Описание л...") originally created as "Horner's method"
