Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Centered $L_2$-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs
HTML articles powered by AMS MathViewer

by Kai-Tai Fang, Chang-Xing Ma and Peter Winker PDF
Math. Comp. 71 (2002), 275-296 Request permission

Abstract:

In this paper properties and construction of designs under a centered version of the $L_2$-discrepancy are analyzed. The theoretic expectation and variance of this discrepancy are derived for random designs and Latin hypercube designs. The expectation and variance of Latin hypercube designs are significantly lower than that of random designs. While in dimension one the unique uniform design is also a set of equidistant points, low-discrepancy designs in higher dimension have to be generated by explicit optimization. Optimization is performed using the threshold accepting heuristic which produces low discrepancy designs compared to theoretic expectation and variance.
References
  • Ingo Althöfer and Klaus-Uwe Koschnick, On the convergence of “threshold accepting”, Appl. Math. Optim. 24 (1991), no. 2, 183–195. MR 1118697, DOI 10.1007/BF01447741
  • Ching-Shui Cheng and Ker-Chau Li, A study of the method of principal Hessian direction for analysis of data from designed experiments, Statist. Sinica 5 (1995), no. 2, 617–639. MR 1347612
  • K. T. Fang and F. J. Hickernell, The uniform design and its applications, Bull. Inst. Internat. Statist., 50th Session, Book 1 (1995), 333-349.
  • K. T. Fang and R. Mukerjee, Connection between uniformity and aberration in regular fractions of two-level factorials, Technical Report MATH–216, Hong Kong Baptist University; Biometrika 87 (2000), 193–198.
  • K.-T. Fang and Y. Wang, Number-theoretic methods in statistics, Monographs on Statistics and Applied Probability, vol. 51, Chapman & Hall, London, 1994. MR 1284470, DOI 10.1007/978-1-4899-3095-8
  • K. T. Fang and P. Winker, Uniformity and orthogonality, Technical Report MATH–176, Hong Kong Baptist University, 1998.
  • Fred J. Hickernell, A generalized discrepancy and quadrature error bound, Math. Comp. 67 (1998), no. 221, 299–322. MR 1433265, DOI 10.1090/S0025-5718-98-00894-1
  • J. R. Koehler and A. B. Owen, Computer experiments, Handbook of Statistics, Vol. 13, S. Ghosh and C. R. Rao eds., Elsevier Science B. V., 1996, 261-308.
  • W. Li and K. T. Fang, A global optimum algorithm on two factor uniform design, Workshop on quasi-Monte Carlo methods and their applications (1995), 147-159.
  • C. X. Ma and K. T. Fang, Applications of uniformity to orthogonal fractional factorial designs, Technical Report MATH–193, Hong Kong Baptist University, 1998.
  • M. D. McKay, R. J. Beckman, and W. J. Conover, A comparison of three methods for selecting values of input variables in the analysis of output from a computer code, Technometrics 21 (1979), no. 2, 239–245. MR 533252, DOI 10.2307/1268522
  • Harald Niederreiter, Random number generation and quasi-Monte Carlo methods, CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 63, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1992. MR 1172997, DOI 10.1137/1.9781611970081
  • Art B. Owen, A central limit theorem for Latin hypercube sampling, J. Roy. Statist. Soc. Ser. B 54 (1992), no. 2, 541–551. MR 1160481
  • A. B. Owen, Controlling correlations in Latin hypercube samples, J. Amer. Statist. Assoc. 89 (1994), 1517-1522.
  • Art B. Owen, Randomly permuted $(t,m,s)$-nets and $(t,s)$-sequences, Monte Carlo and quasi-Monte Carlo methods in scientific computing (Las Vegas, NV, 1994) Lect. Notes Stat., vol. 106, Springer, New York, 1995, pp. 299–317. MR 1445791, DOI 10.1007/978-1-4612-2552-2_{1}9
  • G. Schrimpf, J. Schneider, H. Stamm-Wilbrandt and G. Dueck, Record breaking optimization results using the ruin & recreate principle, submitted to Journal of Computational Physics, 1999.
  • Boxin Tang, Orthogonal array-based Latin hypercubes, J. Amer. Statist. Assoc. 88 (1993), no. 424, 1392–1397. MR 1245375
  • Peter Winker and Kai-Tai Fang, Application of threshold-accepting to the evaluation of the discrepancy of a set of points, SIAM J. Numer. Anal. 34 (1997), no. 5, 2028–2042. MR 1472208, DOI 10.1137/S0036142995286076
  • P. Winker and K. T. Fang, Optimal U–Type Designs, Niederreiter, Harald (ed.) et al., Monte Carlo and quasi-Monte Carlo methods 1996. Berlin: Springer-Verlag. Lect. Notes Stat., Springer-Verlag. 127 (1998), 436–448.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2000): 68U07, 65D17, 62K99
  • Retrieve articles in all journals with MSC (2000): 68U07, 65D17, 62K99
Additional Information
  • Kai-Tai Fang
  • Affiliation: Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong; and Chinese Academy of Sciences, Beijing, China
  • Email: ktfang@math.hkbu.edu.hk
  • Chang-Xing Ma
  • Affiliation: Department of Statistics, Nankai University, Tianjin, China
  • Email: cxma@nankai.edu.cn
  • Peter Winker
  • Affiliation: Department of Economics, University of Mannheim, 68131 Mannheim, Germany
  • Email: Peter.Winker@vwl.uni-mannheim.de
  • Received by editor(s): July 20, 1999
  • Received by editor(s) in revised form: February 25, 2000
  • Published electronically: October 16, 2000
  • Additional Notes: This work was partially supported by a Hong Kong RGC-grant and SRCC of Hong Kong Baptist University.
  • © Copyright 2000 American Mathematical Society
  • Journal: Math. Comp. 71 (2002), 275-296
  • MSC (2000): Primary 68U07; Secondary 65D17, 62K99
  • DOI: https://doi.org/10.1090/S0025-5718-00-01281-3
  • MathSciNet review: 1863000