Discretization Explained

In applied mathematics, discretization is the process of transferring continuous functions, models, variables, and equations into discrete counterparts. This process is usually carried out as a first step toward making them suitable for numerical evaluation and implementation on digital computers. Dichotomization is the special case of discretization in which the number of discrete classes is 2, which can approximate a continuous variable as a binary variable (creating a dichotomy for modeling purposes, as in binary classification).

Discretization is also related to discrete mathematics, and is an important component of granular computing. In this context, discretization may also refer to modification of variable or category granularity, as when multiple discrete variables are aggregated or multiple discrete categories fused.

Whenever continuous data is discretized, there is always some amount of discretization error. The goal is to reduce the amount to a level considered negligible for the modeling purposes at hand.

The terms discretization and quantization often have the same denotation but not always identical connotations. (Specifically, the two terms share a semantic field.) The same is true of discretization error and quantization error.

Mathematical methods relating to discretization include the Euler–Maruyama method and the zero-order hold.

Discretization of linear state space models

Discretization is also concerned with the transformation of continuous differential equations into discrete difference equations, suitable for numerical computing.

The following continuous-time state space model

• x (t) = A x (t) + B u (t) + w (t) y (t) = C x (t) + D u (t) + v (t)

where v and w are continuous zero-mean white noise sources with power spectral densities

w (t) \sim N( 0 , Q) v (t) \sim N( 0 , R)

can be discretized, assuming zero-order hold for the input u and continuous integration for the noise v, to

x [k +1 ] = A _{d} x [k] + B _{d} u [k] + w [k] y [k] = C _{d} x [k] + D _{d} u [k] + v [k]

with covariances

w [k] \sim N( 0 , Q _{d)} v [k] \sim N( 0 , R _{d)}

where

A _{d} = e ^{AT} = l{L} ^{-1} \{(s I - A) ^{-1} \} _{t=T} B _{d} = \left( \int ^{T} _{\tau =0} e ^{A\tau} d\tau \right) B = A ^{-1} ( A _{d} - I) B , if A is nonsingularC _{d} = C D _{d} = D Q _{d} = \int ^{T} _{\tau =0} e ^{A\tau} Q e ^{A ^{\top} \tau} d\tau R _{d} =R (1)/(T)

and

T is the sample time, although A ^{\top} is the transposed matrix of A . The equation for the discretized measurement noise is a consequence of the continuous measurement noise being defined with a power spectral density.^[1]

A clever trick to compute A_d and B_d in one step is by utilizing the following property:^[2]

e ^{\begin{bmatrix} A & B \\ 0 & 0 \end{bmatrix} T} = \begin{bmatrix} A _{d} & B _{d} \\ 0 & I \end{bmatrix}

Where

A _{d} and B _{d} are the discretized state-space matrices.

Discretization of process noise

Numerical evaluation of

Q _{d} is a bit trickier due to the matrix exponential integral. It can, however, be computed by first constructing a matrix, and computing the exponential of it^[3] F = \begin{bmatrix} - A & Q \\ 0 & A ^{\top} \end{bmatrix} T G = e ^{F} = \begin{bmatrix} ... & A ^{-1} _{d} Q _{d} \\ 0 & A ^{\top} _{d} \end{bmatrix}. The discretized process noise is then evaluated by multiplying the transpose of the lower-right partition of G with the upper-right partition of G:Q _{d} = ( A ^{\top)} _{d} ^{\top} ( A ^{-1} _{d} Q _{d)} = A _{d} ( A ^{-1} _{d} Q _{d).}

Derivation

Starting with the continuous model

• x (t) = A x(t) + B u(t) we know that the matrix exponential is(d)/(dt) e ^{At} = A e ^{At} = e ^{At} A and by premultiplying the model we gete ^{-At} • x (t) = e ^{-At} A x(t) + e ^{-At} B u(t) which we recognize as(d)/(dt) (e ^{-At} x(t)) = e ^{-At} B u(t) and by integrating..e ^{-At} x(t) - e ^{0x(0)=} \int ^{t} _{0} e ^{-A\tau} B u(\tau) d\tau x(t) = e ^{At} x(0) + \int ^{t} _{0} e ^{A(t-\tau)} B u(\tau) d \tau which is an analytical solution to the continuous model.

Now we want to discretise the above expression. We assume that u is constant during each timestep.

x[k] \stackrel{ def }\ \mathbf x(kT)x[k] = e ^{AkT} x(0) + \int ^{kT} _{0} e ^{A(kT-\tau)} B u(\tau) d \tau x[k+1] = e ^{A(k+1)T} x(0) + \int ^{(k +1 )T} _{0} e ^{A((k+1)T-\tau)} B u(\tau) d \tau x[k+1] = e ^{AT} \left[ e ^{AkT} x(0) + \int ^{kT} _{0} e ^{A(kT-\tau)} B u(\tau) d \tau \right] + \int ^{(k +1 )T} _{kT} e ^{A(kT+T-\tau)} B u(\tau) d \tau We recognize the bracketed expression as x[k] , and the second term can be simplified by substituting with the function v(\tau) = kT + T - \tau . Note that d\tau =- dv . We also assume that u is constant during the integral, which in turn yields\begin{matrix} x[k+1]&=& e ^{AT} x[k] - \left( \int ^{v((k +1 )T)} _{v(kT)} e ^{Av} dv \right) B u[k] \\ &=& e ^{AT} x[k] - \left( \int ^{0} _{T} e ^{Av} dv \right) B u[k] \\ &=& e ^{AT} x[k] + \left( \int ^{T} _{0} e ^{Av} dv \right) B u[k] \\ &=&e ^{AT} x[k] + A ^{-1} \left(e ^{AT} - I \right) B u[k] \end{matrix} which is an exact solution to the discretization problem.

When

A is singular, the latter expression can still be used by replacing e ^{AT} by its Taylor expansion,e ^{{A} T} = \sum ^{inf ty} _{k =0} (1)/(k!) ({ A}T) ^{k} . This yields\begin{matrix} x[k+1]&=& e ^{{A} T} x[k] + \left( \int ^{T} _{0} e ^{{A} v} dv \right) B u[k] \\ &=&\left(\sum ^{inf ty} _{k =0} (1)/(k!) ({ A}T) ^{k\right)} x[k] + \left(\sum ^{inf ty} _{k =1} (1)/(k!) { A} ^{k-1} T ^{k\right)} B u[k], \end{matrix} which is the form used in practice.

Approximations

Exact discretization may sometimes be intractable due to the heavy matrix exponential and integral operations involved. It is much easier to calculate an approximate discrete model, based on that for small timesteps

e ^{AT} ≈ I + A T . The approximate solution then becomes:x[k+1] ≈ ( I + AT) x[k] + T B u[k]

This is also known as the Euler method, which is also known as the forward Euler method. Other possible approximations are

e ^{AT} ≈ \left( I - A T \right) ^{-1} , otherwise known as the backward Euler method and e ^{AT} ≈ \left( I+ (1)/(2) A T \right) \left( I - (1)/(2) A T \right) ^{-1} , which is known as the bilinear transform, or Tustin transform. Each of these approximations has different stability properties. The bilinear transform preserves the instability of the continuous-time system.

Discretization of continuous features

See main article: Discretization of continuous features. In statistics and machine learning, discretization refers to the process of converting continuous features or variables to discretized or nominal features. This can be useful when creating probability mass functions.

Discretization of smooth functions

In generalized functions theory, discretizationarises as a particular case of the Convolution Theoremon tempered distributions

l{F}\{f*\operatorname{III}\} = l{F}\{f\} ⋅ \operatorname{III} l{F}\{\alpha ⋅ \operatorname{III}\} = l{F}\{\alpha\}*\operatorname{III}

where

\operatorname{III} is the Dirac comb,⋅ \operatorname{III} is discretization, * \operatorname{III} isperiodization, f is a rapidly decreasing tempered distribution(e.g. a Dirac delta function \delta or any othercompactly supported function), \alpha is a smooth,slowly growingordinary function (e.g. the function that is constantly 1 or any other band-limited function)and l{F} is the (unitary, ordinary frequency) Fourier transform.Functions \alpha which are not smooth can be made smooth using a mollifier prior to discretization.

As an example, discretization of the function that is constantly

1 yields the sequence [.., 1 , 1 , 1 ,..] which, interpreted as the coefficients of a linear combination of Dirac delta functions, forms a Dirac comb. If additionally truncation is applied, one obtains finite sequences, e.g. [ 1 , 1 , 1 , 1 ] . They are discrete in both, time and frequency.

See also

• Discrete event simulation
• Discrete space
• Discrete time and continuous time
• Finite difference method
• Finite volume method for unsteady flow
• Smoothing
• Stochastic simulation
• Time-scale calculus

Further reading

• Book: Robert Grover Brown & Patrick Y. C. Hwang. Introduction to random signals and applied Kalman filtering. 1997. 3rd. 978-0471128397.
• Book: Saunders College Publishing. Philadelphia, PA, USA. 1984. Chi-Tsong Chen. Linear System Theory and Design. 978-0030716911.
• C. Van Loan. Computing integrals involving the matrix exponential. 10.1109/TAC.1978.1101743. IEEE Transactions on Automatic Control. 23. 3. 395–404. Jun 1978. 1813/7095. free.
• Book: R.H. Middleton & G.C. Goodwin . Digital control and estimation: a unified approach. 1990. 33f. 978-0132116657.

External links

• Discretization in Geometry and Dynamics: research on the discretization of differential geometry and dynamics

Notes and References

1. Book: Analytic Sciences Corporation. Technical Staff.. Applied optimal estimation.. limited. 1974. M.I.T. Press. Gelb, Arthur, 1937-. 0-262-20027-9. Cambridge, Mass.. 121. 960061.
2. Raymond DeCarlo: Linear Systems: A State Variable Approach with Numerical Implementation, Prentice Hall, NJ, 1989
3. Charles Van Loan: Computing integrals involving the matrix exponential, IEEE Transactions on Automatic Control. 23 (3): 395–404, 1978