Searcharxiv⌕ Search

arXiv subjects

W. J. Handley

Publications and source records attributed to W. J. Handley.

40 records · Page 3Linked to original sources

The Runge-Kutta-Wentzel-Kramers-Brillouin Method

We demonstrate the effectiveness of a novel scheme for numerically solving linear differential equations whose solutions exhibit extreme oscillation. We take a standard Runge-Kutta approach, but replace the Taylor expansion formula with a Wentzel-Kramers-Brillouin method. The method is demonstrated by application to the Airy equation, along with a more complicated burst-oscillation case. Finally, we compare our scheme to existing approaches.

physics.comp-ph↗

Novel quantum initial conditions for inflation

We present a novel approach for setting initial conditions on the mode functions of the Mukhanov Sazaki equation. These conditions are motivated by minimisation of the renormalised stress-energy tensor, and are valid for setting a vacuum state even in a context where the spacetime is changing rapidly. Moreover, these alternative conditions are potentially observationally distinguishable. We apply this to the kinetically dominated universe, and compare with the more traditional approach.

gr-qc↗

PolyChord: next-generation nested sampling

PolyChord is a novel nested sampling algorithm tailored for high-dimensional parameter spaces. This paper coincides with the release of PolyChord v1.3, and provides an extensive account of the algorithm. PolyChord utilises slice sampling at each iteration to sample within the hard likelihood constraint of nested sampling. It can identify and evolve separate modes of a posterior semi-independently, and is parallelised using openMPI. It is capable of exploiting a hierarchy of parameter speeds such as those present in CosmoMC and CAMB, and is now in use in the CosmoChord and ModeChord codes. PolyChord is available for download at: http://ccpforge.cse.rl.ac.uk/gf/project/polychord/

astro-ph.IM↗

PolyChord: nested sampling for cosmology

PolyChord is a novel nested sampling algorithm tailored for high dimensional parameter spaces. In addition, it can fully exploit a hierarchy of parameter speeds such as is found in CosmoMC and CAMB. It utilises slice sampling at each iteration to sample within the hard likelihood constraint of nested sampling. It can identify and evolve separate modes of a posterior semi-independently and is parallelised using openMPI. PolyChord is available for download at: http://ccpforge.cse.rl.ac.uk/gf/project/polychord/

astro-ph.CO↗