Skip to main content
. Author manuscript; available in PMC: 2015 Jan 1.
Published in final edited form as: J Comput Graph Stat. 2013 Apr 28;23(2):543–563. doi: 10.1080/10618600.2013.791193
Algorithm 5: Heuristic Algorithm for Initial Interval Width Selection
1. Draw N(0) samples using an initial guess, ω(0). Set t = 0.
2. Tally the number of expansions, X(t) & contractions, C(t)
3. Set ω(t+1)=ω(t)×2(X(t)X(t)+C(t)) and N(t+1) = 2 × N(t). Set t = t + 1.
4. Repeat steps 2 and 3 until (X(t)X(t)+C(t))−12∈[−φ,φ]