Skip to main content
. 2019 Mar 18;21(3):289. doi: 10.3390/e21030289
Algorithm 2 Uniform Discretization Algorithm, UDA
Step 1. Initialize the number of sample points K. Set H=0, s=0, and k=K2.
Step 2. Set s=s+1 and calculate H=H+(−tlnt−(1−t)ln(1−t))ws, where t=12μ1(x1sL), ws=f(XsL)−f(Xs−1L).
Step 3. If s≤k, go to Step 2. Otherwise, set s=0 and go to Step 4.
Step 4. Set s=s+1 and calculate H=H+(−tlnt−(1−t)ln(1−t))wk−s, where t=12μ1(x1sR), wk−s=f(XsR)−f(Xs−1R).
Step 5. If s≤k, go to Step 4. Otherwise, go to Step 6.
Step 6. Calculate H=H+S(0.5)wk, where wk=f(XkR)−f(XkL).
Step 7. Return H as the estimated value of H[f(ξ1,ξ2,⋯,ξn)].