Related papers: Accelerating true orbit pseudorandom number genera…
We present a genetic programming approach to automatically discover convergence acceleration methods for discrete ordinates solutions of neutron transport problems in slab geometry. Classical acceleration methods such as Aitken's…
Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…
The conservative Post-Newtonian (PN) Hamiltonian formulation of spinning compact binaries has six integrals of motion including the total energy, the total angular momentum and the constant unit lengths of spins. The manifold correction…
This article presents a new class of Pseudorandom Number Generators. The generators are based on traversing a n-cube where a Balanced Hamiltonian Cycle has been removed. The construction of such generators is automatic for small number of…
High dimensional correlated binary data arise in many areas, such as observed genetic variations in biomedical research. Data simulation can help researchers evaluate efficiency and explore properties of different computational and…
This article describes a method to turn astronomical imaging into a random number generator by using the positions of incident cosmic rays and hot pixels to generate bit streams. We subject the resultant bit streams to a battery of standard…
For a set of binary response variables, conditional mean models characterize the expected value of a response variable given the others and are popularly applied in longitudinal and network data analyses. The quadratic exponential binary…
Pseudorandom number generators are required for many computational tasks, such as stochastic modelling and simulation. This paper investigates the serial CPU and parallel GPU implementation of a Linear Congruential Generator based on the…
Gravitational wave observations from merging compact objects are becoming commonplace, and as detectors improve and gravitational wave sources become more varied, it is increasingly important to have dense and expansive template banks of…
The generation of random numbers via quantum processes is an efficient and reliable method to obtain true indeterministic random numbers that are of vital importance to cryptographic communication and large-scale computer modeling. However,…
We perform a systematic study of eccentric orbiting nonspinning black hole binaries. We first make a technical study of the optimal full numerical techniques to apply to these studies. We choose different gauge parameters and Courant…
Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…
We present numerical relativity simulations of nine-orbit equal-mass binary neutron star covering the quasicircular late inspiral and merger. The extracted gravitational waveforms are analyzed for convergence and accuracy. Second order…
Random numbers are essential for applications ranging from secure communications to numerical simulation and quantitative finance. Algorithms can rapidly produce pseudo-random outcomes, series of numbers that mimic most properties of true…
We introduce a new numerical scheme for solving the initial value problem for quasiequilibrium binary neutron stars allowing for arbitrary spins. The coupled Einstein field equations and equations of relativistic hydrodynamics are solved in…
Delay differential equations (DDE) can have "chaotic" solutions that can be used to mimic Brownian motion. Since a Brownian motion is random in its velocity, it is reasonable to think that a random number generator (RNG) might be…
We use post-Newtonian (PN) approximations to determine the initial orbital and spin parameters of black hole binaries that lead to low-eccentricity inspirals when evolved with numerical relativity techniques. In particular, we seek initial…
Symmetry in integer programming causes redundant search and is often handled with symmetry breaking constraints that remove as many equivalent solutions as possible. We propose an algebraic method which allows to generate a random family of…
This work introduces the Elliptica pseudo-spectral code for generating initial data of binary neutron star systems. Building upon the recent Elliptica code update, we can now construct initial data using not only piecewise polytropic…
Binary embedding of high-dimensional data requires long codes to preserve the discriminative power of the input space. Traditional binary coding methods often suffer from very high computation and storage costs in such a scenario. To…