Golden ratio versus pi as random sequence sources for Monte Carlo integration
From MaRDI portal
Publication:949528
DOI10.1016/j.mcm.2007.09.011zbMath1145.11320OpenAlexW2069140752MaRDI QIDQ949528
Ravi P. Agarwal, Gholam Ali Shaykhian, Syamal K. Sen
Publication date: 21 October 2008
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2007.09.011
Related Items
Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era, Birth, growth and computation of pi to ten trillion digits, Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era, Ergodic scales in fractal measures, Numerical results on some generalized random Fibonacci sequences
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Simulated annealing: A tool for operational research
- Solving k-shortest and constrained shortest path problems efficiently
- Golden ratio in science, as random sequence source, its computation and beyond
- Low-discrepancy and low-dispersion sequences
- The traveling salesman. Computational solutions for RSP applications
- Computational error and complexity in science and engineering
- Randomized algorithms and pseudorandom numbers
- Discrépance de suites associées à un système de numération (en dimension s)
- Mersenne twister
- Equation of State Calculations by Fast Computing Machines
- The Traveling-Salesman Problem
- A Method for Solving Traveling-Salesman Problems
- On the distribution of points in a cube and the approximate evaluation of integrals
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
