For recent (1998) surveys of algorithms for numerical linear algebra problems, see [[#References|[a2]]], [[#Referen
...usually FORTRAN, sometimes C or C++. Their main field of application is in algorithms with high numerical robustness and large scale computations.
10 KB (1,478 words) - 17:02, 1 July 2020
...to be an algorithm (a partial recursive function). By using an encoding of algorithms by numbers, one can write the condition "the number e is a realization of
...the logic of constructive mathematics" , ''Investigations on the theory of algorithms and mathematical logic'' , '''2''' , Moscow (1976) pp. 3–31 (In Russia
12 KB (1,856 words) - 21:00, 4 June 2020
<table><TR><TD valign="top">[1]</TD> <TD valign="top"> R.P. Brent, "Algorithms for minimization without derivatives" , Prentice-Hall (1973)</TD></TR><TR>
5 KB (766 words) - 08:12, 6 June 2020
...e are many methods for obtaining such a sequence. However, the majority of algorithms suffer from a sharp deterioration when the level surfaces $ J ( x) = \tex
...References|[8]]]). For the case of minimization of a convex function these algorithms are very effective, since having a quadratic termination they do not requir
17 KB (2,572 words) - 12:56, 13 January 2024
Genetic algorithms, methods for finding maxima and minima of non-differentiable functions, dep
4 KB (668 words) - 08:28, 6 June 2020
...free semi-groups (see [[#References|[7]]]–[[#References|[9]]]). There are algorithms that recognize the solvability of arbitrary equations in a free semi-group.
5 KB (786 words) - 20:17, 8 December 2015
...TD></TR><TR><TD valign="top">[2]</TD> <TD valign="top"> A.I. Mal'tsev, "Algorithms and recursive functions" , Wolters-Noordhoff (1970) (Translated from Russ
6 KB (887 words) - 14:54, 7 June 2020
...vergence bounds hold for conjugate gradient and related more sophisticated algorithms [[#References|[a4]]]. Even the basic Richardson method $ x _ {k + 1 } =
5 KB (717 words) - 18:47, 5 April 2020
A number of minimization (reduction) algorithms and algorithms of automaton synthesis are associated with these methods of specifying auto
Algorithms which yield the transition matrix of an automaton from formal schemes of th
25 KB (3,544 words) - 07:31, 26 March 2023
||{{Ref|Pr}}|| V. V. Prasolov, "Polynomials", vol. 11 of "Algorithms and Computation in Mathematics", Springer (2004).
5 KB (801 words) - 20:34, 13 September 2016
...al configurations, algorithms and their construction, optimization of such algorithms, as well as the solution of problems of enumeration, in particular the dete
...estigation is to elucidate the conditions for its existence and to develop algorithms for its construction.
28 KB (4,167 words) - 17:45, 4 June 2020
...top">[4]</TD> <TD valign="top"> Sh. Ushchumlich, "Investigation of some algorithms for the analysis and synthesis of automata" ''Soviet Math. Dokl.'' , '''20
5 KB (830 words) - 14:27, 12 November 2023
...parison of the experimental performance of several published approximation algorithms [[#References|[a3]]] indicates that the approach which best combines speed
4 KB (704 words) - 12:30, 17 February 2021
...ristic, LPT has become a touchstone for the design of heuristic scheduling algorithms of high quality.
5 KB (739 words) - 16:43, 3 August 2014
...D valign="top">[a2]</TD> <TD valign="top"> M.A.A. van Leeuwen, "Tableau algorithms defined naturally for pictures" ''Discrete Math.'' , '''157''' (1996) pp
5 KB (742 words) - 08:06, 6 June 2020
de Casteljau algorithms using Bézier points $ \mathbf b _ {ij } $,
6 KB (872 words) - 06:29, 30 May 2020
...ces|[a3]]], [[#References|[a4]]], [[#References|[a2]]]. Projection pursuit algorithms approximate a function of $n$ variables by functions of the form
5 KB (780 words) - 16:45, 1 July 2020
.../TD> <TD valign="top"> M. Minoux, "Mathematical programming: theory and algorithms" , Wiley (1986)</TD></TR>
...op">[7]</TD> <TD valign="top"> A.R.G. Heesterman, "Matrices and simplex algorithms" , Reidel (1983)</TD></TR>
12 KB (2,034 words) - 09:14, 9 June 2016
In view of the wide use of systems of distinct representatives, algorithms for their practical determination (see [[#References|[1]]]) are of interest
6 KB (900 words) - 08:25, 6 June 2020
...</TD> <TD valign="top"> G.P. McCormick, "Nonlinear programming: theory, algorithms, and applications" , Wiley (1983)</TD></TR>
5 KB (749 words) - 13:25, 3 May 2016