Anatoly Karatsuba
Anatoly Alexeyevich Karatsuba (his first name often spelled Anatolii) (; Grozny, Soviet Union, 31 January 1937 – Moscow, Russia, 28 September 2008) was a Russian people, Russian mathematician working in the field of analytic number theory, p-adic number, ''p''-adic numbers and Dirichlet series. For most of his student and professional life he was associated with the MSU Faculty of Mechanics and Mathematics, Faculty of Mechanics and Mathematics of Moscow State University, defending a Doktor nauk, D.Sc. there entitled "The method of trigonometric sums and intermediate value theorems" in 1966. He later held a position at the Steklov Institute of Mathematics of the Russian Academy of Sciences, Academy of Sciences. His textbook ''Foundations of Analytic Number Theory'' went to two editions, 1975 and 1983. The Karatsuba algorithm is the earliest known divide and conquer algorithm for multiplication and lives on as a special case of its direct generalization, the Toom–Cook multipli ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Grozny
Grozny (, ; ) is the capital city of Chechnya, Russia. The city lies on the Sunzha River. According to the 2021 Russian census, 2021 census, it had a population of 328,533 — up from 210,720 recorded in the 2002 Russian Census, 2002 census, but still less than the 399,688 recorded in the 1989 Soviet Census, 1989 census. It was previously known as (until 1870). Names In Russian language, Russian, "Grozny" means "fearsome", "menacing", or "redoubtable", the same word as in Ivan Grozny (Ivan the Terrible). While the official name in Chechen language, Chechen is the same, informally the city is known as "" (""), which literally means "the city () on the Sunzha River ()". In 1996, during the First Chechen War, the authorities of the Chechen republic of Ichkeria renamed the city Dzhokhar-Ghala (), literally Dzhokhar City, or Dzhokhar/Djohar for short, after Dzhokhar Dudayev, the first president of the republic, killed by the Russian armed forces. In December 2005, the Chech ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Karatsuba Algorithm
The Karatsuba algorithm is a fast multiplication algorithm for integers. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. Knuth D.E. (1969) '' The Art of Computer Programming. v.2.'' Addison-Wesley Publ.Co., 724 pp. It is a divide-and-conquer algorithm that reduces the multiplication of two ''n''-digit numbers to three multiplications of ''n''/2-digit numbers and, by repeating this reduction, to at most n^\approx n^ single-digit multiplications. It is therefore asymptotically faster than the traditional algorithm, which performs n^2 single-digit products. The Karatsuba algorithm was the first multiplication algorithm asymptotically faster than the quadratic "grade school" algorithm. The Toom–Cook algorithm (1963) is a faster generalization of Karatsuba's method, and the Schönhage–Strassen algorithm (1971) is even faster, for sufficiently large ''n''. History The standard procedure for multiplication of two ''n''-digit numbers requires ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Natural Number
In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive integers Some authors acknowledge both definitions whenever convenient. Sometimes, the whole numbers are the natural numbers as well as zero. In other cases, the ''whole numbers'' refer to all of the integers, including negative integers. The counting numbers are another term for the natural numbers, particularly in primary education, and are ambiguous as well although typically start at 1. The natural numbers are used for counting things, like "there are ''six'' coins on the table", in which case they are called ''cardinal numbers''. They are also used to put things in order, like "this is the ''third'' largest city in the country", which are called ''ordinal numbers''. Natural numbers are also used as labels, like Number (sports), jersey ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Mean Value Theorem
In mathematics, the mean value theorem (or Lagrange's mean value theorem) states, roughly, that for a given planar arc (geometry), arc between two endpoints, there is at least one point at which the tangent to the arc is parallel to the secant line, secant through its endpoints. It is one of the most important results in real analysis. This theorem is used to prove statements about a function on an interval (mathematics), interval starting from local hypotheses about derivatives at points of the interval. History A special case of this theorem for inverse interpolation of the sine was first described by Parameshvara (1380–1460), from the Kerala School of Astronomy and Mathematics in India, in his commentaries on Govindasvāmi and Bhāskara II. A restricted form of the theorem was proved by Michel Rolle in 1691; the result was what is now known as Rolle's theorem, and was proved only for polynomials, without the techniques of calculus. The mean value theorem in its modern for ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Ivan Matveyevich Vinogradov
Ivan Matveevich Vinogradov ( rus, Ива́н Матве́евич Виногра́дов, p=ɪˈvan mɐtˈvʲejɪvʲɪtɕ vʲɪnɐˈɡradəf, a=Ru-Ivan_Matveyevich_Vinogradov.ogg; 14 September 1891 – 20 March 1983) was a Soviet mathematician, who was one of the creators of modern analytic number theory, and also a dominant figure in mathematics in the USSR. He was born in the Velikiye Luki district, Pskov Oblast. He graduated from the University of St. Petersburg, where in 1920 he became a Professor. From 1934 he was a Director of the Steklov Institute of Mathematics, a position he held for the rest of his life, except for the five-year period (1941–1946) when the institute was directed by Academician Sergei Sobolev. In 1941 he was awarded the Stalin Prize. He was elected to the American Philosophical Society in 1942. In 1951 he became a foreign member of the Polish Academy of Sciences and Letters in Kraków. Mathematical contributions In analytic number theory, '' ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Moore Machine
In the theory of computation, a Moore machine is a finite-state machine whose current output values are determined only by its current state. This is in contrast to a Mealy machine, whose output values are determined both by its current state and by the values of its inputs. Like other finite state machines, in Moore machines, the input typically influences the next state. Thus the input may indirectly influence subsequent outputs, but not the current or immediate output. The Moore machine is named after Edward F. Moore, who presented the concept in a 1956 paper, “ Gedanken-experiments on Sequential Machines.” Formal definition A Moore machine can be defined as a 6-tuple (S, s_0, \Sigma, O, \delta, G) consisting of the following: * A finite set of states S * A start state (also called initial state) s_0 which is an element of S * A finite set called the input alphabet \Sigma * A finite set called the output alphabet O * A transition function \delta : S \times \Sigma ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
:Edward F
Edward is an English male name. It is derived from the Anglo-Saxon name ''Ēadweard'', composed of the elements '' ēad'' "wealth, fortunate; prosperous" and '' weard'' "guardian, protector”. History The name Edward was very popular in Anglo-Saxon England, but the rule of the Norman and Plantagenet dynasties had effectively ended its use amongst the upper classes. The popularity of the name was revived when Henry III named his firstborn son, the future Edward I, as part of his efforts to promote a cult around Edward the Confessor, for whom Henry had a deep admiration. Variant forms The name has been adopted in the Iberian peninsula since the 15th century, due to Edward, King of Portugal, whose mother was English. The Spanish/Portuguese forms of the name are Eduardo and Duarte. Other variant forms include French Édouard, Italian Edoardo and Odoardo, German, Dutch, Czech and Romanian Eduard and Scandinavian Edvard. Short forms include Ed, Eddy, Eddie, Ted, Teddy and ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Andrey Kolmogorov
Andrey Nikolaevich Kolmogorov ( rus, Андре́й Никола́евич Колмого́ров, p=ɐnˈdrʲej nʲɪkɐˈlajɪvʲɪtɕ kəlmɐˈɡorəf, a=Ru-Andrey Nikolaevich Kolmogorov.ogg, 25 April 1903 – 20 October 1987) was a Soviet mathematician who played a central role in the creation of modern probability theory. He also contributed to the mathematics of topology, intuitionistic logic, turbulence, classical mechanics, algorithmic information theory and Analysis of algorithms, computational complexity. Biography Early life Andrey Kolmogorov was born in Tambov, about 500 kilometers southeast of Moscow, in 1903. His unmarried mother, Maria Yakovlevna Kolmogorova, died giving birth to him. Andrey was raised by two of his aunts in Tunoshna (near Yaroslavl) at the estate of his grandfather, a well-to-do Russian nobility, nobleman. Little is known about Andrey's father. He was supposedly named Nikolai Matveyevich Katayev and had been an Agronomy, agronomist. Katayev ha ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
FEE Method
In mathematics, the FEE method, or fast E-function evaluation method, is the method of fast summation of series of a special form. It was constructed in 1990 by Ekaterina Karatsuba and is so-named because it makes fast computations of the Siegel -functions possible, in particular of e^x. A class of functions, which are "similar to the exponential function," was given the name "E-functions" by Carl Ludwig Siegel. Among these functions are such special functions as the hypergeometric function, cylinder, spherical functions and so on. Using the FEE, it is possible to prove the following theorem: Theorem: Let y=f(x) be an elementary transcendental function, that is the exponential function, or a trigonometric function, or an elementary algebraic function, or their superposition, or their inverse, or a superposition of the inverses. Then : s_f(n) = O(M(n)\log^2n). \, Here s_f(n) is the complexity of computation (bit) of the function f(x) with accuracy up to n digits, M(n) i ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
The Art Of Computer Programming
''The Art of Computer Programming'' (''TAOCP'') is a comprehensive multi-volume monograph written by the computer scientist Donald Knuth presenting programming algorithms and their analysis. it consists of published volumes 1, 2, 3, 4A, and 4B, with more expected to be released in the future. The Volumes 1–5 are intended to represent the central core of computer programming for sequential machines; the subjects of Volumes 6 and 7 are important but more specialized. When Knuth began the project in 1962, he originally conceived of it as a single book with twelve chapters. The first three volumes of what was then expected to be a seven-volume set were published in 1968, 1969, and 1973. Work began in earnest on Volume 4 in 1973, but was suspended in 1977 for work on typesetting prompted by the second edition of Volume 2. Writing of the final copy of Volume 4A began in longhand in 2001, and the first online pre-fascicle, 2A, appeared later in 2001. The first published installment ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Toom–Cook Multiplication
Toom–Cook, sometimes known as Toom-3, named after Andrei Toom, who introduced the new algorithm with its low complexity, and Stephen Cook, who cleaned the description of it, is a multiplication algorithm for large integers. Given two large integers, ''a'' and ''b'', Toom–Cook splits up ''a'' and ''b'' into ''k'' smaller parts each of length ''l'', and performs operations on the parts. As ''k'' grows, one may combine many of the multiplication sub-operations, thus reducing the overall computational complexity of the algorithm. The multiplication sub-operations can then be computed recursively using Toom–Cook multiplication again, and so on. Although the terms "Toom-3" and "Toom–Cook" are sometimes incorrectly used interchangeably, Toom-3 is only a single instance of the Toom–Cook algorithm, where ''k'' = 3. Toom-3 reduces nine multiplications to five, and runs in Θ(''n''log(5)/log(3)) ≈ Θ(''n''1.46). In general, Toom-''k'' runs in , where , ''ne'' is the time spent ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |