...rogram, i.e. a collection of machine commands describing the computational algorithms, organizing the realization of the computational process in the given compu
...onal steps, method of]]). An important task in the theory of computational algorithms is their optimization.
10 KB (1,642 words) - 08:41, 29 August 2014
Already in the Middle Ages a number of algorithms for constructing magic squares of odd order $ n $
Many algorithms for constructing magic squares are known (resulting in squares with non-lin
5 KB (762 words) - 19:27, 12 January 2024
..."A space-efficient on-line method of computing quantile estimators" ''J. Algorithms'' , '''2''' (1981) pp. 164–177</TD></TR></table>
2 KB (281 words) - 17:22, 7 February 2011
...n="top"> J.P. Duval, "Factorizing words over an ordered alphabet" ''J. Algorithms'' , '''4''' (1983) pp. 363–381</TD></TR>
6 KB (946 words) - 13:41, 20 March 2023
...se of development of the theory of algorithms (cf. [[Algorithms, theory of|Algorithms, theory of]]), there emerged a number of modifications of the original defi
===Representing Algorithms by Turing Machines===
14 KB (2,355 words) - 12:40, 28 December 2013
...is proved by providing exponentially large lower bounds that hold for all algorithms. Many problems suffer from the curse of dimension. Examples include numeric
...o [[Optimization of computational algorithms|Optimization of computational algorithms]]. Whether a problem suffers from the curse of dimension depends on the exa
12 KB (1,706 words) - 20:29, 9 December 2023
...nce, or they may vary during the calculation. For this reason, one designs algorithms that enable one to use grids that are more closely spaced in such zones.
In order to set up reliable numerical algorithms, the problem of constructing a grid is often formulated as a task of minimi
5 KB (759 words) - 10:59, 16 April 2014
...>[a3]</TD> <TD valign="top"> J.M. Robertson, W.A. Webb, "Cake-cutting algorithms: be fair if you can" , A.K. Peters (1998)</TD></TR><TR><TD valign="top">[a
2 KB (317 words) - 16:50, 30 December 2018
...ly analyzed as well as implemented. Especially, primal-dual interior-point algorithms (i.e., methods generating primal and dual solutions in each iteration) prov
...ign="top"> Yu. Nesterov, A.S. Nemirovskii, "Interior point polynomial algorithms in convex programming" , ''Studies in Applied Mathematics'' , '''13''' , SI
5 KB (710 words) - 22:13, 5 June 2020
.../TD> <TD valign="top"> M. Minoux, "Mathematical programming: theory and algorithms" , Wiley (1986)</TD></TR></table>
3 KB (372 words) - 08:07, 22 November 2014
...includes, in particular, the self-scaling variable metric algorithms (SSVM algorithms), which share most properties of the Broyden family and automatically compe
...op"> S.S. Oren, D.G. Luenberger, "Self-scaling variable metric (SSVM) algorithms I" ''Management Science'' , '''20''' (1974) pp. 845–862</td></tr><tr><
12 KB (1,897 words) - 19:37, 9 February 2024
...[[Network|network]] or [[Graph|graph]] that satisfy a given property. Such algorithms are also used, e.g., to optimize a function on a graph or network or on a s
There is an obvious analogous search algorithm for non-oriented graphs. These algorithms run in $ O ( \# V + \# E ) $
11 KB (1,442 words) - 08:12, 6 June 2020
In practice, time-consuming scanning is combined with algorithms for finding a local extremum: by scanning and a priori reduction of $ f (
1) Algorithms of the heavy-sphere type (cf. [[Heavy sphere, method of the|Heavy sphere, m
9 KB (1,335 words) - 08:01, 6 June 2020
...and hence the Berlekamp–Massey algorithm, has connections to several other algorithms, most notably the extended [[Euclidean algorithm|Euclidean algorithm]] [[#R
...gorithms in numerical analysis such as Lanczos recursion and Levinson–Shur algorithms for Toeplitz matrices, as well as problems of minimal realizations in syste
8 KB (1,155 words) - 18:48, 26 January 2024
...TD></TR><TR><TD valign="top">[a2]</TD> <TD valign="top"> H. Edelsbrunner, "Algorithms in combinatorial geometry" , Springer (1987) {{MR|0904271}} {{ZBL|0634.5200
2 KB (301 words) - 08:28, 6 June 2020
Hierarchical clustering algorithms can be characterized as ''greedy''
The algorithms, which have the potential for ''exactly'' replicating
13 KB (1,912 words) - 18:57, 7 March 2024
...estimate of the complexity of the amount of work and the specification of algorithms (see also [[Algorithmic information theory|Algorithmic information theory]]
...hnik, "On the unsolvability of the reducibility problem in the theory of algorithms" ''Dokl. Akad. Nauk SSSR'' , '''108''' : 2 (1956) pp. 194–197 (In Ru
6 KB (921 words) - 17:32, 5 June 2020
...recent survey of the simplex algorithm, the Karmarkar algorithm (interior algorithms) and ellipsoid methods in relation to each other, cf. [[#References|[a8]]].
...p">[a6]</TD> <TD valign="top"> A.R.G. Heesterman, "Matrices and simplex algorithms" , Reidel (1983)</TD></TR><TR><TD valign="top">[a7]</TD> <TD valign="top">
8 KB (1,246 words) - 06:35, 7 May 2022
A method of defining functions studied in the theory of algorithms and other branches of mathematical logic. This method has been used for a l
...nition of recursion consists not only in its significance in the theory of algorithms, but also in that it permits one to look from an "algorithmic" (in the ge
13 KB (2,044 words) - 08:10, 6 June 2020
factorization. Such decompositions play an important role in numerical algorithms, [[#References|[a2]]], [[#References|[a3]]] (for instance, in computing eig
2 KB (350 words) - 08:26, 6 June 2020