The IUFP Algorithm for Generating Simulation Heart‎

In all systems simulation, random variates are considered as a main factor and based of simulation heart. ‎actually, randomization is inducted by random variates in the simulation. due to the importance of such a ‎problem, a new method for generation of random variates from continuous distributions is presented in ‎this paper. the proposed algorithm, called uniform fractional part (ufp) is simpler and more efficient ‎compared with other methods of random variates generation. despite useful consequences, this algorithm ‎has several shortcomings such as 1) being approximate, 2) not accessibility of the inverse of cumulative ‎density function (cdf) for all distributions in order to determine the cut-off points and 3) truncating the ‎tails of infinite distributions, which all of the aforementioned shortcomings reduce the precision and speed ‎of the algorithm. the main goal of this research is proposing the improved version of this algorithm ‎‎(iufp) through recognizing its deficiencies. ‎