Propagation of uncertainty

From HandWiki
Short description: Effect of variables' uncertainties on the uncertainty of a function based on them

In statistics, propagation of uncertainty (or propagation of error) is the effect of variables' uncertainties (or errors, more specifically random errors) on the uncertainty of a function based on them. When the variables are the values of experimental measurements they have uncertainties due to measurement limitations (e.g., instrument precision) which propagate due to the combination of variables in the function.

The uncertainty u can be expressed in a number of ways. It may be defined by the absolute error Δx. Uncertainties can also be defined by the relative error x)/x, which is usually written as a percentage. Most commonly, the uncertainty on a quantity is quantified in terms of the standard deviation, σ, which is the positive square root of the variance. The value of a quantity and its error are then expressed as an interval x ± u. However, the most general way of characterizing uncertainty is by specifying its probability distribution. If the probability distribution of the variable is known or can be assumed, in theory it is possible to get any of its statistics. In particular, it is possible to derive confidence limits to describe the region within which the true value of the variable may be found. For example, the 68% confidence limits for a one-dimensional variable belonging to a normal distribution are approximately ± one standard deviation σ from the central value x, which means that the region x ± σ will cover the true value in roughly 68% of cases.

If the uncertainties are correlated then covariance must be taken into account. Correlation can arise from two different sources. First, the measurement errors may be correlated. Second, when the underlying values are correlated across a population, the uncertainties in the group averages will be correlated.[1]

In a general context where a nonlinear function modifies the uncertain parameters (correlated or not), the standard tools to propagate uncertainty, and infer resulting quantity probability distribution/statistics, are sampling techniques from the Monte Carlo method family.[2] For very expansive data or complex functions, the calculation of the error propagation may be very expansive so that a surrogate model[3] or a parallel computing strategy[4][5][6] may be necessary.

In some particular cases, the uncertainty propagation calculation can be done through simplistic algebraic procedures. Some of these scenarios are described below.

Linear combinations

Let [math]\displaystyle{ \{f_k(x_1, x_2, \dots, x_n)\} }[/math] be a set of m functions, which are linear combinations of [math]\displaystyle{ n }[/math] variables [math]\displaystyle{ x_1, x_2, \dots, x_n }[/math] with combination coefficients [math]\displaystyle{ A_{k1}, A_{k2}, \dots,A_{kn}, (k = 1, \dots, m) }[/math]: [math]\displaystyle{ f_k = \sum_{i=1}^n A_{ki} x_i, }[/math] or in matrix notation, [math]\displaystyle{ \mathbf{f} = \mathbf{A} \mathbf{x}. }[/math]

Also let the variance–covariance matrix of x = (x1, ..., xn) be denoted by [math]\displaystyle{ \boldsymbol\Sigma^x }[/math] and let the mean value be denoted by [math]\displaystyle{ \boldsymbol{\mu} }[/math]: [math]\displaystyle{ \boldsymbol\Sigma^x = E[(\mathbf{x}-\boldsymbol\mu)\otimes (\mathbf{x}-\boldsymbol\mu)]= \begin{pmatrix} \sigma^2_1 & \sigma_{12} & \sigma_{13} & \cdots \\ \sigma_{21} & \sigma^2_2 & \sigma_{23} & \cdots\\ \sigma_{31} & \sigma_{32} & \sigma^2_3 & \cdots \\ \vdots & \vdots & \vdots & \ddots \end{pmatrix} = \begin{pmatrix} {\Sigma}^x_{11} & {\Sigma}^x_{12} & {\Sigma}^x_{13} & \cdots \\ {\Sigma}^x_{21} & {\Sigma}^x_{22} & {\Sigma}^x_{23} & \cdots\\ {\Sigma}^x_{31} & {\Sigma}^x_{32} & {\Sigma}^x_{33} & \cdots \\ \vdots & \vdots & \vdots & \ddots \end{pmatrix}. }[/math] [math]\displaystyle{ \otimes }[/math] is the outer product.

Then, the variance–covariance matrix [math]\displaystyle{ \boldsymbol\Sigma^f }[/math] of f is given by [math]\displaystyle{ \boldsymbol\Sigma^f = E[(\mathbf{f} - E[\mathbf{f}]) \otimes (\mathbf{f} - E[\mathbf{f}])] = E[\mathbf{A}(\mathbf{x}-\boldsymbol\mu) \otimes \mathbf{A}(\mathbf{x}-\boldsymbol\mu)] = \mathbf{A} E[(\mathbf{x}-\boldsymbol\mu) \otimes (\mathbf{x}-\boldsymbol\mu)]\mathbf{A}^\mathrm{T} = \mathbf{A} \boldsymbol\Sigma^x \mathbf{A}^\mathrm{T}. }[/math]

In component notation, the equation [math]\displaystyle{ \boldsymbol\Sigma^f = \mathbf{A} \boldsymbol\Sigma^x \mathbf{A}^\mathrm{T} }[/math] reads [math]\displaystyle{ \Sigma^f_{ij} = \sum_k^n \sum_l^n A_{ik} {\Sigma}^x_{kl} A_{jl}. }[/math]

This is the most general expression for the propagation of error from one set of variables onto another. When the errors on x are uncorrelated, the general expression simplifies to [math]\displaystyle{ \Sigma^f_{ij} = \sum_k^n A_{ik} \Sigma^x_k A_{jk}, }[/math] where [math]\displaystyle{ \Sigma^x_k = \sigma^2_{x_k} }[/math] is the variance of k-th element of the x vector. Note that even though the errors on x may be uncorrelated, the errors on f are in general correlated; in other words, even if [math]\displaystyle{ \boldsymbol\Sigma^x }[/math] is a diagonal matrix, [math]\displaystyle{ \boldsymbol\Sigma^f }[/math] is in general a full matrix.

The general expressions for a scalar-valued function f are a little simpler (here a is a row vector): [math]\displaystyle{ f = \sum_i^n a_i x_i = \mathbf{a x}, }[/math] [math]\displaystyle{ \sigma^2_f = \sum_i^n \sum_j^n a_i \Sigma^x_{ij} a_j = \mathbf{a} \boldsymbol\Sigma^x \mathbf{a}^\mathrm{T}. }[/math]

Each covariance term [math]\displaystyle{ \sigma_{ij} }[/math] can be expressed in terms of the correlation coefficient [math]\displaystyle{ \rho_{ij} }[/math] by [math]\displaystyle{ \sigma_{ij} = \rho_{ij} \sigma_i \sigma_j }[/math], so that an alternative expression for the variance of f is [math]\displaystyle{ \sigma^2_f = \sum_i^n a_i^2 \sigma^2_i + \sum_i^n \sum_{j (j \ne i)}^n a_i a_j \rho_{ij} \sigma_i \sigma_j. }[/math]

In the case that the variables in x are uncorrelated, this simplifies further to [math]\displaystyle{ \sigma^2_f = \sum_i^n a_i^2 \sigma^2_i. }[/math]

In the simple case of identical coefficients and variances, we find [math]\displaystyle{ \sigma_f = \sqrt{n}\, |a| \sigma. }[/math]

For the arithmetic mean, [math]\displaystyle{ a=1/n }[/math], the result is the standard error of the mean: [math]\displaystyle{ \sigma_f = \frac{\sigma} {\sqrt{n}}. }[/math]

Non-linear combinations

When f is a set of non-linear combination of the variables x, an interval propagation could be performed in order to compute intervals which contain all consistent values for the variables. In a probabilistic approach, the function f must usually be linearised by approximation to a first-order Taylor series expansion, though in some cases, exact formulae can be derived that do not depend on the expansion as is the case for the exact variance of products.[7] The Taylor expansion would be: [math]\displaystyle{ f_k \approx f^0_k+ \sum_i^n \frac{\partial f_k}{\partial {x_i}} x_i }[/math] where [math]\displaystyle{ \partial f_k/\partial x_i }[/math] denotes the partial derivative of fk with respect to the i-th variable, evaluated at the mean value of all components of vector x. Or in matrix notation, [math]\displaystyle{ \mathrm{f} \approx \mathrm{f}^0 + \mathrm{J} \mathrm{x}\, }[/math] where J is the Jacobian matrix. Since f0 is a constant it does not contribute to the error on f. Therefore, the propagation of error follows the linear case, above, but replacing the linear coefficients, Aki and Akj by the partial derivatives, [math]\displaystyle{ \frac{\partial f_k}{\partial x_i} }[/math] and [math]\displaystyle{ \frac{\partial f_k}{\partial x_j} }[/math]. In matrix notation,[8] [math]\displaystyle{ \mathrm{\Sigma}^\mathrm{f} = \mathrm{J} \mathrm{\Sigma}^\mathrm{x} \mathrm{J}^\top. }[/math]

That is, the Jacobian of the function is used to transform the rows and columns of the variance-covariance matrix of the argument. Note this is equivalent to the matrix expression for the linear case with [math]\displaystyle{ \mathrm{J = A} }[/math].


Neglecting correlations or assuming independent variables yields a common formula among engineers and experimental scientists to calculate error propagation, the variance formula:[9] [math]\displaystyle{ s_f = \sqrt{ \left(\frac{\partial f}{\partial x}\right)^2 s_x^2 + \left(\frac{\partial f}{\partial y} \right)^2 s_y^2 + \left(\frac{\partial f}{\partial z} \right)^2 s_z^2 + \cdots} }[/math] where [math]\displaystyle{ s_f }[/math] represents the standard deviation of the function [math]\displaystyle{ f }[/math], [math]\displaystyle{ s_x }[/math] represents the standard deviation of [math]\displaystyle{ x }[/math], [math]\displaystyle{ s_y }[/math] represents the standard deviation of [math]\displaystyle{ y }[/math], and so forth.

It is important to note that this formula is based on the linear characteristics of the gradient of [math]\displaystyle{ f }[/math] and therefore it is a good estimation for the standard deviation of [math]\displaystyle{ f }[/math] as long as [math]\displaystyle{ s_x, s_y, s_z,\ldots }[/math] are small enough. Specifically, the linear approximation of [math]\displaystyle{ f }[/math] has to be close to [math]\displaystyle{ f }[/math] inside a neighbourhood of radius [math]\displaystyle{ s_x, s_y, s_z,\ldots }[/math].[10]


Any non-linear differentiable function, [math]\displaystyle{ f(a,b) }[/math], of two variables, [math]\displaystyle{ a }[/math] and [math]\displaystyle{ b }[/math], can be expanded as [math]\displaystyle{ f\approx f^0+\frac{\partial f}{\partial a}a+\frac{\partial f}{\partial b}b }[/math] now, taking variance on both sides, and using the formula[11] for variance of a linear combination of variables: [math]\displaystyle{ \operatorname{Var}(aX + bY) = a^2\operatorname{Var}(X) + b^2\operatorname{Var}(Y) + 2ab \operatorname{Cov}(X, Y) }[/math]

hence: [math]\displaystyle{ \sigma^2_f\approx\left| \frac{\partial f}{\partial a}\right| ^2\sigma^2_a+\left| \frac{\partial f}{\partial b}\right|^2\sigma^2_b+2\frac{\partial f}{\partial a}\frac{\partial f} {\partial b}\sigma_{ab} }[/math] where [math]\displaystyle{ \sigma_{f} }[/math] is the standard deviation of the function [math]\displaystyle{ f }[/math], [math]\displaystyle{ \sigma_{a} }[/math] is the standard deviation of [math]\displaystyle{ a }[/math], [math]\displaystyle{ \sigma_{b} }[/math] is the standard deviation of [math]\displaystyle{ b }[/math] and [math]\displaystyle{ \sigma_{ab} = \sigma_{a}\sigma_{b} \rho_{ab} }[/math] is the covariance between [math]\displaystyle{ a }[/math] and [math]\displaystyle{ b }[/math].

In the particular case that [math]\displaystyle{ f = ab }[/math], [math]\displaystyle{ \frac{\partial f}{\partial a} = b }[/math], [math]\displaystyle{ \frac{\partial f}{\partial b} = a }[/math]. Then [math]\displaystyle{ \sigma^2_f \approx b^2\sigma^2_a+a^2 \sigma_b^2+2ab\,\sigma_{ab} }[/math] or [math]\displaystyle{ \left(\frac{\sigma_f}{f}\right)^2 \approx \left(\frac{\sigma_a}{a} \right)^2 + \left(\frac{\sigma_b}{b}\right)^2 + 2\left(\frac{\sigma_a}{a}\right)\left(\frac{\sigma_b}{b}\right)\rho_{ab} }[/math] where [math]\displaystyle{ \rho_{ab} }[/math] is the correlation between [math]\displaystyle{ a }[/math] and [math]\displaystyle{ b }[/math].

When the variables [math]\displaystyle{ a }[/math] and [math]\displaystyle{ b }[/math] are uncorrelated, [math]\displaystyle{ \rho_{ab}=0 }[/math]. Then [math]\displaystyle{ \left(\frac{\sigma_f}{f}\right)^2 \approx \left(\frac{\sigma_a}{a} \right)^2 + \left(\frac{\sigma_b}{b}\right)^2. }[/math]

Caveats and warnings

Error estimates for non-linear functions are biased on account of using a truncated series expansion. The extent of this bias depends on the nature of the function. For example, the bias on the error calculated for log(1+x) increases as x increases, since the expansion to x is a good approximation only when x is near zero.

For highly non-linear functions, there exist five categories of probabilistic approaches for uncertainty propagation;[12] see Uncertainty quantification for details.

Reciprocal and shifted reciprocal

In the special case of the inverse or reciprocal [math]\displaystyle{ 1/B }[/math], where [math]\displaystyle{ B=N(0,1) }[/math] follows a standard normal distribution, the resulting distribution is a reciprocal standard normal distribution, and there is no definable variance.[13]

However, in the slightly more general case of a shifted reciprocal function [math]\displaystyle{ 1/(p-B) }[/math] for [math]\displaystyle{ B=N(\mu,\sigma) }[/math] following a general normal distribution, then mean and variance statistics do exist in a principal value sense, if the difference between the pole [math]\displaystyle{ p }[/math] and the mean [math]\displaystyle{ \mu }[/math] is real-valued.[14]


Ratios are also problematic; normal approximations exist under certain conditions.

Example formulae

This table shows the variances and standard deviations of simple functions of the real variables [math]\displaystyle{ A,B\! }[/math], with standard deviations [math]\displaystyle{ \sigma_A, \sigma_B,\, }[/math] covariance [math]\displaystyle{ \sigma_{AB}=\rho_{AB}\sigma_A\sigma_B\, }[/math], and correlation [math]\displaystyle{ \rho_{AB} }[/math]. The real-valued coefficients [math]\displaystyle{ a }[/math] and [math]\displaystyle{ b }[/math] are assumed exactly known (deterministic), i.e., [math]\displaystyle{ \sigma_a = \sigma_b = 0 }[/math].

In the right-hand columns of the table, [math]\displaystyle{ A }[/math] and [math]\displaystyle{ B }[/math] are expectation values and [math]\displaystyle{ f }[/math] is the value of the function calculated at those values.

Function Variance Standard Deviation
[math]\displaystyle{ f = aA\, }[/math] [math]\displaystyle{ \sigma_f^2 = a^2\sigma_A^2 }[/math] [math]\displaystyle{ \sigma_f = |a|\sigma_A }[/math]
[math]\displaystyle{ f = A + B\, }[/math] [math]\displaystyle{ \sigma_f^2 = \sigma_A^2 + \sigma_B^2 + 2\sigma_{AB} }[/math] [math]\displaystyle{ \sigma_f = \sqrt{\sigma_A^2 + \sigma_B^2 + 2\sigma_{AB}} }[/math]
[math]\displaystyle{ f = A - B\, }[/math] [math]\displaystyle{ \sigma_f^2 = \sigma_A^2 + \sigma_B^2 - 2\sigma_{AB} }[/math] [math]\displaystyle{ \sigma_f = \sqrt{\sigma_A^2 + \sigma_B^2 - 2\sigma_{AB}} }[/math]
[math]\displaystyle{ f = aA + bB\, }[/math] [math]\displaystyle{ \sigma_f^2 = a^2\sigma_A^2 + b^2\sigma_B^2 + 2ab\,\sigma_{AB} }[/math] [math]\displaystyle{ \sigma_f = \sqrt{a^2\sigma_A^2 + b^2\sigma_B^2 + 2ab\,\sigma_{AB}} }[/math]
[math]\displaystyle{ f = aA - bB\, }[/math] [math]\displaystyle{ \sigma_f^2 = a^2\sigma_A^2 + b^2\sigma_B^2 - 2ab\,\sigma_{AB} }[/math] [math]\displaystyle{ \sigma_f = \sqrt{a^2\sigma_A^2 + b^2\sigma_B^2 - 2ab\,\sigma_{AB}} }[/math]
[math]\displaystyle{ f = AB\, }[/math] [math]\displaystyle{ \sigma_f^2 \approx f^2 \left[\left(\frac{\sigma_A}{A}\right)^2 + \left(\frac{\sigma_B}{B}\right)^2 + 2\frac{\sigma_{AB}}{AB} \right] }[/math][15][16] [math]\displaystyle{ \sigma_f \approx \left| f \right| \sqrt{ \left(\frac{\sigma_A}{A}\right)^2 + \left(\frac{\sigma_B}{B}\right)^2 + 2\frac{\sigma_{AB}}{AB} } }[/math]
[math]\displaystyle{ f = \frac{A}{B}\, }[/math] [math]\displaystyle{ \sigma_f^2 \approx f^2 \left[\left(\frac{\sigma_A}{A}\right)^2 + \left(\frac{\sigma_B}{B}\right)^2 - 2\frac{\sigma_{AB}}{AB} \right] }[/math][17] [math]\displaystyle{ \sigma_f \approx \left| f \right| \sqrt{ \left(\frac{\sigma_A}{A}\right)^2 + \left(\frac{\sigma_B}{B}\right)^2 - 2\frac{\sigma_{AB}}{AB} } }[/math]
[math]\displaystyle{ f = \frac{A}{A+B}\, }[/math] [math]\displaystyle{ \sigma_f^2 \approx \frac{f^2}{\left(A+B\right)^2} \left(\frac{B^2}{A^2}\sigma_A^2 +\sigma_B^2 - 2\frac{B}{A} \sigma_{AB} \right) }[/math] [math]\displaystyle{ \sigma_f \approx \left|\frac{f}{A+B}\right| \sqrt{\frac{B^2}{A^2}\sigma_A^2 +\sigma_B^2 - 2\frac{B}{A} \sigma_{AB} } }[/math]
[math]\displaystyle{ f = a A^{b}\, }[/math] [math]\displaystyle{ \sigma_f^2 \approx \left( {a}{b}{A}^{b-1}{\sigma_A} \right)^2 = \left( \frac{{f}{b}{\sigma_A}}{A} \right)^2 }[/math] [math]\displaystyle{ \sigma_f \approx \left| {a}{b}{A}^{b-1}{\sigma_A} \right| = \left| \frac{{f}{b}{\sigma_A}}{A} \right| }[/math]
[math]\displaystyle{ f = a \ln(bA)\, }[/math] [math]\displaystyle{ \sigma_f^2 \approx \left(a \frac{\sigma_A}{A} \right)^2 }[/math][18] [math]\displaystyle{ \sigma_f \approx \left| a \frac{\sigma_A}{A}\right| }[/math]
[math]\displaystyle{ f = a \log_{10}(bA)\, }[/math] [math]\displaystyle{ \sigma_f^2 \approx \left(a \frac{\sigma_A}{A \ln(10)} \right)^2 }[/math][18] [math]\displaystyle{ \sigma_f \approx \left| a \frac{\sigma_A}{A \ln(10)} \right| }[/math]
[math]\displaystyle{ f = a e^{bA}\, }[/math] [math]\displaystyle{ \sigma_f^2 \approx f^2 \left( b\sigma_A \right)^2 }[/math][19] [math]\displaystyle{ \sigma_f \approx \left| f \right| \left| \left( b\sigma_A \right) \right| }[/math]
[math]\displaystyle{ f = a^{bA}\, }[/math] [math]\displaystyle{ \sigma_f^2 \approx f^2 (b\ln(a)\sigma_A)^2 }[/math] [math]\displaystyle{ \sigma_f \approx \left| f \right| \left| b \ln(a) \sigma_A \right| }[/math]
[math]\displaystyle{ f = a \sin(bA)\, }[/math] [math]\displaystyle{ \sigma_f^2 \approx \left[ a b \cos(b A) \sigma_A \right]^2 }[/math] [math]\displaystyle{ \sigma_f \approx \left| a b \cos(b A) \sigma_A \right| }[/math]
[math]\displaystyle{ f = a \cos \left( b A \right)\, }[/math] [math]\displaystyle{ \sigma_f^2 \approx \left[ a b \sin(b A) \sigma_A \right]^2 }[/math] [math]\displaystyle{ \sigma_f \approx \left| a b \sin(b A) \sigma_A \right| }[/math]
[math]\displaystyle{ f = a \tan \left( b A \right)\, }[/math] [math]\displaystyle{ \sigma_f^2 \approx \left[ a b \sec^2(b A) \sigma_A \right]^2 }[/math] [math]\displaystyle{ \sigma_f \approx \left| a b \sec^2(b A) \sigma_A \right| }[/math]
[math]\displaystyle{ f = A^B\, }[/math] [math]\displaystyle{ \sigma_f^2 \approx f^2 \left[ \left( \frac{B}{A}\sigma_A \right)^2 +\left( \ln(A)\sigma_B \right)^2 + 2 \frac{B \ln(A)}{A} \sigma_{AB} \right] }[/math] [math]\displaystyle{ \sigma_f \approx \left| f \right| \sqrt{ \left( \frac{B}{A}\sigma_A \right)^2 +\left( \ln(A)\sigma_B \right)^2 + 2 \frac{B \ln(A)}{A} \sigma_{AB} } }[/math]
[math]\displaystyle{ f = \sqrt{aA^2 \pm bB^2}\, }[/math] [math]\displaystyle{ \sigma_f^2 \approx \left(\frac{A}{f}\right)^2 a^2\sigma_A^2 + \left(\frac{B}{f}\right)^2 b^2\sigma_B^2 \pm 2ab\frac{AB}{f^2}\,\sigma_{AB} }[/math] [math]\displaystyle{ \sigma_f \approx \sqrt{\left(\frac{A}{f}\right)^2 a^2\sigma_A^2 + \left(\frac{B}{f}\right)^2 b^2\sigma_B^2 \pm 2ab\frac{AB}{f^2}\,\sigma_{AB}} }[/math]

For uncorrelated variables ([math]\displaystyle{ \rho_{AB}=0 }[/math], [math]\displaystyle{ \sigma_{AB}=0 }[/math]) expressions for more complicated functions can be derived by combining simpler functions. For example, repeated multiplication, assuming no correlation, gives [math]\displaystyle{ f = ABC; \qquad \left(\frac{\sigma_f}{f}\right)^2 \approx \left(\frac{\sigma_A}{A}\right)^2 + \left(\frac{\sigma_B}{B}\right)^2+ \left(\frac{\sigma_C}{C}\right)^2. }[/math]

For the case [math]\displaystyle{ f = AB }[/math] we also have Goodman's expression[7] for the exact variance: for the uncorrelated case it is [math]\displaystyle{ V(XY)= E(X)^2 V(Y) + E(Y)^2 V(X) + E((X-E(X))^2 (Y-E(Y))^2) }[/math] and therefore we have: [math]\displaystyle{ \sigma_f^2 = A^2\sigma_B^2 + B^2\sigma_A^2 + \sigma_A^2\sigma_B^2 }[/math]

Effect of correlation on differences

If A and B are uncorrelated, their difference A-B will have more variance than either of them. An increasing positive correlation ([math]\displaystyle{ \rho_{AB}\to 1 }[/math]) will decrease the variance of the difference, converging to zero variance for perfectly correlated variables with the same variance. On the other hand, a negative correlation ([math]\displaystyle{ \rho_{AB}\to -1 }[/math]) will further increase the variance of the difference, compared to the uncorrelated case.

For example, the self-subtraction f=A-A has zero variance [math]\displaystyle{ \sigma_f^2=0 }[/math] only if the variate is perfectly autocorrelated ([math]\displaystyle{ \rho_A=1 }[/math]). If A is uncorrelated, [math]\displaystyle{ \rho_A=0 }[/math], then the output variance is twice the input variance, [math]\displaystyle{ \sigma_f^2=2\sigma^2_A }[/math]. And if A is perfectly anticorrelated, [math]\displaystyle{ \rho_A=-1 }[/math], then the input variance is quadrupled in the output, [math]\displaystyle{ \sigma_f^2=4\sigma^2_A }[/math] (notice [math]\displaystyle{ 1-\rho_A=2 }[/math] for f = aAaA in the table above).

Example calculations

Inverse tangent function

We can calculate the uncertainty propagation for the inverse tangent function as an example of using partial derivatives to propagate error.

Define [math]\displaystyle{ f(x) = \arctan(x), }[/math] where [math]\displaystyle{ \Delta_x }[/math] is the absolute uncertainty on our measurement of x. The derivative of f(x) with respect to x is [math]\displaystyle{ \frac{d f}{d x} = \frac{1}{1+x^2}. }[/math]

Therefore, our propagated uncertainty is [math]\displaystyle{ \Delta_{f} \approx \frac{\Delta_x}{1+x^2}, }[/math] where [math]\displaystyle{ \Delta_f }[/math] is the absolute propagated uncertainty.

Resistance measurement

A practical application is an experiment in which one measures current, I, and voltage, V, on a resistor in order to determine the resistance, R, using Ohm's law, R = V / I.

Given the measured variables with uncertainties, I ± σI and V ± σV, and neglecting their possible correlation, the uncertainty in the computed quantity, σR, is:

[math]\displaystyle{ \sigma_R \approx \sqrt{ \sigma_V^2 \left(\frac{1}{I}\right)^2 + \sigma_I^2 \left(\frac{-V}{I^2}\right)^2 } = R\sqrt{ \left(\frac{\sigma_V}{V}\right)^2 + \left(\frac{\sigma_I}{I}\right)^2 }. }[/math]

See also


  1. Kirchner, James. "Data Analysis Toolkit #5: Uncertainty Analysis and Error Propagation". University of California. 
  2. Handbook of Monte Carlo Methods. John Wiley & Sons. 2011. 
  3. Ranftl, Sascha; von der Linden, Wolfgang (2021-11-13). "Bayesian Surrogate Analysis and Uncertainty Propagation". Physical Sciences Forum 3 (1): 6. doi:10.3390/psf2021003006. ISSN 2673-9984. 
  4. "On the parallelization approaches for Intel MIC architecture". AIP Conference Proceedings 1773 (1): 070001. 2016. doi:10.1063/1.4964983. Bibcode2016AIPC.1773g0001A. 
  5. "Uncertainty quantification through the Monte Carlo method in a cloud computing setting". Computer Physics Communications 185 (5): 1355–1363. 2014. doi:10.1016/j.cpc.2014.01.006. Bibcode2014CoPhC.185.1355C. 
  6. "Random number generators for large-scale parallel Monte Carlo simulations on FPGA". Journal of Computational Physics 360: 93–103. 2018. doi:10.1016/ Bibcode2018JCoPh.360...93L. 
  7. 7.0 7.1 Goodman, Leo (1960). "On the Exact Variance of Products". Journal of the American Statistical Association 55 (292): 708–713. doi:10.2307/2281592. 
  8. Ochoa1, Benjamin; Belongie, Serge "Covariance Propagation for Guided Matching"
  9. Ku, H. H. (October 1966). "Notes on the use of propagation of error formulas". Journal of Research of the National Bureau of Standards 70C (4): 262. doi:10.6028/jres.070c.025. ISSN 0022-4316. Retrieved 3 October 2012. 
  10. Clifford, A. A. (1973). Multivariate error analysis: a handbook of error propagation and calculation in many-parameter systems. John Wiley & Sons. ISBN 978-0470160558. [page needed]
  11. Soch, Joram (2020-07-07). "Variance of the linear combination of two random variables" (in en). 
  12. Lee, S. H.; Chen, W. (2009). "A comparative study of uncertainty propagation methods for black-box-type problems". Structural and Multidisciplinary Optimization 37 (3): 239–253. doi:10.1007/s00158-008-0234-7. 
  13. Johnson, Norman L.; Kotz, Samuel; Balakrishnan, Narayanaswamy (1994). Continuous Univariate Distributions, Volume 1. Wiley. pp. 171. ISBN 0-471-58495-9. 
  14. Lecomte, Christophe (May 2013). "Exact statistics of systems with uncertainties: an analytical theory of rank-one stochastic dynamic systems". Journal of Sound and Vibration 332 (11): 2750–2776. doi:10.1016/j.jsv.2012.12.009. 
  15. "A Summary of Error Propagation". p. 2. 
  16. "Propagation of Uncertainty through Mathematical Operations". p. 5. 
  17. "Strategies for Variance Estimation". p. 37. 
  18. 18.0 18.1 Harris, Daniel C. (2003), Quantitative chemical analysis (6th ed.), Macmillan, p. 56, ISBN 978-0-7167-4464-1, 
  19. "Error Propagation tutorial". Foothill College. October 9, 2009. 

Further reading

External links