Abstract
Estimating hyper-volumes of convex and non-convex sets are of interest in a number of areas. In this article we develop further a simple geometric Monte Carlo method, known also as the sample-mean method, which transforms the domain to an equivalent hyper-sphere with the same volume. We first examine the performance of the method to compute the volumes of star-convex unit balls and show that it gives accurate estimates of their volumes. We then examine the use of this method for computing the volumes of nonstar-shaped domains. In particular, we develop two algorithms, which couple the sample-mean method with algebraic and geometric techniques, to generate and compute the volumes of low-dimensional stability domains in parameter space.
References
[1] S. Ahmed and E. G. Saleeby, On volumes of hyper-ellipsoids, Math. Mag. 9 (2018), 43–50. 10.1080/0025570X.2018.1404834Search in Google Scholar
[2] K. Ball, An elementary introduction to modern convex geometry, Flavors in Geometry, Math. Sci. Res. Inst. Publ. 31, Cambridge University, Cambridge (1997), 1–58. Search in Google Scholar
[3] J. Edwards, A Treatise on the Integral Calculus. Vol. II, Chelsea, New York, 1922. Search in Google Scholar
[4] A. T. Fam, The volume of the coefficient space stability domain of monic polynomials, IEEE International Symposium on Circuits and Systems (Portalnd 1989), IEEE Press, Piscataway (1989), 1780–1783. 10.1109/ISCAS.1989.100711Search in Google Scholar
[5] A. T. Fam and J. S. Meditch, A canonical parameter space for linear systems design, IEEE Trans. Automat. Control 23 (1978), 454–458. 10.1109/TAC.1978.1101744Search in Google Scholar
[6] D. S. K. Fok and D. Crevier, Volume estimation by monte carlo methods, J. Stat. Comput. Simul. 34 (1989), 223–235. 10.1080/00949658908811145Search in Google Scholar
[7] J. Hopcroft and R. Kannan, Foundation of Data Science, in preparation 11/4/2014. Search in Google Scholar
[8] U. Jaekel, A Monte Calro method for high-dimensional volume estimation and application to polytopes, Procedia Comp. Sci. 4 (2011), 1403–1411. 10.1016/j.procs.2011.04.151Search in Google Scholar
[9] B. Kawohl, Rearrangements and Convexity of Level Sets in PDE, Lecture Notes in Math. 1150, Springer, Berlin, 1985. 10.1007/BFb0075060Search in Google Scholar
[10] M. E. Muller, A note on a method for generating points uniformly on n-dimensional spheres, Commun. ACM 2 (1959), 19–20. 10.1145/377939.377946Search in Google Scholar
[11] Y. P. Nikolaev, The multidimensional asymptotic stability domain of linear discrete systems: Its symmetry and other properties, Autom. Remote Control 62 (2001), 109–120. 10.1023/A:1012794324554Search in Google Scholar
[12] L. A. Santalo, Integral Geometry and Geometric Probability, 2nd ed., Cambridge University, Cambridge, 2004. 10.1017/CBO9780511617331Search in Google Scholar
[13] R. J. Solomonoff and E. G. Saleeby, On the application of algorithmic probability to autoregreessive models, Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence, Lecture Notes in Comput. Sci. 7070, Springer, Berlin (2013), 366–385. 10.1007/978-3-642-44958-1_29Search in Google Scholar
[14] X. Wang, Volumes of generalized unit balls, Math. Mag. 78 (2005), 390–395. 10.2307/30044198Search in Google Scholar
© 2019 Walter de Gruyter GmbH, Berlin/Boston
