Result: A generator of pseudo-random numbers sequences with a very long period
Title:
A generator of pseudo-random numbers sequences with a very long period
Authors:
Source:
International conference of computational methods in sciences and engineering 2003 (ICCMSE 2003)Mathematical and computer modelling. 42(7-8):809-816
Publisher Information:
Oxford: Elsevier Science, 2005.
Publication Year:
2005
Physical Description:
print, 10 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Algèbre, Algebra, Théorie des nombres, Number theory, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Probabilités et statistiques numériques, Numerical methods in probability and statistics, Analyse numérique, Numerical analysis, Análisis numérico, Borne supérieure, Upper bound, Cota superior, Calcul scientifique, Scientific computation, Computación científica, Générateur nombre aléatoire, Random number generators, Génération nombre aléatoire, Random number generation, Generación número aleatorio, Mathématiques appliquées, Applied mathematics, Matemáticas aplicadas, Méthode stochastique, Stochastic method, Método estocástico, Série aléatoire, Random series, Serie aleatoria, Congruence linéaire, Linear congruence, Suite nombre pseudo aléatoire, Pseudo random number sequence, Linear congruences, Pseudo-random number sequences
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Dpto. de Matemáticas y Física Aplicadas y CC. de la Naturaleza, Universidad Rey Juan Carlos, 28933 Móstoles, Spain
Dpto. de Matemática Aplicada a las Tecnologías de la Información, Universidad Politécnica de Madrid, 28040, Madrid, Spain
Dpto. de Matemática Aplicada a las Tecnologías de la Información, Universidad Politécnica de Madrid, 28040, Madrid, Spain
ISSN:
0895-7177
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.17286652
Database:
PASCAL Archive
Further Information
We show how it is possible to choose, in an adequate manner, the parameters a, b, and m of the linear congruential generator, xn+1 = (a . xn + b) mod m, in order to maximize the period of the generated series of pseudo-random numbers, in such a manner that the period obtained is close to the theoretical upper bound of m!.