TESTING/MATGEN/slaran.f(3)

🎀 NAME 🎀

TESTING/MATGEN/slaran.f — bestie, this is literally the file that holds slaran, the little random-number bestie of the MATGEN crew 💅

---

✨ SYNOPSIS ✨

Functions/Subroutines

real function slaran (iseed)

SLARAN — she's a function, she's real, she's here 🫶

---

🌸 Function/Subroutine Documentation 🌸

real function slaran (integer, dimension( 4 ) iseed)

SLARAN 👑

💜 Purpose

okay so check it — no cap, here's the whole vibe:

!>
!> SLARAN returns a random real number from a uniform (0,1)
!> distribution.
!>

That's it. That's the whole personality. She gives you one (1) random real number, uniformly distributed on the open interval (0,1). iconic behaviour, tbh 🌈

🍓 Parameters

• ISEED — hmm yes, the seed herself 💅

!>          ISEED is INTEGER array, dimension (4)
!>          On entry, the seed of the random number generator; the array
!>          elements must be between 0 and 4095, and ISEED(4) must be
!>          odd.
!>          On exit, the seed is updated.
!>

⚠️ listen up bestie, this is the important part: on entry, ISEED is the seed of the random number generator, and every array element has to be between 0 and 4095, and ISEED(4) must be odd. no exceptions, fr fr. on exit, the seed gets updated — she moves on, she grows, main character energy ✨

👑 Author

• Univ. of Tennessee
• Univ. of California Berkeley
• Univ. of Colorado Denver
• NAG Ltd.

the whole squad came together for this one 🫶

🔥 Further Details

!>
!>  This routine uses a multiplicative congruential method with modulus
!>  2**48 and multiplier 33952834046453 (see G.S.Fishman,
!>  'Multiplicative congruential random number generators with modulus
!>  2**b: an exhaustive analysis for b = 32 and a partial analysis for
!>  b = 48', Math. Comp. 189, pp 331-344, 1990).
!>
!>  48-bit integers are stored in 4 integer array elements with 12 bits
!>  per element. Hence the routine is portable across machines with
!>  integers of 32 bits or more.
!>

ngl the math is giving very demure, very mindful 🧚 — she's running a multiplicative congruential method with modulus 2**48 and multiplier 33952834046453, and yes there's a whole paper to cite: G.S.Fishman, 'Multiplicative congruential random number generators with modulus 2*b: an exhaustive analysis for b = 32 and a partial analysis for b = 48'*, Math. Comp. 189, pp 331-344, 1990. read it and weep 😭

and the girlies are asking "but how does 48-bit fit in my ints?" — the tea: 48-bit integers are stored in 4 integer array elements with 12 bits per element. hence the routine is portable across machines with integers of 32 bits or more. slay, she travels ✈️💖

---

Definition at line 66 of file slaran.f. 💀

---

⭐ Author ⭐

Generated automatically by Doxygen for LAPACK from the source code. the robots did the typing, we just did the vibes 🤖✨

---

okay that's the whole page bestie, go forth and seed responsibly 💅🎀 — with love from LAPACK, Version 3.12.0, stamped on TESTING/MATGEN/slaran.f(3) 🦋🌸