Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/16318
Title: | Optimal oversampling ratio in two-step simulation |
Authors: | Naidu, Srinath R. |
Keywords: | Computer Science Monte Carlo Matrix partitioning Oversampling ratio |
Issue Date: | Aug-2024 |
Publisher: | De Gruyter |
Abstract: | This paper analyses a novel two-step Monte Carlo simulation algorithm to estimate the weighted volume of a polytope of the form Az≤T . The essential idea is to partition the columns of A into two categories – a lightweight category and a heavyweight category. Simulation is done in a two-step manner where, for every sample of the lightweight category variables we use multiple samples of the heavyweight category variables. Thus, the heavyweight category variables are oversampled with respect to the lightweight category variables and increasing samples of the heavyweight variables at the expense of the lightweight variables will lead to a more efficient Monte Carlo method. In this paper we present a fast heuristic approximate for estimating the optimal oversampling ratio and substantiate with experimental results which confirm the effectiveness of the method. |
URI: | https://www.degruyter.com/document/doi/10.1515/mcma-2024-2011/html http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/16318 |
Appears in Collections: | Department of Computer Science and Information Systems |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.