Computational efficiency evaluation in output analysis

A central quantity in steady-state simulation is the time-average variance constant. Estimates of this quantity are needed (for example) for constructing confidence intervals, and several estimators have been proposed, including nonoverlapping and overlapping batch means methods, spectral methods, and the regenerative method. The asymptotic statistical properties of these estimators have been investigated but the computational complexity involved in computing them has received very little attention. We assume a fixed simulation run-length, as opposed to sequential methods in which the run-length is determined dynamically. In order to consistently estimate the time-average variance constant, all of the estimators require an amount of computation that is linear in the time-horizon simulated, with the exception of spectral methods which require a superlinear amount of computation.

[1]  B. Welford Note on a Method for Calculating Corrected Sums of Squares and Products , 1962 .

[2]  Edward A. Youngs,et al.  Some Results Relevant to Choice of Sum and Sum-of-Product Algorithms , 1971 .

[3]  R. F. Ling Comparison of Several Algorithms for Computing Sample Means and Variances , 1974 .

[4]  Richard J. Hanson Stably updating mean and standard deviation of data , 1975, CACM.

[5]  Tony F. Chan,et al.  Computing standard deviations: accuracy , 1979, CACM.

[6]  G. Golub,et al.  Updating formulae and a pairwise algorithm for computing sample variances , 1979 .

[7]  D. H. D. West Updating mean and variance estimates: an improved method , 1979, CACM.

[8]  Gordon M. Clark Recursive Estimation of the Variance of the Sample Average , 1980, TOMS.

[9]  Linus Schrage,et al.  A guide to simulation , 1983 .

[10]  D. B. Preston Spectral Analysis and Time Series , 1983 .

[11]  Gene H. Golub,et al.  Algorithms for Computing the Sample Variance: Analysis and Recommendations , 1983 .

[12]  Paul Bratley,et al.  A guide to simulation , 1983 .

[13]  Bruce W. Schmeiser,et al.  Overlapping batch means: something for nothing? , 1984, WSC '84.

[14]  E. Carlstein The Use of Subseries Values for Estimating the Variance of a General Statistic from a Stationary Sequence , 1986 .

[15]  Paul Bratley,et al.  A guide to simulation (2nd ed.) , 1986 .

[16]  Linus Schrage,et al.  A guide to simulation, 2nd Edition , 1987 .

[17]  William H. Press,et al.  Numerical Recipes in FORTRAN - The Art of Scientific Computing, 2nd Edition , 1987 .

[18]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[19]  Peter W. Glynn,et al.  Likelihood ratio gradient estimation for stochastic systems , 1990, CACM.

[20]  Ward Whitt,et al.  Estimating the asymptotic variance with batch means , 1991, Oper. Res. Lett..

[21]  H. Damerdji,et al.  Strong consistency and other properties of the spectral variance estimator , 1991 .

[22]  Gerald S. Shedler Regenerative Stochastic Simulation , 1992 .

[23]  Ward Whitt,et al.  The Asymptotic Efficiency of Simulation Estimators , 1992, Oper. Res..

[24]  Nicholas J. Higham,et al.  The Accuracy of Floating Point Summation , 1993, SIAM J. Sci. Comput..

[25]  Halim Damerdji,et al.  Strong Consistency of the Variance Estimator in Steady-State Simulation Output Analysis , 1994, Math. Oper. Res..

[26]  B. Schmeiser,et al.  Optimal mean-squared-error batch sizes , 1995 .

[27]  P. Glynn,et al.  Likelihood ratio gradient estimation for stochastic recursions , 1995, Advances in Applied Probability.