Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Lattice multiplication

Numerical Algorithm

Lattice multiplication is a pencil-and-paper method for multiplying two multi-digit numbers using a grid. It is also called the Italian method, the Chinese method, gelosia multiplication, sieve multiplication and shabakh, among other names. A grid is drawn with one column for each digit of the first number and one row for each digit of the second, and each cell is split by a diagonal. Every cell receives the product of its column digit and row digit, with the tens digit above the diagonal and the units digit below. The digits along each diagonal are then added from the bottom right, carrying into the next diagonal, and the answer is read off the left and bottom edges. In the worked example, 58 times 213 gives 12354. The method is mathematically identical to long multiplication but splits the work into smaller steps, which some people find easier. It had arisen by medieval times, appears in Indian, Arabic and Italian sources, and is still taught in some curricula.

Connections

In Field

Source Lattice multiplication (Wikipedia)
Sources
Lattice multiplication (Wikipedia)
  • In Group: Number Theory and Primality, Lead paragraph
    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.
  • In Field: Algorithms and Complexity Theory, Lead paragraph
    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.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.