-
21 алгорифм Евклида
Mathematics: Euclidean algorithm -
22 алгоритм
algorithm
– алгоритм выполнения
– алгоритм Грайза
– алгоритм Кули-Таки
– алгоритм Мак-Класки
– алгоритм перевода
– алгоритм Поста
– алгоритм приближенно-двойственный
– алгоритм распределения
– алгоритм Сенда-Таки
– алгоритм сложения
– алгоритм трансляции
– алгоритм управления
– вычислительный алгоритм
– декодирующий алгоритм
– детерминированный алгоритм
– конструировать алгоритм
– обобщенный алгоритм
– последовательный алгоритм
– рекурсивный алгоритм
– самоизменяющийся алгоритм
– табличный алгоритм
– формулировать алгоритм
– челночный алгоритм
алгоритм деления Эвклида — Euclidean division algorithm
алгоритм обучения распознавания — pattern-recognition algorithm
алгоритм с неполной памятью — partial-memory algorithm
алгоритм с полной памятью — full-memory algorithm
алгоритм управляющего устройства — controller algorithm
-
23 Отсутствие артиклей перед существительными, которые снабжены ссылками
It follows from Theorem 1 that $x=1$Section 2 of this paper gives (contains) a concise presentation of the notation to be used belowProperty 1 is called (known as) the triangle inequalityThis assertion (statement, proposition) has been proved in part 1 (part (a)) of the (our) proofAlgorithm 1 (с большой буквы) defines elementary permutations and elementary triangle matrices of index 2Equation (1) ((the) inequality (1)) can thus be written in the (артикль обязателен) form (2)In the language of our notation, algorithm (1) (с маленькой буквы) is a stable way of computing the inner productThe only place where the algorithm can break down is in statement 3 (in Statement 3)We combine Exercises 1 and 2 to construct an algorithm for finding an approximate eigenvectorThis case is illustrated in (но не on) Figure 1The asymptotic formula (1) was proved in Example 1Corollary 1 can be used to estimate the error in the inverse of a perturbed matrixBy property 1 (by Theorem 1), this function is positive except at the zero vectorA less trivial example is given in Appendix 3Step 1 in Example 1 and steps 2 and 3 in Example 2The idea of a norm will be introduced in Chapter 4Now from statements 2 and 3 of (1), we have...All the drivers for solving linear systems are listed in Table 1 (are illustrated in Figure 1)If Algorithm 1 in four-digit arithmetic is applied to refine $x$, then we obtain...Assertion (ii) is nothing but the statement that one natural way of extending these ideas to $R^n$ is to generalize formula (1) to obtain a Euclidean length of a vectorBy property 1, this function is positive except at the zero vectorWe have seen on page 3 that set of matrices is a vector space which is essentially identical with...Equation (1) effectively gives an algorithm for using the output of Algorithm 1 to solve...Русско-английский словарь по прикладной математике и механике > Отсутствие артиклей перед существительными, которые снабжены ссылками
- 1
- 2
См. также в других словарях:
Euclidean algorithm — In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). Its major significance is that it does… … Wikipedia
Euclidean algorithm — Algebra. a method based on the division algorithm for finding the greatest common divisor of two given integers. [1950 55] * * * ▪ mathematics procedure for finding the greatest common divisor (GCD) of two numbers, described by the Greek… … Universalium
Euclidean algorithm — noun Date: circa 1955 a method of finding the greatest common divisor of two numbers by dividing the larger by the smaller, the smaller by the remainder, the first remainder by the second remainder, and so on until exact division is obtained… … New Collegiate Dictionary
Euclidean algorithm — noun A method based on the division algorithm for finding the greatest common divisor (gcd) of two given integers … Wiktionary
Euclidean algorithm — Algebra. a method based on the division algorithm for finding the greatest common divisor of two given integers. [1950 55] … Useful english dictionary
Extended Euclidean algorithm — The extended Euclidean algorithm is an extension to the Euclidean algorithm for finding the greatest common divisor (GCD) of integers a and b : it also finds the integers x and y in Bézout s identity: ax + by = gcd(a, b). ,(Typically either x or… … Wikipedia
algorithm — [al′gə rith΄əm] n. [altered (after ARITHMETIC) < ALGORISM] 1. Math. a) any systematic method of solving a certain kind of problem b) the repetitive calculations used in finding the greatest common divisor of two numbers: called in full… … English World dictionary
Euclidean domain — In abstract algebra, a Euclidean domain (also called a Euclidean ring) is a type of ring in which the Euclidean algorithm applies. A Euclidean domain is a specific type of integral domain, and can be characterized by the following (not… … Wikipedia
Euclidean — List of topics named after Euclid (Euclidean or, less commonly, Euclidian) *Euclidean space *Euclidean geometry *Euclid s Elements *Euclidean domain *Euclidean distance *Euclidean ball *Euclidean algorithm *Euclidean distance map *Extended… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
