...lkin, R. Coifman, V. Rokhlin, "Fast wavelet transforms and numerical algorithms" ''Comm. Pure Appl. Math.'' , '''44''' (1991) pp. 141–183</TD></TR><TR
6 KB (909 words) - 08:28, 6 June 2020
...op"> C.P. Schnorr, "A hierarchy of polynomial time lattice basis reduction algorithms" ''Theor. Comput. Sci.'' , '''53''' (1987) pp. 201–224 {{MR|0918090}} {{Z
8 KB (1,181 words) - 22:15, 5 June 2020
...edges have been used as main features in a large number of computer vision algorithms.
6 KB (889 words) - 15:31, 1 July 2020
...inhofer, "Algebraic combinatorics in mathematical chemistry. Methods and algorithms. I. Permutation groups and coherent (cellular) algebras" ''MATCH'' , '''40
7 KB (1,000 words) - 16:48, 14 January 2021
.... van Leeuwen, "The Robinson–Schensted correspondence and Schützenberger algorithms, an elementary approach" ''Electronic J. Combinatorics'' , '''3''' : 2 (
8 KB (1,116 words) - 20:45, 16 November 2023
...s. This is pursued in [[#References|[a2]]], where there is a discussion of algorithms which, given two positive integers $a$ and $b$ in Zeckendorf form, produce
7 KB (975 words) - 17:43, 1 July 2020
====Simulation of Classical Algorithms====
...cases, it offers also an option for a direct realization of probabilistic algorithms. Especially, the creation of true random numbers become possible in the con
27 KB (4,213 words) - 18:53, 26 April 2014
...of the original differential problem, and deals with the justification of algorithms for the solution of difference problems. A finite-difference method (also c
...difference scheme should satisfy definite conditions so that the computing algorithms are sufficiently simple in practice. Some of these additional requirements
26 KB (3,757 words) - 17:33, 5 June 2020
algorithms for solving "similar" problems, although these similarities could be rath
6 KB (957 words) - 06:42, 26 March 2023
...cal formulation of the algorithm. In a later period, automatic translation algorithms were constructed on the base of general schemes applicable to a large numbe
7 KB (1,008 words) - 17:03, 7 February 2011
...Lambda-calculus|$\lambda$-calculus]]), Gödel's recursive functions, Markov algorithms (cf. also [[Algorithm|Algorithm]]) and Turing machines (cf. also [[Turing m
.../td></tr><tr><td valign="top">[a13]</td> <td valign="top"> "Approximation algorithms for NP hard problems" D. Hochbaum (ed.) , PWS (1997)</td></tr><tr><td val
22 KB (3,250 words) - 17:43, 1 July 2020
...al calculus into direct and indirect methods is largely arbitrary. In some algorithms both approaches are utilized. Moreover, some methods cannot be classified a
...s|[8]]]. If the right-hand end is also subject to boundary conditions, all algorithms become much more complicated. To deal with boundary conditions, a gradient
23 KB (3,462 words) - 08:27, 6 June 2020
Algorithms for constructing complete Latin squares are known only for even $ n $;
11 KB (1,681 words) - 11:23, 17 March 2023
...tion is used mainly in the statistics literature and in some literature on algorithms.
6 KB (948 words) - 16:55, 1 July 2020
...zaraa, H.D. Sherali, C.M. Shetty, "Nonlinear programming: Theory and algorithms" , Wiley (1993) (Edition: Second)</TD></TR>
...ing problem" A. Migdalas (ed.) et al. (ed.) , ''Multilevel Optimization: Algorithms and Applications'' , Kluwer Acad. Publ. (1998) pp. 315–332</TD></TR>
16 KB (2,514 words) - 17:28, 23 October 2017
...y obtaining more-accurate approximate solutions. A typical example of such algorithms is the following. If the sequence $ \{ A _ {n} \} $
20 KB (3,019 words) - 03:31, 14 June 2022
...</TD> <TD valign="top"> S.V. Yablonskii, "Mathematical logic, theory of algorithms and theory of sets" ''Trudy Mat. Inst. Steklov.'' , '''133''' pp. 263–2
8 KB (1,233 words) - 18:49, 5 April 2020
...subsampling a given signal. In this way, computationally highly efficient algorithms can be obtained. A problem noted with pyramid representations, however, is
7 KB (994 words) - 15:30, 1 July 2020
...ions of local problems, which are solved with the aid of appropriate local algorithms.
...eynolds numbers. The difficulties involved in the realization of numerical algorithms at large Reynolds numbers reflect the very properties of the solutions of t
23 KB (3,690 words) - 20:00, 4 January 2024
...valign="top"> V.V. Voevodin, "Numerical methods of algebra. Theory and algorithms" , Moscow (1966) (In Russian)</TD></TR><TR><TD valign="top">[2]</TD> <TD
10 KB (1,498 words) - 08:08, 21 March 2022
1805. Computer algorithms implementing this variant of the $LAR$ procedure
7 KB (1,015 words) - 19:42, 1 November 2023
...y of description of an]]). An extensively developing area in the theory of algorithms is the theory of [[Enumeration|enumeration]].
23 KB (3,461 words) - 16:05, 13 January 2021
...l'fand [[#References|[a1]]] and M. Demazure [[#References|[a8]]], who gave algorithms for computing representatives of Schubert cycles in the co-invariant algebr
10 KB (1,494 words) - 09:23, 10 November 2023
Methods for solving problems in gas dynamics by computational algorithms. Below the fundamental aspects of the theory of numerical methods for solvi
...s for solving simple problems of a standard structure (modular analysis of algorithms). There is as yet no rigorous foundation for such an approach, but the appr
28 KB (3,843 words) - 19:41, 5 June 2020
.... D'yakonov, "Minimization of computational work. Asymptotically-optimal algorithms" , Moscow (1989) (In Russian)</TD></TR><TR><TD valign="top">[14]</TD> <TD
20 KB (2,830 words) - 19:25, 9 January 2024
<TR><TD valign="top">[a13]</TD> <TD valign="top"> B. Schröder, "Algorithms vs. the fixed point property" I. Rival (ed.) , ''Proc. 1996 ORDAL conferen
9 KB (1,338 words) - 12:00, 9 January 2016
...[a12]</TD> <TD valign="top"> W.F. Dowling, J.H. Gallier, "Linear-time algorithms for testing the satisfiability of propositional Horn formulae" ''J. Logic
7 KB (1,111 words) - 06:59, 21 October 2016
...of 2000); the name "pseudo-spectral method" is also often applied to it. Algorithms for these methods have been well developed.
...rated recursively. This approach was used to formulate the first recursive algorithms for the automatic solution of differential equations using the tau method.
20 KB (2,974 words) - 16:52, 1 July 2020
...and syntactic methods. Syntactic methods often yield simpler decidability algorithms. For instance, the decidability of the elementary theory of $ p $-
...hod of quantifier elimination. Estimates of the complexity of decidability algorithms of theories are of importance. As a rule, a primitive-recursive solution al
18 KB (2,822 words) - 08:08, 6 June 2020
...|[12]]], [[#References|[15]]]). But the most detailed study, especially of algorithms, has been made only of numerical methods for classes of non-linear problems
.... D'yakonov, "Minimization of computational work. Asymptotically-optimal algorithms" , Moscow (1989) (In Russian)</TD></TR><TR><TD valign="top">[10]</TD> <TD
19 KB (2,657 words) - 14:54, 7 June 2020
...G. Dyakonov, "Minimization of computational work. Asymptotically optimal algorithms for elliptic problems" , Moscow (1989) (In Russian)</TD></TR><TR><TD vali
9 KB (1,360 words) - 13:02, 13 January 2024
...of perfect packings, as well as the possibility of constructing effective algorithms for solving these problems.
10 KB (1,477 words) - 11:05, 26 March 2023
...o estimate the accuracy of results and to check the stability of numerical algorithms (cf. also [[Stability of a computational process|Stability of a computation
...sue which matters to users. There is also the question of stability of the algorithms. By the stability of $ {\widehat{x} } $
30 KB (4,205 words) - 18:47, 5 April 2020
.... D'yakonov, "Minimization of computational work. Asymptotically optimal algorithms for elliptic problems" , Moscow (1969) (In Russian)</TD></TR><TR><TD vali
9 KB (1,320 words) - 22:17, 5 June 2020
...f viscous liquids and gases can be solved with the aid of fairly efficient algorithms, based on the use of difference schemes. For example, this is the case for
...computer. In this case the application of explicit schemes yields simpler algorithms. One explicit scheme recommended for the calculation of stationary flows by
23 KB (3,271 words) - 08:02, 6 June 2020
at least according to the presently known factorization algorithms. On the other hand, large random prime numbers can be generated fast. The p
12 KB (1,852 words) - 17:31, 5 June 2020
may be solved by using algorithms which are generalizations of the Gauss method.
10 KB (1,474 words) - 19:41, 5 June 2020
...in the rounding-off errors allowed on intermediate iteration. There exist algorithms that mix the parameters in (11) and guarantee the stability of the calculat
one of the algorithms for constructing $ \kappa _ {N} $
16 KB (2,300 words) - 19:29, 17 January 2024
...lah's proof of the Hales–Jewett theorem" , ''Mathematics of Ramsey theory (Algorithms Combin.)'' , '''5''' , Springer (1990) pp. 150–151</td></tr><tr><td val
10 KB (1,506 words) - 00:47, 15 February 2024
Cayley graphs have been used to analyse algorithms for computing with groups, see [[#References|[a5]]]. For infinite groups, C
10 KB (1,435 words) - 07:01, 29 March 2024
...lign="top"> A.A. Markov, N.M. [N.M. Nagornyi] Nagorny, "The theory of algorithms" , Kluwer (1988) pp. §16 (Translated from Russian)</TD></TR></table>
12 KB (1,707 words) - 08:23, 6 June 2020
...nclude problems solved by constructions or through the use of arithmetical algorithms. After defining the fundamental geometrical concepts and objects, Euclid pr
9 KB (1,351 words) - 20:43, 26 November 2016
...ple, electron-tube schemes, neural networks and certain forms of computing algorithms. This is one of the basic classes of control systems (cf. [[Control system|
12 KB (1,820 words) - 11:43, 26 March 2023
...n="top">[10]</TD> <TD valign="top"> Yu.I. Yanov, "On logical schemes of algorithms" ''Probl. Kibernetiki'' , '''1''' (1958) pp. 75–127 (In Russian)</TD>
21 KB (3,241 words) - 08:25, 6 June 2020
...der small changes of the original information. A second question is: What algorithms are there for the construction of such solutions? Answers to these basic q
...nverges to $z_0$, and under these conditions it is sufficient to exhibit algorithms for the construction of regularizing minimizing sequences. This can be don
33 KB (5,246 words) - 00:23, 25 April 2012
...cumbersome calculations. Instead of this, one can apply various refinement algorithms (for example, based on [[Perturbation theory|perturbation theory]]).
11 KB (1,669 words) - 19:37, 5 June 2020
...nal matrix functions and on the search for explicit formulas and efficient algorithms for the construction of interpolants in a form which is suitable for engine
10 KB (1,474 words) - 14:54, 7 June 2020
...ns) in order to improve the classification of examples based on clustering algorithms.
...it failed, an approach which underlies a variety of reinforcement learning algorithms [[#References|[a11]]].
21 KB (3,152 words) - 17:43, 1 July 2020
...for solving the stationary problem (1). However, there are more economical algorithms for the solution of multi-dimensional non-stationary boundary value problem
16 KB (2,196 words) - 05:17, 14 September 2022
..."top"> C.H. Papadimitriou, K. Steiglitz, "Combinatorial optimization. Algorithms and complexity" , Prentice-Hall (1982) {{ZBL|0503.90060}}</TD></TR>
10 KB (1,753 words) - 20:24, 20 November 2023
for Markov normal algorithms (cf. [[Normal algorithm|Normal algorithm]]) applied to words of length $
There are realization algorithms that are locally continuous in the parameters $ T _ {0} , T _ {1} , . .
27 KB (4,142 words) - 14:55, 7 June 2020
...ifurcations. For a recent survey of the literature, available software and algorithms in this field cf. [[#References|[a1]]].
12 KB (1,799 words) - 08:05, 6 June 2020
...ohen (1969), A. Macintyre (1976) and many others, gave primitive-recursive algorithms for the elimination of all quantifiers up to those which refer to formulas
12 KB (1,846 words) - 09:28, 26 November 2016
...al mechanics|Correlation function in statistical mechanics]]). It includes algorithms for establishing non-trivial estimates for equilibrium quasi-averages, enab
11 KB (1,490 words) - 08:09, 6 June 2020
...ethods, using computers (finite-difference methods and other computational algorithms for boundary value problems), acquire a special significance for the invest
13 KB (1,857 words) - 21:26, 8 November 2014
The formulas and algorithms enabling one to find solutions of games can also refer to a number of optim
...racter (many of them are based on fixed-point theorems) and do not contain algorithms for finding solutions. Therefore, particular analytic and numerical methods
25 KB (4,000 words) - 19:41, 5 June 2020
...ed above (except the monadic one) are undecidable. Nevertheless, there are algorithms for undecidable logical calculi that for each derivable formula establish i
12 KB (1,934 words) - 19:30, 28 October 2023
Algorithms are known which reduce the determination (description) of all solutions of
such algorithms were constructed by J.L. Lagrange and C.F. Gauss, who created the general t
32 KB (4,863 words) - 08:08, 12 August 2022
...for describing computational processes or, equivalently, for writing down algorithms to be executed by computers. One distinguishes between problem-oriented alg
12 KB (1,804 words) - 16:56, 7 February 2011
...he basis of the deviance function, which was traditionally employed in GLM algorithms as both the basis of convergence and as a goodness-of-fit statistic. The lo
30 KB (4,314 words) - 13:25, 30 May 2016
...ed.) T. Mora (ed.) O. Moreno (ed.) , ''Proc. of Applied Algebra, Algebraic Algorithms and Error–Correcting Codes--AAECC-10'' , ''Lecture Notes in Computer Scie
12 KB (1,769 words) - 08:31, 26 March 2023
...]</TD> <TD valign="top"> M. Grötschel, L. Lovasz, A. Schrijver, "Geometric algorithms and combinatorial optimization" , Springer (1988) {{MR|0936633}} {{ZBL|0634
14 KB (2,052 words) - 10:49, 21 March 2022
..."top"> B.E. Sagan, "The symmetric group: representations, combinatorial algorithms, and symmetric functions" , Wadsworth&Brooks/Cole (1991) (Second ed.:
14 KB (2,001 words) - 10:09, 11 November 2023
.... D'yakonov, "Minimization of computational work. Asymptotically-optimal algorithms" , Moscow (1989) (In Russian)</TD></TR><TR><TD valign="top">[12]</TD> <TD
13 KB (1,891 words) - 13:06, 13 January 2024
...ts of the concepts of information and randomness by means of the theory of algorithms" ''Russian Math. Surveys'' , '''25''' : 6 (1970) pp. 82–124 ''Uspekh
14 KB (2,246 words) - 06:44, 26 March 2023
.... D'yakonov, "Minimization of computational work. Asymptotically-optimal algorithms" , Moscow (1989) (In Russian)</TD></TR>
15 KB (2,220 words) - 08:52, 10 April 2023
In AUTO, the numerical quality of the algorithms is strongly emphasised and the graphical user interface got less attention.
13 KB (1,928 words) - 17:00, 1 July 2020
...s for a description of all possible completions of a desired type, and for algorithms for the construction of particular ones. Completion problems arise in a var
14 KB (2,045 words) - 15:19, 28 February 2022
and the development of algorithms useful in practice for a numerical solution are still far from being finall
14 KB (2,042 words) - 19:35, 5 June 2020
...he construction of its discrete analogue, the development of computational algorithms and programs for the computer realization of the discrete models, an analys
15 KB (2,159 words) - 17:08, 7 February 2011
...ach (ed.) , ''New Trends in Discrete and Computational Geometry'' , '''10: Algorithms and Combinatorics''' , Springer (1993) pp. 163–198</td></tr><tr><td val
16 KB (2,414 words) - 17:00, 1 July 2020
A characteristic feature of the transport problem, which is used in numerical algorithms, is that the value of $ L ^ {-} 1 \psi $
17 KB (2,415 words) - 09:04, 13 January 2024
...erty. This is part of a more general problem — the construction of compact algorithms for the recognition of various properties.
23 KB (3,205 words) - 08:10, 6 June 2020
...a1]</TD> <TD valign="top"> R.L. Adler, D. Coppersmith, M. Hassner, "Algorithms for sliding block codes" ''IEEE Trans. Inform. Theory'' , '''219''' (1983
15 KB (2,197 words) - 08:48, 29 April 2023
...screte or continuous state space as well to the corresponding formulas and algorithms (cf. [[Idempotent algorithm|Idempotent algorithm]]).
18 KB (2,598 words) - 22:11, 5 June 2020
...but of recurrence relations existing in the Padé table. A large number of algorithms have been constructed for the automatic calculation of a Padé approximant;
15 KB (2,227 words) - 13:32, 11 November 2023
...n homological algebra)]]). It is motivated by the desire to find effective algorithms in [[Homological algebra|homological algebra]]. The cornerstone of the theo
18 KB (2,748 words) - 01:18, 15 February 2024
...ov criterion]]). However, as a rule, these criteria do not yield effective algorithms to construct $ \phi _ {f} (t) $.
29 KB (4,328 words) - 18:47, 5 April 2020
One of the advantages of Runge–Kutta methods is that the algorithms that they produce are uniform, i.e. they remain unchanged upon passage from
16 KB (2,467 words) - 15:35, 4 June 2020
algorithms)
13 KB (2,280 words) - 10:48, 28 October 2023
...pe of hypergraph), then one can efficiently reason using the Shenoy–Shafer algorithms [[#References|[a7]]]. Any hypergraph can be transformed into a hypertree, b
19 KB (2,724 words) - 17:44, 1 July 2020
...alling to mind the constructive direction, in which one looks for explicit algorithms for determining the membership of a polynomial to some ideal. However, the
16 KB (2,400 words) - 17:45, 4 June 2020
...ields solutions of a wide variety of problems by means of purely algebraic algorithms (in the sense that the algorithm itself no longer contains the explicit ope
22 KB (3,357 words) - 17:34, 1 January 2021
...tion|general position]] the Fermat–Torricelli problem does not allow exact algorithms under computation models with arithmetic operations and extraction of $k$th
15 KB (2,228 words) - 16:45, 1 July 2020
...orms of finite presentations" G. Baumslag (ed.) C.F. Miller, III (ed.) , ''Algorithms and Classification in Combinatorial Group Theory'' , Springer (1992)</td></
18 KB (2,803 words) - 16:46, 1 July 2020
...cant group is formed by power methods. The majority of their computational algorithms are arranged according to the following scheme:
20 KB (3,033 words) - 22:16, 5 June 2020
many software algorithms use the deviance rather than the
20 KB (2,887 words) - 10:20, 10 March 2024
simple adjustments to the Poisson and negative binomial algorithms, has stimulated
19 KB (2,808 words) - 10:20, 10 March 2024
...l), research into sufficient conditions, and the construction of numerical algorithms. The relations between solutions of problems of the mathematical theory of
21 KB (3,161 words) - 08:04, 6 June 2020
Methods for solving hyperbolic partial differential equations using numerical algorithms.
24 KB (3,317 words) - 22:11, 5 June 2020
...routs Game"], FUN 2001 (2nd Convegno International Conference on Fun with Algorithms), Isola d’Elba 2001, Ed. Carleton Scientific, pp. 117-132
19 KB (3,145 words) - 10:05, 18 February 2021
...gainst solution quality during the run-time of an algorithm (e.g., anytime algorithms). Alternatively, computationally hard problems can be segmented into "chea
18 KB (2,627 words) - 17:03, 1 July 2020
...solving conflicting control problems may be reduced to computer-realizable algorithms.
35 KB (5,293 words) - 20:32, 19 December 2020
algorithms have been developed allowing one to determine the existence and the number
29 KB (4,392 words) - 08:08, 6 June 2020
...ost commonly encountered degenerations, and their normal forms, as well as algorithms which reduce to the normal forms, are determined.
30 KB (4,632 words) - 08:14, 6 June 2020
These and other algorithms are implemented
23 KB (3,576 words) - 22:10, 12 March 2016
...mplest formulas realizing these functions has been given and corresponding algorithms for the synthesis of the formulas have been constructed (see [[#References|
34 KB (5,105 words) - 19:20, 16 January 2024
...ces|[13]]]. The corresponding boundary value problem has been analyzed and algorithms for numerical solution have been given [[#References|[14]]]. Here the funct
28 KB (4,176 words) - 05:30, 19 March 2022
...mate methods of solution of]]). These methods are convenient computational algorithms with effective estimates of accuracy, and the modern computational techniqu
33 KB (4,933 words) - 01:50, 23 January 2022
...al inverse problems, prediction of stochastic processes, and the design of algorithms for signal-processing VLSI chips. A survey of some of these ramifications i
33 KB (4,743 words) - 01:58, 17 June 2022
...alse already for knots [[#References|[1]]]. There are some descriptions of algorithms for presenting groups of links from their diagrams. The most widely known i
37 KB (5,599 words) - 11:39, 10 April 2023
<table><TR><TD valign="top">[1]</TD> <TD valign="top"> A.I. Mal'tsev, "Algorithms and recursive functions" , Wolters-Noordhoff (1970) (Translated from Russia
51 KB (7,267 words) - 07:39, 14 January 2024
algorithms for the resolution of singularities have been worked out (see, for example,
66 KB (9,825 words) - 01:45, 23 June 2022