real arithmetic
31Field arithmetic — In mathematics, field arithmetic is a subject that studies the interrelations between arithmetic properties of a ql|field (mathematics)|field and its absolute Galois group.It is an interdisciplinary subject as it uses tools from algebraic number… …
32Timeline of numerals and arithmetic — A timeline of numerals and arithmetic Before 2000 BC * ca. 20,000 BC Nile Valley, Ishango Bone: possibly the earliest reference to prime numbers and Egyptian multiplication. * ca. 3400 BC Mesopotamia, the Sumerians invent the first numeral system …
33Symmetric level-index arithmetic — The level index (LI) representation of numbers, and its algorithms for arithmetic operations, were introduced by Clenshaw Olver. The symmetric form of the LI system and its arithmetic operations were presented by Clenshaw Turner. Anuta, Lozier,… …
34The Devil's Arithmetic — Saltar a navegación, búsqueda Trama La Aritmetica del Diablo es una película que trata sobre la familia Stern,de religion judía;pero Hannah (Kirsten Dunst) es una chica rebelde que no le importa seguir la tradición de su religon y la de su… …
35Polynomial arithmetic — includes basic mathematical operations such as addition, subtraction, and multiplication. These operations are defined naturally as if the variable x was an element of S. Division is defined similarly, but requires that S be a field. Examples of… …
36Discrete cosine transform — A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to numerous applications in science and engineering, from lossy… …
37Discrete Hartley transform — A discrete Hartley transform (DHT) is a Fourier related transform of discrete, periodic data similar to the discrete Fourier transform (DFT), with analogous applications in signal processing and related fields. Its main distinction from the DFT… …
38Root-finding algorithm — A root finding algorithm is a numerical method, or algorithm, for finding a value x such that f(x) = 0, for a given function f. Such an x is called a root of the function f. This article is concerned with finding scalar, real or complex roots,… …
39Satisfiability Modulo Theories — (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first order logic with equality. Examples of theories typically used in computer science are the theory of real… …
40Kahan summation algorithm — In numerical analysis, the Kahan summation algorithm (also known as compensated summation) significantly reduces the numerical error in the total obtained by adding a sequence of finite precision floating point numbers, compared to the obvious… …
