2002
DOI: 10.1103/physreve.66.056704
|View full text |Cite
|
Sign up to set email alerts
|

First- and last-passage Monte Carlo algorithms for the charge density distribution on a conducting surface

Abstract: Recent research shows that Monte Carlo diffusion methods are often the most efficient algorithms for solving certain elliptic boundary value problems. In this paper, we extend this research by providing two efficient algorithms based on the concept of "last-passage diffusion." These algorithms are qualitatively compared with each other (and with the best first-passage diffusion algorithm) in solving the classical problem of computing the charge distribution on a conducting disk held at unit voltage. All three … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
60
0

Year Published

2005
2005
2024
2024

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 29 publications
(62 citation statements)
references
References 10 publications
2
60
0
Order By: Relevance
“…Nowadays, owe to the calculation power of the computers, different iterative algorithms are used to solve the equations that govern the behaviour of this type of capacitors [5][6][7][8][9], these algorithms are designed to obtain the surface distributions of load, the values of the electric field and the total capacitance. The disadvantage of these algorithms is that they are designed for specific cases, so that, if geometry changes, the algorithm must almost be reconstructed entirely.…”
Section: Introductionmentioning
confidence: 99%
“…Nowadays, owe to the calculation power of the computers, different iterative algorithms are used to solve the equations that govern the behaviour of this type of capacitors [5][6][7][8][9], these algorithms are designed to obtain the surface distributions of load, the values of the electric field and the total capacitance. The disadvantage of these algorithms is that they are designed for specific cases, so that, if geometry changes, the algorithm must almost be reconstructed entirely.…”
Section: Introductionmentioning
confidence: 99%
“…Treat x 1 as the new starting point, draw a second ball fully contained in D, make a jump from x 1 to x 2 on the surface of the second ball as before. Repeat this procedure until the path hits a absorption ǫ-shell of the domain [5]. When this happens, we assume that the path has hit the boundary ∂D (see Figure 1(a) for an illustration).…”
Section: Methods Of Walk On Spheres (Wos)mentioning
confidence: 99%
“…[22][23][24][25] These developments focus on the computation of absorption probability from a point in the suspen-FIG. For completely absorbing traps, the appropriate boundary condition is C 0 = 0 on the surface of the trap because the trapped particle leaves the system.…”
Section: A Probability Of Trapping In a Particle/trap Encountermentioning
confidence: 94%