Computing Atlas

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

Iterative proportional fitting

Numerical Algorithm

Iterative proportional fitting finds the matrix closest to a given starting matrix whose row and column totals match those of a target matrix. The fitted matrix has the form of the initial matrix scaled by diagonal matrices on each side. The usual procedure scales the rows to match the required row totals, then scales the columns to match the column totals; each step disturbs the match made by the previous one, so the two steps are repeated in cycles until the specified totals are satisfactorily approximated. With three or more dimensions, the margins of each dimension are adjusted in turn. The method goes by many names: biproportional fitting, the RAS algorithm in economics, raking in survey statistics and matrix scaling in computer science. It has been reinvented many times, first by Kruithof in 1937 for telephone traffic and by Deming and Stephan in 1940 for census cross-tabulations. It is applied to survey weighting, trip distribution in transportation planning and input-output models in economics.

Connections

In Field

Source Iterative proportional fitting (Wikipedia)

Uses Design Technique

Source Iterative proportional fitting (Wikipedia)
Sources
Iterative proportional fitting (Wikipedia)
  • In Group: Linear Algebra and Matrix Decomposition, Lead
    is the operation of finding the fitted matrix
  • In Field: Computational Science, Lead
    is the operation of finding the fitted matrix
  • Uses Design Technique: Iterative Refinement, Lead [design-technique-used]
    so these steps are repeated in cycles, re-adjusting the rows and columns in turn
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.