For fractional-order differentiator where is a real number, its discretization is a key step in digital implementation. Two discretization methods are presented. The first scheme is a direct recursive discretization of the Tustin operator. The second one is a direct discretization method using the Al-Alaoui operator via continued fraction expansion (CFE). The approximate discretization is minim...

This paper presents an unsupervised discretization method that performs density estimation for univariate data. The subintervals that the discretization produces can be used as the bins of a histogram. Histograms are a very simple and broadly understood means for displaying data, and our method automatically adapts bin widths to the data. It uses the log-likelihood as the scoring function to se...

We study uniform bounds associated with the Allen–Cahn equation and its numerical discretization schemes. These uniform bounds are different from, and weaker than, the conventional energy dissipation and the maximum principle, but they can be helpful in the analysis of numerical methods. In particular, we show that finite difference spatial discretization, like the original continuum model, sha...

Problem statement: Regression via Classification (RvC) is a method in which a regression problem is converted into a classification problem. A discretization process is used to covert continuous target value to classes. The discretized data can be used with classifiers as a classification problem. Approach: In this study, we use a discretization method, Extreme Randomized Discretization (ERD), ...

The aperiodic Fourier modal method in contrast-field formulation is a numerical discretization and solution technique for solving scattering problems in electromagnetics. Typically, spectral discretization is used in the finite periodic direction and spatial discretization in the orthogonal direction. In the light of the fact that the structures of interest often have a large width-toheight rat...

We describe an algorithm called TargetCluster for the discretization of continuous targets in subgroup discovery. The algorithm identifies patterns in the target data and uses them to select the discretization cutpoints. The algorithm has been implemented in a subgroup discovery method. Tests show that the discretization method likely leads to improved insight.

in this paper, a numerical efficient method is proposed for the solution of time fractionalmobile/immobile equation. the fractional derivative of equation is described in the caputosense. the proposed method is based on a finite difference scheme in time and legendrespectral method in space. in this approach the time fractional derivative of mentioned equationis approximated by a scheme of order o...