Published: May 30, 2015
Zachary H. Levine, Adam L. Pintar
A simple algorithm for averaging a stochastic sequence of 1D arrays in a moving, expanding window is provided. The samples are grouped in bins which increase exponentially in size so that a constant fraction of the samples is retained at any point in the sequence. The algorithm is shown to have particular relevance for a class of Monte Carlo sampling problems which includes one characteristic of iterative reconstruction in computed tomography. The code is available in the CPC program library (at www.cpc.qpub.ac.uk, Catalog ID: aexaZ) in both Fortran 95 and C and is also available in R through CRAN.
Citation: Computer Physics Communications
Pub Type: Journals
Monte Carlo, moving expanding window , stochastic average
Created May 30, 2015, Updated November 10, 2018