|
In mathematics, discretization concerns the process of transferring continuous functions, models, 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. Processing on a digital computer requires another process called quantization. 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). * Euler–Maruyama method * Zero-order hold 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. == 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 : : where ''v'' and ''w'' are continuous zero-mean white noise sources with covariances : : can be discretized, assuming zero-order hold for the input ''u'' and continuous integration for the noise ''v'', to : : with covariances : : where : :, if is nonsingular : : : : and is the sample time, although is the transposed matrix of . A clever trick to compute ''A''''d'' and ''B''''d'' in one step is by utilizing the following property:〔Raymond DeCarlo: ''Linear Systems: A State Variable Approach with Numerical Implementation'', Prentice Hall, NJ, 1989〕 : and then having : : 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Discretization」の詳細全文を読む スポンサード リンク
|