MARC보기
LDR04228cmm u2200553 i 4500
001000000340615
003EBZ
00520260127112359
006m d
007cr cnu|||unuuu
008241029s2025 si go 000 0 eng d
020 ▼a 9781003410607 ▼q (electronic bk.)
020 ▼a 100341060X ▼q (electronic bk.)
020 ▼a 1000908267 ▼q (electronic bk. : PDF)
020 ▼a 9781000908312 ▼q (electronic bk. : EPUB)
020 ▼a 1000908313 ▼q (electronic bk. : EPUB)
020 ▼a 9781000908268 ▼q (electronic bk.)
020 ▼z 9789814968492
0247 ▼a 10.1201/9781003410607 ▼2 doi
037 ▼a 9781003410607 ▼b Taylor & Francis
040 ▼a EBZ ▼b eng ▼c EBZ ▼d 248032
049 ▼a MAIN
050 4 ▼a QA276.5
072 7 ▼a MAT ▼x 041000 ▼2 bisacsh
072 7 ▼a SCI ▼x 040000 ▼2 bisacsh
072 7 ▼a COM ▼x 077000 ▼2 bisacsh
072 7 ▼a UB ▼2 bicssc
08204 ▼a 519/.93 ▼2 23/eng/20241119
1001 ▼a Nakazawa, Naoya, ▼e author.
24510 ▼a Random Number Generators on Computers / ▼c Naoya Nakazawa, Hiroshi Nakazawa.
260 ▼a Singapore : ▼b Jenny Stanford Publishing, ▼c 2025.
300 ▼a 1 online resource (x, 110 pages).
336 ▼a text ▼b txt ▼2 rdacontent
337 ▼a computer ▼b c ▼2 rdamedia
338 ▼a online resource ▼b cr ▼2 rdacarrier
3410 ▼a textual ▼2 sapdv ▼3 EBSCOhost
5050 ▼a 1. Basic Concepts and Tools2. Group Structures3. Designs of MC Generators4. Lattice Structures5. Regular Simplexes and Regular Lattices6. Extended Second-Degree Tests7. MC Generators with Excellent Statistics8. MC Random Numbers on Spatial Lattices9. Random Vector Fields and Random Walks10. Two Addenda and Closing Comments
520 ▼a This monograph proves that any finite random number sequence is represented by the multiplicative congruential (MC) way. It also shows that an MC random number generator (d, z) formed by the modulus d and the multiplier z should be selected by new regular simplex criteria to give random numbers an excellent disguise of independence. The new criteria prove further that excellent subgenerators (d1,z1) and (d2,z2) with coprime odd submoduli d1 and d2 form an excellent combined generator (d = d1d2,z) with high probability by Sunzi's theorem of the 5th-6th centuries (China), contrasting the fact that such combinations could never be found with MC subgenerators selected in the 20th-century criteria. Further, a combined MC generator (d = d1d2,z) of new criteria readily realizes periods of 252 or larger, requiring only fast double-precision arithmetic by powerful Sunzi's theorem. We also obtain MC random numbers distributed on spatial lattices, say two-dimensional 4000 by 4000 lattices which may be tori, with little pair correlations of random numbers across the nearest neighbors. Thus, we evade the problems raised by Ferrenberg, Landau, and Wong.
532 0 ▼3 EBSCOhost ▼a "EBSCO evaluates our products based on the Web Content Accessibility Guidelines (WCAG) and the related Section 508 and EN 301 549 regulations in the US and EU. Most EBSCO products are substantially conformant with WCAG 2.2 level AA." Source: https://connect.ebsco.com/s/article/EBSCO-VPATs?language=en_US. Last accessed April 22, 2025.
5450 ▼a Naoya Nakazawa obtained his DSci (applied number theory) at Osaka Prefectural University, Japan. He is now the representative (theory and computing) of Hirakata Ransu Factory (HRF). Hiroshi Nakazawa obtained his DSci (statistical physics) at Kyoto University, Japan. As a professor at Takuma National College of Technology, Japan, he enjoyed teaching students applied mathematics. He is now the representative (theory and general affairs) of HRF.
5880 ▼a Online resource; title from PDF title page (Taylor & Francis, viewed November 19, 2024).
590 ▼a Added to collection customer.56279.3
650 0 ▼a Random number generators.
650 0 ▼a Random number generators ▼x Computer programs.
650 7 ▼a SCIENCE / Mathematical Physics ▼2 bisacsh
650 7 ▼a COMPUTERS / Mathematical & Statistical Software ▼2 bisacsh
7001 ▼a Nakazawa, Hiroshi, ▼e author.
85640 ▼3 EBSCOhost ▼u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=4096279
938 ▼a EBSCOhost ▼b EBSC ▼n 4096279
990 ▼a 관리자