A Quasi-Monte Carlo Method for Elliptic Boundary Value Problems

  title={A Quasi-Monte Carlo Method for Elliptic Boundary Value Problems},
  author={Michael Mascagni and Aneta Karaivanova and Yaohang Li},
  booktitle={Monte Carlo Methods Appl.},
In this paper we present and analyze a quasi-Monte Carlo method for solving elliptic boundary value problems. Our method transforms the given partial differential equation into an integral equation by employing a well known local integral representation. The kernel in this integral equation representation can be used as a transition density function to define a Markov process used in estimating the solution. The particular process, called a random walk on balls process, is subsequently… 

Figures from this paper

A Parallel Quasi-Monte Carlo Method for Computing Extremal Eigenvalues

The convergence of a Monte Carlo method for evaluating the extremal eigenvalues of a given matrix is studied when quasirandom sequences are used and an improvement in both the magnitude of the error and in the convergence rate can be achieved.


The objective is to provide a robust and easy to use implementation that allows further experimentation on this new type of PDE solvers in order to elucidate their capabilities and computational characteristics.


The members of the Committee approve the thesis of Yaohang Li defended on 7/17/2000. ACKNOWLEDGEMENTS I would like to express my sincere thanks and appreciation to my advisor, Dr. Michael Mascagni



Estimates of the computational complexity of iterative Monte Carlo algorithm based on Green's function approach

Quasi-Monte Carlo Methods for Integral Equations

A deterministic error bound for estimating a functional of the solution of the integral transport equation via random walks is established that improves an earlier result of Chelson generalizing the Koksma-Hlawka inequality for finite dimensional quadrature.

A Quasi-Monte Carlo Scheme Using Nets for a Linear Boltzmann Equation

A quasi-Monte Carlo particle simulation for solving a linear Boltzmann equation is constructed and a convergence proof is given. The analysis is restricted to the three-dimensional equation in the

Monte Carlo Algorithms for Elliptic Differential Equations. Data Parallel Functional Approach

It is shown that the numerical solution of partial differential equations, can be efficiently addressed in a functional language and that due to small amount of communication a linear speedup is possible.

Monte Carlo and quasi-Monte Carlo methods

Monte Carlo is one of the most versatile and widely used numerical methods. Its convergence rate, O(N−1/2), is independent of dimension, which shows Monte Carlo to be very robust but also slow. This

Matrix Computations Using Quasirandom Sequences

It is shown, theoretically and through numerical tests, that the use of quasirandom sequences improves both the magnitude of the error and the convergence rate of the corresponding Monte Carlo methods.

A quasi-Monte Carlo approach to particle simulation of the heat equation

The convergence of the Monte Carlo method for numerical integration can often be improved by replacing random numbers with more uniformly distributed numbers known as quasi-random. In this paper the

Monte Carlo methods in boundary value problems

General Schemes for Constructing Scalar and Vector Monte Carlo Algorithms for Solving Boundary Value Problems: Random Walks on Boundary and Inside the Domain Algorithms. Random Walks and

New Monte Carlo Methods With Estimating Derivatives

Part 1 Estimation of integrals and solution of integral equations: estimation of integrals recurrent estimates of Monte Carlo method for the solution to an integral equation of the second kind

Generating Quasi-Random Paths for Stochastic Processes

The analysis of the integrand presented here explains the effectiveness of the quasi-random sequences on this high-dimensional problem and suggests methods of variance reduction which can be used in conjunction with the quasi -random sequences.