Show simple item record

dc.contributor.authorBagdasar, Ovidiu
dc.contributor.authorChen, Minsi
dc.date.accessioned2016-11-16T18:51:51Z
dc.date.available2016-11-16T18:51:51Z
dc.date.issued2014-03-26
dc.identifier.citationBagdasar, O. and Chen, M. (2014) 'A Horadam-based pseudo-random number generator', Proceedings of the 16th International Conference on Computer Modelling and Simulation (UKSim), Emmanuel College, Cambridge University, Cambridge: UK, 26-28 Marchen
dc.identifier.isbn9781479949229
dc.identifier.doi10.1109/UKSim.2014.55
dc.identifier.urihttp://hdl.handle.net/10545/620881
dc.description.abstractUniformly distributed pseudo-random number generators are commonly used in certain numerical algorithms and simulations. In this article a random number generation algorithm based on the geometric properties of complex Horadam sequences was investigated. For certain parameters, the sequence exhibited uniformity in the distribution of arguments. This feature was exploited to design a pseudo-random number generator which was evaluated using Monte Carlo π estimations, and found to perform comparatively with commonly used generators like Multiplicative Lagged Fibonacci and the 'twister' Mersenne.
dc.language.isoenen
dc.publisherIEEEen
dc.relation.urlhttp://ieeexplore.ieee.org/document/7046068/en
dc.relation.urlhttp://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7045626en
dc.relation.urlhttp://uksim.info/uksim2014/uksim2014.htmen
dc.subjectRecurrent sequencesen
dc.subjectRandom number generatoren
dc.subjectGeneratorsen
dc.subjectComputational modelingen
dc.titleA Horadam-based pseudo-random number generatoren
dc.typeMeetings and Proceedingsen
dc.contributor.departmentUniversity of Derbyen
dc.identifier.journalProceedings of the 16th International Conference on Computer Modelling and Simulation (UKSim)en
refterms.dateFOA2019-02-28T14:56:18Z
html.description.abstractUniformly distributed pseudo-random number generators are commonly used in certain numerical algorithms and simulations. In this article a random number generation algorithm based on the geometric properties of complex Horadam sequences was investigated. For certain parameters, the sequence exhibited uniformity in the distribution of arguments. This feature was exploited to design a pseudo-random number generator which was evaluated using Monte Carlo π estimations, and found to perform comparatively with commonly used generators like Multiplicative Lagged Fibonacci and the 'twister' Mersenne.


Files in this item

Thumbnail
Name:
(2014) A Horadam-based Pseudo- ...
Size:
708.1Kb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record