论文信息 - A Grid Free Monte Carlo Algorithm for Solving Elliptic Boundary Value Problems

A Grid Free Monte Carlo Algorithm for Solving Elliptic Boundary Value Problems

In this work a grid free Monte Carlo algorithm for solving elliptic boundary value problems is investigated. The proposed Monte Carlo approach leads to a random process called a ball process.In order to generate random variables with the desired distribution, rejection techniques on two levels are used.Varied numerical tests on a Sun Ultra Enterprise 4000 with 14 Ultra-SPARC processors were performed. The code which implemented the new algorithm was written in JAVA.The numerical results show that the derived theoretical estimates can be used to predict the behavior of a wide class of elliptic boundary value problems.

Ivan Tomov Dimov | Todor V. Gurov | Paula A. Whitlock

[1] V. S. Vladimirov,et al. Equations of mathematical physics , 1972 .

[2] G. A. Mikhaĭlov. New Monte Carlo Methods With Estimating Derivatives , 1995 .

[3] Karl K. Sabelfeld. Monte Carlo Methods , 1991 .

[4] S. K. Park,et al. Random number generators: good ones are hard to find , 1988, CACM.

[5] G. M.,et al. Partial Differential Equations I , 2023, Applied Mathematical Sciences.

[6] W. D. Evans,et al. PARTIAL DIFFERENTIAL EQUATIONS , 1941 .

[7] Karl K. Sabelfeld. Monte Carlo Methods in Boundary Value Problems. , 1991 .

[8] T. Gurov,et al. Estimates of the computational complexity of iterative Monte Carlo algorithm based on Green's function approach , 1998 .