ArticleslgStudy

mathematics

Inverse distance weighting

Inverse distance weighting is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Inverse distance weighting rather than just read about it. In short: Inverse distance weighting (IDW) is a type of deterministic method for multivariate interpolation with a known homogeneously scattered set of points. The assigned values to unknown points are calculated with a weighted average of the values available at the known points.

Inverse distance weighting — main illustration
Inverse distance weighting — illustration

Key takeaways

  • Inverse distance weighting belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Inverse distance weighting to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Inverse distance weighting from memory before moving on to harder problems.

Reference excerpt

Inverse distance weighting (IDW) is a type of deterministic method for multivariate interpolation with a known homogeneously scattered set of points. The assigned values to unknown points are calculated with a weighted average of the values available at the known points. This method can also be used to create spatial weights matrices in spatial autocorrelation analyses (e.g. Moran's I). The name given to this type of method was motivated by the weighted average applied, since it resorts to the inverse of the distance to each known point ("amount of proximity") when assigning weights.

Definition of the problem The expected result is a discrete assignment of the unknown function u {\displaystyle u} in a study region:

u ( x ) : x → R , x ∈ D ⊂ R n , {\displaystyle u(x):x\to \mathbb {R} ,\quad x\in \mathbf {D} \subset \mathbb {R} ^{n},}

where D {\displaystyle \mathbf {D} } is the study region. The set of N {\displaystyle N} known data points can be described as a list of tuples:

[ ( x 1 , u 1 ) , ( x 2 , u 2 ) , . . . , ( x N , u N ) ] . {\displaystyle [(x_{1},u_{1}),(x_{2},u_{2}),...,(x_{N},u_{N})].}

The function is to be "smooth" (continuous and once differentiable), to be exact ( u ( x i ) = u i {\displaystyle u(x_{i})=u_{i}} ) and to meet the user's intuitive expectations about the phenomenon under investigation. Furthermore, the function should be suitable for a computer application at a reasonable cost (nowadays, a basic implementation will probably make use of parallel resources).

Shepard's method

Historical reference At the Harvard Laboratory for Computer Graphics and Spatial Analysis, beginning in 1964, a varied collection of scientists converged to rethink, among other things, what are now called geographic information systems. The motive force behind the Laboratory, Howard Fisher, conceived an improved computer mapping program that he called SYMAP, which, from the start, Fisher wanted to improve on the interpolation. He showed Harvard College freshmen his work on SYMAP, and many of them participated in Laboratory events. One freshman, Donald Shepard, decided to overhaul the interpolation in SYMAP, resulting in his famous article from 1968. Shepard's algorithm was also influenced by the theoretical approach of William Warntz and others at the Lab who worked with spatial analysis. He conducted a number of experiments with the exponent of distance, deciding on something closer to the gravity model (exponent of -2). Shepard implemented not just basic inverse distance weighting, but also allowed barriers (permeable and absolute) to interpolation. Other research centers were working on interpolation at this time, particularly University of Kansas and their SURFACE II program. Still, the features of SYMAP were state-of-the-art, even though programmed by an undergraduate.

Basic form

Given a set of sample points { x i , u i | for x i ∈ R n , u i ∈ R } i = 1 N {\displaystyle \{\mathbf {x} _{i},u_{i}|{\text{for }}\mathbf {x} _{i}\in \mathbb {R} ^{n},u_{i}\in \mathbb {R} \}_{i=1}^{N}} , the IDW interpolation function u ( x ) : R n → R {\displaystyle u(\mathbf {x} ):\mathbb {R} ^{n}\to \mathbb {R} } is defined as:

… excerpt ends here. Continue reading the full article.

Illustrations

Inverse distance weighting: Inverse Distance Weighting as a sum of all weighting functions for each sample point. Each function has the value of one of the samples at its sample point and zero at every other sample point.
Inverse Distance Weighting as a sum of all weighting functions for each sample point. Each function has the value of one of the samples at its sample point and zero at every other sample point.
Inverse distance weighting: Shepard's interpolation for different power parameters p, from scattered points on the surface 
  
    
      
        z
        =
        exp
        ⁡
        (
        −
        
          x
          
            2
          
        
        −
        
          y
          
            2
          
        
        )
      
    
    {\displaystyle z=\exp(-x^{2}-y^{2})}
Shepard's interpolation for different power parameters p, from scattered points on the surface z = exp ⁡ ( − x 2 − y 2 ) {\displaystyle z=\exp(-x^{2}-y^{2})}
Inverse distance weighting: Shepard's interpolation in 1 dimension, from 4 scattered points and using p = 2
Shepard's interpolation in 1 dimension, from 4 scattered points and using p = 2

Worked examples

Example 1 — a first encounter with Inverse distance weighting

Start with the simplest possible case. Write down what Inverse distance weighting claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Inverse distance weighting before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Inverse distance weighting ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Inverse distance weighting

In research
Inverse distance weighting appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Inverse distance weighting in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Inverse distance weighting is common in secondary-school and first-year university syllabi. It links to neighbouring topics Geostatistics, Multivariate interpolation, so understanding it makes those chapters shorter.
In everyday life
Look for Inverse distance weighting outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Inverse distance weighting” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Inverse distance weighting in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Inverse distance weighting means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Inverse distance weighting out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Inverse distance weighting in simple terms?

Inverse distance weighting (IDW) is a type of deterministic method for multivariate interpolation with a known homogeneously scattered set of points. The assigned values to unknown points are calculated with a weighted average of the values available at the known points.

Why does Inverse distance weighting matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Inverse distance weighting?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Inverse distance weighting.

Tags

  • Geostatistics
  • Multivariate interpolation

Keep exploring