Table of Contents
83 relations: Abacus, ACC0, Addison-Wesley, Addition, Al-Khwarizmi, Algorithm, Analog computer, Analog signal, Anatoly Karatsuba, Ancient history, Annals of Mathematics, Arbitrary-precision arithmetic, Arnold Schönhage, Avoirdupois, £sd, Babylonian mathematics, BBC News, Big O notation, Binary decision diagram, Binary multiplier, Bitwise operation, Booth's multiplication algorithm, Casino chip, Charles Babbage, Complex number, Computational complexity, Computer hardware, Conjecture, Dadda multiplier, Digital data, Discrete Fourier transform over a ring, Distributive property, Division algorithm, Enderûn, Fast Fourier transform, Fermat number, Fibonacci, Floating-point unit, Floor and ceiling functions, Fourier transform, Germany, Grid method multiplication, Horner's method, Integrated circuit, Iterated logarithm, Joris van der Hoeven, Karatsuba algorithm, Kronecker substitution, Lattice multiplication, Liber Abaci, ... Expand index (33 more) »
- Computer arithmetic algorithms
- Multiplication
Abacus
An abacus (abaci or abacuses), also called a counting frame, is a hand-operated calculating tool which was used from ancient times in the ancient Near East, Europe, China, and Russia, until the adoption of the Arabic numeral system.
See Multiplication algorithm and Abacus
ACC0
ACC0, sometimes called ACC, is a class of computational models and problems defined in circuit complexity, a field of theoretical computer science.
See Multiplication algorithm and ACC0
Addison-Wesley
Addison–Wesley is an American publisher of textbooks and computer literature.
See Multiplication algorithm and Addison-Wesley
Addition
Addition (usually signified by the plus symbol) is one of the four basic operations of arithmetic, the other three being subtraction, multiplication and division.
See Multiplication algorithm and Addition
Al-Khwarizmi
Muhammad ibn Musa al-Khwarizmi (محمد بن موسى خوارزمی), often referred to as simply al-Khwarizmi, was a polymath who produced vastly influential Arabic-language works in mathematics, astronomy, and geography.
See Multiplication algorithm and Al-Khwarizmi
Algorithm
In mathematics and computer science, an algorithm is a finite sequence of mathematically rigorous instructions, typically used to solve a class of specific problems or to perform a computation.
See Multiplication algorithm and Algorithm
Analog computer
An analog computer or analogue computer is a type of computation machine (computer) that uses the continuous variation aspect of physical phenomena such as electrical, mechanical, or hydraulic quantities (analog signals) to model the problem being solved.
See Multiplication algorithm and Analog computer
Analog signal
An analog signal is any continuous-time signal representing some other quantity, i.e., analogous to another quantity.
See Multiplication algorithm and Analog signal
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 mathematician working in the field of analytic number theory, ''p''-adic numbers and Dirichlet series.
See Multiplication algorithm and Anatoly Karatsuba
Ancient history
Ancient history is a time period from the beginning of writing and recorded human history through late antiquity.
See Multiplication algorithm and Ancient history
Annals of Mathematics
The Annals of Mathematics is a mathematical journal published every two months by Princeton University and the Institute for Advanced Study.
See Multiplication algorithm and Annals of Mathematics
Arbitrary-precision arithmetic
In computer science, arbitrary-precision arithmetic, also called bignum arithmetic, multiple-precision arithmetic, or sometimes infinite-precision arithmetic, indicates that calculations are performed on numbers whose digits of precision are potentially limited only by the available memory of the host system. Multiplication algorithm and arbitrary-precision arithmetic are computer arithmetic algorithms.
See Multiplication algorithm and Arbitrary-precision arithmetic
Arnold Schönhage
Arnold Schönhage (born 1 December 1934 in Lockhausen, now Bad Salzuflen) is a German mathematician and computer scientist.
See Multiplication algorithm and Arnold Schönhage
Avoirdupois
Avoirdupois (abbreviated avdp.) is a measurement system of weights that uses pounds and ounces as units.
See Multiplication algorithm and Avoirdupois
£sd
Rochester illustrates the conversion between pence and shillings and shillings and pounds. Old till in Ireland, with "shortcut" keys in various £sd denominations (lower numbers) and their "new pence" equivalent (upper numbers) Toy coin, which teaches children the value of a shilling £sd (occasionally written Lsd), spoken as "pounds, shillings and pence", is the popular name for the pre-decimal currencies once common throughout Europe.
See Multiplication algorithm and £sd
Babylonian mathematics
Babylonian mathematics (also known as Assyro-Babylonian mathematics) is the mathematics developed or practiced by the people of Mesopotamia, as attested by sources mainly surviving from the Old Babylonian period (1830–1531 BC) to the Seleucid from the last three or four centuries BC.
See Multiplication algorithm and Babylonian mathematics
BBC News
BBC News is an operational business division of the British Broadcasting Corporation (BBC) responsible for the gathering and broadcasting of news and current affairs in the UK and around the world.
See Multiplication algorithm and BBC News
Big O notation
Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity.
See Multiplication algorithm and Big O notation
Binary decision diagram
In computer science, a binary decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function.
See Multiplication algorithm and Binary decision diagram
Binary multiplier
A binary multiplier is an electronic circuit used in digital electronics, such as a computer, to multiply two binary numbers. Multiplication algorithm and binary multiplier are multiplication.
See Multiplication algorithm and Binary multiplier
Bitwise operation
In computer programming, a bitwise operation operates on a bit string, a bit array or a binary numeral (considered as a bit string) at the level of its individual bits.
See Multiplication algorithm and Bitwise operation
Booth's multiplication algorithm
Booth's multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation. Multiplication algorithm and Booth's multiplication algorithm are computer arithmetic algorithms and multiplication.
See Multiplication algorithm and Booth's multiplication algorithm
Casino chip
Casino chips (also known as poker chips, gaming tokens, or checks/cheques) are small discs used as currency in casinos.
See Multiplication algorithm and Casino chip
Charles Babbage
Charles Babbage (26 December 1791 – 18 October 1871) was an English polymath.
See Multiplication algorithm and Charles Babbage
Complex number
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted, called the imaginary unit and satisfying the equation i^.
See Multiplication algorithm and Complex number
Computational complexity
In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it.
See Multiplication algorithm and Computational complexity
Computer hardware
Computer hardware includes the physical parts of a computer, such as the central processing unit (CPU), random access memory (RAM), motherboard, computer data storage, graphics card, sound card, and computer case.
See Multiplication algorithm and Computer hardware
Conjecture
In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof.
See Multiplication algorithm and Conjecture
Dadda multiplier
The Dadda multiplier is a hardware binary multiplier design invented by computer scientist Luigi Dadda in 1965. Multiplication algorithm and Dadda multiplier are multiplication.
See Multiplication algorithm and Dadda multiplier
Digital data
Digital data, in information theory and information systems, is information represented as a string of discrete symbols, each of which can take on one of only a finite number of values from some alphabet, such as letters or digits.
See Multiplication algorithm and Digital data
Discrete Fourier transform over a ring
In mathematics, the discrete Fourier transform over a ring generalizes the discrete Fourier transform (DFT), of a function whose values are commonly complex numbers, over an arbitrary ring.
See Multiplication algorithm and Discrete Fourier transform over a ring
Distributive property
In mathematics, the distributive property of binary operations is a generalization of the distributive law, which asserts that the equality x \cdot (y + z).
See Multiplication algorithm and Distributive property
Division algorithm
A division algorithm is an algorithm which, given two integers N and D (respectively the numerator and the denominator), computes their quotient and/or remainder, the result of Euclidean division. Multiplication algorithm and division algorithm are computer arithmetic algorithms.
See Multiplication algorithm and Division algorithm
Enderûn
(اندرون, from Persian) was the term used in the Ottoman Empire to designate the "Inner Service" of the imperial court, concerned with the private service of the Ottoman sultans, as opposed to the state-administrative "Outer Service".
See Multiplication algorithm and Enderûn
Fast Fourier transform
A fast Fourier transform (FFT) is an algorithm that computes the Discrete Fourier Transform (DFT) of a sequence, or its inverse (IDFT).
See Multiplication algorithm and Fast Fourier transform
Fermat number
In mathematics, a Fermat number, named after Pierre de Fermat, the first known to have studied them, is a positive integer of the form:F_.
See Multiplication algorithm and Fermat number
Fibonacci
Fibonacci (also,; –) was an Italian mathematician from the Republic of Pisa, considered to be "the most talented Western mathematician of the Middle Ages".
See Multiplication algorithm and Fibonacci
Floating-point unit
A floating-point unit (FPU, colloquially a math coprocessor) is a part of a computer system specially designed to carry out operations on floating-point numbers.
See Multiplication algorithm and Floating-point unit
Floor and ceiling functions
In mathematics, the floor function is the function that takes as input a real number, and gives as output the greatest integer less than or equal to, denoted or.
See Multiplication algorithm and Floor and ceiling functions
Fourier transform
In physics, engineering and mathematics, the Fourier transform (FT) is an integral transform that takes a function as input and outputs another function that describes the extent to which various frequencies are present in the original function.
See Multiplication algorithm and Fourier transform
Germany
Germany, officially the Federal Republic of Germany (FRG), is a country in Central Europe.
See Multiplication algorithm and Germany
Grid method multiplication
The grid method (also known as the box method) of multiplication is an introductory approach to multi-digit multiplication calculations that involve numbers larger than ten. Multiplication algorithm and grid method multiplication are multiplication.
See Multiplication algorithm and Grid method multiplication
Horner's method
In mathematics and computer science, Horner's method (or Horner's scheme) is an algorithm for polynomial evaluation.
See Multiplication algorithm and Horner's method
Integrated circuit
An integrated circuit (IC), also known as a microchip, computer chip, or simply chip, is a small electronic device made up of multiple interconnected electronic components such as transistors, resistors, and capacitors.
See Multiplication algorithm and Integrated circuit
Iterated logarithm
In computer science, the iterated logarithm of n, written n (usually read "log star"), is the number of times the logarithm function must be iteratively applied before the result is less than or equal to 1.
See Multiplication algorithm and Iterated logarithm
Joris van der Hoeven
Joris van der Hoeven (born 1971) is a Dutch mathematician and computer scientist, specializing in algebraic analysis and computer algebra.
See Multiplication algorithm and Joris van der Hoeven
Karatsuba algorithm
The Karatsuba algorithm is a fast multiplication algorithm. Multiplication algorithm and Karatsuba algorithm are computer arithmetic algorithms and multiplication.
See Multiplication algorithm and Karatsuba algorithm
Kronecker substitution
Kronecker substitution is a technique named after Leopold Kronecker for determining the coefficients of an unknown polynomial by evaluating it at a single value.
See Multiplication algorithm and Kronecker substitution
Lattice multiplication
Lattice multiplication, also known as the Italian method, Chinese method, Chinese lattice, gelosia multiplication, sieve multiplication, shabakh, diagonally or Venetian squares, is a method of multiplication that uses a lattice to multiply two multi-digit numbers. Multiplication algorithm and lattice multiplication are multiplication.
See Multiplication algorithm and Lattice multiplication
Liber Abaci
The or Liber Abbaci (Latin for "The Book of Calculation") was a 1202 Latin work on arithmetic by Leonardo of Pisa, posthumously known as Fibonacci.
See Multiplication algorithm and Liber Abaci
Linear map
In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping V \to W between two vector spaces that preserves the operations of vector addition and scalar multiplication.
See Multiplication algorithm and Linear map
Linköping University
Linköping University (LiU) is a public research university based in Linköping, Sweden.
See Multiplication algorithm and Linköping University
Logarithm
In mathematics, the logarithm is the inverse function to exponentiation.
See Multiplication algorithm and Logarithm
Martin Fürer
Martin Fürer is a Swiss Computer Scientist and a professor of Computer Science at Pennsylvania State University.
See Multiplication algorithm and Martin Fürer
Mathematics of Computation
Mathematics of Computation is a bimonthly mathematics journal focused on computational mathematics.
See Multiplication algorithm and Mathematics of Computation
Matrakçı Nasuh
Nasuh bin Karagöz bin Abdullah el-Visokavi el-Bosnavî, commonly known as Matrakçı Nasuh for his competence in the combat sport of Matrak which was invented by himself, (also known as Nasuh el-Silâhî, Nasuh the Swordsman, because of his talent with weapons; 1480 – 1564) was a 16th-century Ottoman Bosnian statesman of the Ottoman Empire, polymath, mathematician, philosopher, teacher, historian, geographer, cartographer, swordmaster, navigator, inventor, painter, farmer, and miniaturist.
See Multiplication algorithm and Matrakçı Nasuh
Mental calculation
Mental calculation consists of arithmetical calculations using only the human brain, with no help from any supplies (such as pencil and paper) or devices such as a calculator.
See Multiplication algorithm and Mental calculation
Mersenne prime
In mathematics, a Mersenne prime is a prime number that is one less than a power of two.
See Multiplication algorithm and Mersenne prime
Microcode
In processor design, microcode serves as an intermediary layer situated between the central processing unit (CPU) hardware and the programmer-visible instruction set architecture of a computer, also known as its machine code.
See Multiplication algorithm and Microcode
Minkowski's theorem
In mathematics, Minkowski's theorem is the statement that every convex set in \mathbb^n which is symmetric with respect to the origin and which has volume greater than 2^n contains a non-zero integer point (meaning a point in \Z^n that is not the origin).
See Multiplication algorithm and Minkowski's theorem
Modular arithmetic
In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus.
See Multiplication algorithm and Modular arithmetic
MOS Technology 6502
The MOS Technology 6502 (typically pronounced "sixty-five-oh-two") William Mensch and the moderator both pronounce the 6502 microprocessor as "sixty-five-oh-two".
See Multiplication algorithm and MOS Technology 6502
Multiplication
Multiplication (often denoted by the cross symbol, by the mid-line dot operator, by juxtaposition, or, on computers, by an asterisk) is one of the four elementary mathematical operations of arithmetic, with the other ones being addition, subtraction, and division.
See Multiplication algorithm and Multiplication
Multiplication table
In mathematics, a multiplication table (sometimes, less formally, a times table) is a mathematical table used to define a multiplication operation for an algebraic system. Multiplication algorithm and multiplication table are multiplication.
See Multiplication algorithm and Multiplication table
Napier's bones
Napier's bones is a manually-operated calculating device created by John Napier of Merchiston, Scotland for the calculation of products and quotients of numbers. Multiplication algorithm and Napier's bones are multiplication.
See Multiplication algorithm and Napier's bones
Numeral system
A numeral system is a writing system for expressing numbers; that is, a mathematical notation for representing numbers of a given set, using digits or other symbols in a consistent manner.
See Multiplication algorithm and Numeral system
Operational amplifier
An operational amplifier (often op amp or opamp) is a DC-coupled electronic voltage amplifier with a differential input, a (usually) single-ended output, and an extremely high gain.
See Multiplication algorithm and Operational amplifier
Pearson Education
Pearson Education, known since 2011 as simply Pearson, is the educational publishing and services subsidiary of the international corporation Pearson plc.
See Multiplication algorithm and Pearson Education
Piecewise linear function
In mathematics, a piecewise linear or segmented function is a real-valued function of a real variable, whose graph is composed of straight-line segments.
See Multiplication algorithm and Piecewise linear function
Polynomial
In mathematics, a polynomial is a mathematical expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication and exponentiation to nonnegative integer powers, and has a finite number of terms.
See Multiplication algorithm and Polynomial
Primary school
A primary school (in Ireland, India, the United Kingdom, Australia, New Zealand, Trinidad and Tobago, Jamaica, South Africa, and Singapore), elementary school, or grade school (in North America and the Philippines) is a school for primary education of children who are 4 to 10 years of age (and in many cases, 11 years of age).
See Multiplication algorithm and Primary school
Prosthaphaeresis
Prosthaphaeresis (from the Greek προσθαφαίρεσις) was an algorithm used in the late 16th century and early 17th century for approximate multiplication and division using formulas from trigonometry.
See Multiplication algorithm and Prosthaphaeresis
Recursion
Recursion occurs when the definition of a concept or process depends on a simpler or previous version of itself.
See Multiplication algorithm and Recursion
Schönhage–Strassen algorithm
The Schönhage–Strassen algorithm is an asymptotically fast multiplication algorithm for large integers, published by Arnold Schönhage and Volker Strassen in 1971. Multiplication algorithm and Schönhage–Strassen algorithm are computer arithmetic algorithms and multiplication.
See Multiplication algorithm and Schönhage–Strassen algorithm
Slide rule
A slide rule is a hand-operated mechanical calculator consisting of slidable rulers for evaluating mathematical operations such as multiplication, division, exponents, roots, logarithms, and trigonometry.
See Multiplication algorithm and Slide rule
Theoretical computer science
Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation.
See Multiplication algorithm and Theoretical computer science
Time complexity
In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm.
See Multiplication algorithm and Time complexity
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. Multiplication algorithm and Toom–Cook multiplication are computer arithmetic algorithms and multiplication.
See Multiplication algorithm and Toom–Cook multiplication
Trachtenberg system
The Trachtenberg system is a system of rapid mental calculation.
See Multiplication algorithm and Trachtenberg system
Twiddle factor
A twiddle factor, in fast Fourier transform (FFT) algorithms, is any of the trigonometric constant coefficients that are multiplied by the data in the course of the algorithm.
See Multiplication algorithm and Twiddle factor
Volker Strassen
Volker Strassen (born April 29, 1936) is a German mathematician, a professor emeritus in the department of mathematics and statistics at the University of Konstanz.
See Multiplication algorithm and Volker Strassen
Voltage
Voltage, also known as (electrical) potential difference, electric pressure, or electric tension is the difference in electric potential between two points.
See Multiplication algorithm and Voltage
Wallace tree
A Wallace multiplier is a hardware implementation of a binary multiplier, a digital circuit that multiplies two integers. Multiplication algorithm and Wallace tree are multiplication.
See Multiplication algorithm and Wallace tree
See also
Computer arithmetic algorithms
- Addition-chain exponentiation
- Arbitrary-precision arithmetic
- Binary splitting
- Booth's multiplication algorithm
- Computational complexity of mathematical operations
- Computational complexity of matrix multiplication
- Division algorithm
- Exponentiation by squaring
- FEE method
- Karatsuba algorithm
- Knuth's Simpath algorithm
- Long division
- MPIR (mathematics software)
- Methods of computing square roots
- Multiplication algorithm
- Schönhage–Strassen algorithm
- Spigot algorithm
- Spouge's approximation
- The Art of Computer Programming
- Toom–Cook multiplication
Multiplication
- A. W. Faber Model 366
- Ancient Egyptian multiplication
- Binary multiplier
- Booth's multiplication algorithm
- Carry-less product
- Dadda multiplier
- Elementary arithmetic
- Empty product
- FOIL method
- Frobenius inner product
- Genaille–Lucas rulers
- Grid method multiplication
- Infinite product
- Irish logarithm
- Karatsuba algorithm
- Lattice multiplication
- Lunar arithmetic
- Matrix multiplication
- Moment (physics)
- Multiple (mathematics)
- Multiplication
- Multiplication algorithm
- Multiplication sign
- Multiplication table
- Multiplicative functions
- Multiplicative group of integers modulo n
- Multiplicative inverse
- Napier's bones
- Parallel (operator)
- Product (mathematics)
- Product integral
- Promptuary
- Scalar multiplication
- Schönhage–Strassen algorithm
- Skip counting
- Slonimski's Theorem
- Toom–Cook multiplication
- Tsinghua Bamboo Slips
- Vector multiplication
- Wallace tree
References
Also known as Computational complexity of multiplication, FFT multiplication, Fast multiplication, Fürer's algorithm, Fürer algorithm, Fürer multiplication, Harvey-Hoeven algorithm, Integer multiplication algorithm, Long multiplication, Multiplication algorithms, Multiplication algorthim, Shift and add algorithm, Shift-and-add algorithm, Signed digit multiplication, Signed-digit multiplication.