...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