Department of Mathematics
Permanent URI for this collectionhttp://localhost:4000/handle/123456789/1920
Browse
11 results
Search Results
Item Extended Latin Hypercube Sampling for Integration and Simulation(Springer, 2013-01) Venkiteswaran, G.We analyze an extended form of Latin hypercube sampling technique that can be used for numerical quadrature and for Monte Carlo simulation. The technique utilizes random point sets with enhanced uniformity over the s-dimensional unit hypercube. A sample of N = n s points is generated in the hypercube. If we project the N points onto their ith coordinates, the resulting set of values forms a stratified sample from the unit interval, with one point in each subinterval [(k−1)/N,k/N). The scheme has the additional property that when we partition the hypercube into N subcubes ∏si=1[(ℓi−1)/n,ℓi/n), each one contains exactly one point. We establish an upper bound for the variance, when we approximate the volume of a subset of the hypercube, with a regular boundary. Numerical experiments assess that the bound is tight. It is possible to employ the extended Latin hypercube samples for Monte Carlo simulation. We focus on the random walk method for diffusion and we show that the variance is reduced when compared with classical random walk using ordinary pseudo-random numbers. The numerical comparisons include stratified sampling and Latin hypercube sampling.Item Diffusion in a nonhomogeneous medium: quasi-random walk on a lattice(De Gruyter, 2010-10) Venkiteswaran, G.We are interested in Monte Carlo (MC) methods for solving the diffusion equation: in the case of a constant diffusion coefficient, the solution is approximated by using particles and in every time step, a constant stepsize is added to or subtracted from the coordinates of each particle with equal probability. For a spatially dependent diffusion coefficient, the naive extension of the previous method using a spatially variable stepsize introduces a systematic error: particles migrate in the directions of decreasing diffusivity. A correction of stepsizes and stepping probabilities has recently been proposed and the numerical tests have given satisfactory results. In this paper, we describe a quasi-Monte Carlo (QMC) method for solving the diffusion equation in a spatially nonhomogeneous medium: we replace the random samples in the corrected MC scheme by low-discrepancy point sets. In order to make a proper use of the better uniformity of these point sets, the particles are reordered according to their successive coordinates at each time step. We illustrate the method with numerical examples: in dimensions 1 and 2, we show that the QMC approach leads to improved accuracy when compared with the original MC method using the same number of particles.Item Quasi-Monte Carlo Simulation of Diffusion in a Spatially Nonhomogeneous Medium(Springer, 2009-11) Venkiteswaran, G.We propose and test a quasi-Monte Carlo (QMC) method for solving the diffusion equation in the spatially nonhomogeneous case. For a constant diffusion coefficient, the Monte Carlo (MC) method is a valuable tool for simulating the equation: the solution is approximated by using particles and in every time step the displacement of each particle is drawn from a Gaussian distribution with constant variance. But for a spatially dependent diffusion coefficient, the straightforward extension using a spatially variable variance leads to biased results. A correction to the Gaussian steplength was recently proposed and provides satisfactory results. In the present work, we devise a QMC variant of this corrected MC scheme. We present the results of some numerical experiments showing that our QMC algorithm converges better than the corresponding MC method for the same number of particles.Item Deterministic Particle Methods for High Dimensional Fokker-Planck Equations(Springer, 2006) Venkiteswaran, G.We consider a mathematical model for polymeric liquids which requires the solution of high-dimensional Fokker-Planck equations related to stochastic differential equations. While Monte-Carlo (MC) methods are classically used to construct approximate solutions in this context, we consider an approach based on Quasi- Monte-Carlo (QMC) approximations. Although QMC has proved to be superior to MC in certain integration problems, the advantages are not as pronounced when dealing with stochastic differential equations. In this article, we illustrate the basic difficulty which is related to the construction of QMC product measures.Item A QMC approach for high dimensional Fokker–Planck equations modelling polymeric liquids(Elsevier, 2005) Venkiteswaran, G.A classical model used in the study of dynamics of polymeric liquids is the bead-spring chain representation of polymer molecules. The chain typically consists of a large number of beads and thus the state space of its configuration, which is essentially the position of all the constituent beads, turns out to be high dimensional. The distribution function governing the configuration of a bead-spring chain undergoing shear flow is a Fokker–Planck equation on . In this article, we present QMC methods for the approximate solution of the Fokker–Planck equation which are based on the time splitting technique to treat convection and diffusion separately. Convection is carried out by moving the particles along the characteristics and we apply the algorithms presented in [G. Venkiteswaran, M. Junk, QMC algorithms for diffusion equations in high dimensions, Math. Comput. Simul. 68 (2005) 23–41.] for diffusion. Altogether, we find that some of the QMC methods show reduced variance and thus slightly outperform standard MC.Item Quasi-Monte Carlo algorithms for diffusion equations in high dimensions(IDEAS is a RePEc, 2005) Venkiteswaran, G.Diffusion equation posed on a high dimensional space may occur as a sub-problem in advection-diffusion problems (see [G. Venkiteswaran, M. Junk, A QMC approach for high dimensional Fokker–Planck equations modelling polymeric liquids, Math. Comput. Simul. 68 (2005) 43–56.] for a specific application). Although the transport part can be dealt with the method of characteristics, the efficient simulation of diffusion in high dimensions is a challenging task. The traditional Monte Carlo method (MC) applied to diffusion problems converges and is N−1/2 accurate, where N is the number of particles. It is well known that for integration, quasi-Monte Carlo (QMC) outperforms Monte Carlo in the sense that one can achieve N−1 convergence, up to a logarithmic factor. This is our starting point to develop methods based on Lécot’s approach [C. Lécot, F.E. Khettabi, Quasi-Monte Carlo simulation of diffusion, Journal of Complexity 15 (1999) 342–359.], which are applicable in high dimensions, with a hope to achieve better speed of convergence. Through a number of numerical experiments we observe that some of the QMC methods not only generalize to high dimensions but also show faster convergence in the results and thus, slightly outperform standard MC.Item Extended Latin Hypercube Sampling for Integration and Simulation(Springer, 2013-01) Venkiteswaran, G.We analyze an extended form of Latin hypercube sampling technique that can be used for numerical quadrature and for Monte Carlo simulation. The technique utilizes random point sets with enhanced uniformity over the s-dimensional unit hypercube. A sample of N = n s points is generated in the hypercube. If we project the N points onto their ith coordinates, the resulting set of values forms a stratified sample from the unit interval, with one point in each subinterval [(k−1)/N,k/N). The scheme has the additional property that when we partition the hypercube into N subcubes ∏si=1[(ℓi−1)/n,ℓi/n), each one contains exactly one point. We establish an upper bound for the variance, when we approximate the volume of a subset of the hypercube, with a regular boundary. Numerical experiments assess that the bound is tight. It is possible to employ the extended Latin hypercube samples for Monte Carlo simulation. We focus on the random walk method for diffusion and we show that the variance is reduced when compared with classical random walk using ordinary pseudo-random numbers. The numerical comparisons include stratified sampling and Latin hypercube sampling.Item Quasi-Monte Carlo algorithms for diffusion equations in high dimensions(Elsevier, 2005-02) Venkiteswaran, G.Diffusion equation posed on a high dimensional space may occur as a sub-problem in advection-diffusion problems (see [G. Venkiteswaran, M. Junk, A QMC approach for high dimensional Fokker–Planck equations modelling polymeric liquids, Math. Comput. Simul. 68 (2005) 43–56.] for a specific application). Although the transport part can be dealt with the method of characteristics, the efficient simulation of diffusion in high dimensions is a challenging task. The traditional Monte Carlo method (MC) applied to diffusion problems converges and is accurate, where N is the number of particles. It is well known that for integration, quasi-Monte Carlo (QMC) outperforms Monte Carlo in the sense that one can achieve convergence, up to a logarithmic factor. This is our starting point to develop methods based on Lécot’s approach [C. Lécot, F.E. Khettabi, Quasi-Monte Carlo simulation of diffusion, Journal of Complexity 15 (1999) 342–359.], which are applicable in high dimensions, with a hope to achieve better speed of convergence. Through a number of numerical experiments we observe that some of the QMC methods not only generalize to high dimensions but also show faster convergence in the results and thus, slightly outperform standard MC.Item Quasi-Monte Carlo Simulation of Diffusion in a Spatially Nonhomogeneous Medium(Springer, 2009-11) Venkiteswaran, G.;We propose and test a quasi-Monte Carlo (QMC) method for solving the diffusion equation in the spatially nonhomogeneous case. For a constant diffusion coefficient, the Monte Carlo (MC) method is a valuable tool for simulating the equation: the solution is approximated by using particles and in every time step the displacement of each particle is drawn from a Gaussian distribution with constant variance. But for a spatially dependent diffusion coefficient, the straightforward extension using a spatially variable variance leads to biased results. A correction to the Gaussian steplength was recently proposed and provides satisfactory results. In the present work, we devise a QMC variant of this corrected MC scheme. We present the results of some numerical experiments showing that our QMC algorithm converges better than the corresponding MC method for the same number of particles.Item A QMC approach for high dimensional Fokker–Planck equations modelling polymeric liquids(Elsevier, 2005-02) Venkiteswaran, G.A classical model used in the study of dynamics of polymeric liquids is the bead-spring chain representation of polymer molecules. The chain typically consists of a large number of beads and thus the state space of its configuration, which is essentially the position of all the constituent beads, turns out to be high dimensional. The distribution function governing the configuration of a bead-spring chain undergoing shear flow is a Fokker–Planck equation on . In this article, we present QMC methods for the approximate solution of the Fokker–Planck equation which are based on the time splitting technique to treat convection and diffusion separately. Convection is carried out by moving the particles along the characteristics and we apply the algorithms presented in [G. Venkiteswaran, M. Junk, QMC algorithms for diffusion equations in high dimensions, Math. Comput. Simul. 68 (2005) 23–41.] for diffusion. Altogether, we find that some of the QMC methods show reduced variance and thus slightly outperform standard MC.