The Experts below are selected from a list of 6327 Experts worldwide ranked by ideXlab platform
Aidan Sudbury - One of the best experts on this subject based on the ideXlab platform.
-
The annihilating process on random trees and the square lattice
Journal of Applied Probability, 2004Co-Authors: Aidan SudburyAbstract:An annihilating process is an interacting Particle system in which the only interaction is that a Particle may kill a Neighbouring Particle. Since there is no birth and no movement, once a Particle has no neighbours its site remains occupied for ever. The survival probability is calculated for a random tree and for the square lattice. A connection is made between annihilating processes and the adsorption of molecules onto surfaces. A one-dimensional adsorption problem is solved in the case in which the two neighbours do not act independently.
-
The annihilating process
Journal of Applied Probability, 2001Co-Authors: Martin O'hely, Aidan SudburyAbstract:An annihilating process is an interacting Particle system in which the only interaction is that a Particle may kill a Neighbouring Particle. Since there is no birth and no movement, once a Particle has no neighbours its site remains occupied for ever. It is shown that with initial configuration ℤ the distribution of Particles at all times is a renewal process and that the probability that a site remains occupied for all time tends to 1/e. Time-dependent behaviour is also calculated for the tree
Martin O'hely - One of the best experts on this subject based on the ideXlab platform.
-
The annihilating process
Journal of Applied Probability, 2001Co-Authors: Martin O'hely, Aidan SudburyAbstract:An annihilating process is an interacting Particle system in which the only interaction is that a Particle may kill a Neighbouring Particle. Since there is no birth and no movement, once a Particle has no neighbours its site remains occupied for ever. It is shown that with initial configuration ℤ the distribution of Particles at all times is a renewal process and that the probability that a site remains occupied for all time tends to 1/e. Time-dependent behaviour is also calculated for the tree
E. Pugliese Carratelli - One of the best experts on this subject based on the ideXlab platform.
-
Defining and optimizing algorithms for Neighbouring Particle identification in SPH fluid simulations
International Journal for Numerical Methods in Fluids, 2008Co-Authors: Giacomo Viccione, Vittorio Bovolin, E. Pugliese CarratelliAbstract:Lagrangian Particle methods such as smoothed Particle hydrodynamics (SPH) are very demanding in terms of computing time for large domains. Since the numerical integration of the governing equations is only carried out for each Particle on a restricted number of Neighbouring ones located inside a cut-off radius rc, a substantial part of the computational burden depends on the actual search procedure; it is therefore vital that efficient methods are adopted for such a search. The cut-off radius is indeed much lower than the typical domain's size; hence, the number of Neighbouring Particles is only a little fraction of the total number. Straightforward determination of which Particles are inside the interaction range requires the computation of all pair-wise distances, a procedure whose computational time would be unpractical or totally impossible for large problems. Two main strategies have been developed in the past in order to reduce the unnecessary computation of distances: the first based on dynamically storing each Particle's neighbourhood list (Verlet list) and the second based on a framework of fixed cells. The paper presents the results of a numerical sensitivity study on the efficiency of the two procedures as a function of such parameters as the Verlet size and the cell dimensions. An insight is given into the relative computational burden; a discussion of the relative merits of the different approaches is also given and some suggestions are provided on the computational and data structure of the neighbourhood search part of SPH codes. Copyright © 2008 John Wiley & Sons, Ltd.
Giacomo Viccione - One of the best experts on this subject based on the ideXlab platform.
-
Defining and optimizing algorithms for Neighbouring Particle identification in SPH fluid simulations
International Journal for Numerical Methods in Fluids, 2008Co-Authors: Giacomo Viccione, Vittorio Bovolin, E. Pugliese CarratelliAbstract:Lagrangian Particle methods such as smoothed Particle hydrodynamics (SPH) are very demanding in terms of computing time for large domains. Since the numerical integration of the governing equations is only carried out for each Particle on a restricted number of Neighbouring ones located inside a cut-off radius rc, a substantial part of the computational burden depends on the actual search procedure; it is therefore vital that efficient methods are adopted for such a search. The cut-off radius is indeed much lower than the typical domain's size; hence, the number of Neighbouring Particles is only a little fraction of the total number. Straightforward determination of which Particles are inside the interaction range requires the computation of all pair-wise distances, a procedure whose computational time would be unpractical or totally impossible for large problems. Two main strategies have been developed in the past in order to reduce the unnecessary computation of distances: the first based on dynamically storing each Particle's neighbourhood list (Verlet list) and the second based on a framework of fixed cells. The paper presents the results of a numerical sensitivity study on the efficiency of the two procedures as a function of such parameters as the Verlet size and the cell dimensions. An insight is given into the relative computational burden; a discussion of the relative merits of the different approaches is also given and some suggestions are provided on the computational and data structure of the neighbourhood search part of SPH codes. Copyright © 2008 John Wiley & Sons, Ltd.
Vittorio Bovolin - One of the best experts on this subject based on the ideXlab platform.
-
Defining and optimizing algorithms for Neighbouring Particle identification in SPH fluid simulations
International Journal for Numerical Methods in Fluids, 2008Co-Authors: Giacomo Viccione, Vittorio Bovolin, E. Pugliese CarratelliAbstract:Lagrangian Particle methods such as smoothed Particle hydrodynamics (SPH) are very demanding in terms of computing time for large domains. Since the numerical integration of the governing equations is only carried out for each Particle on a restricted number of Neighbouring ones located inside a cut-off radius rc, a substantial part of the computational burden depends on the actual search procedure; it is therefore vital that efficient methods are adopted for such a search. The cut-off radius is indeed much lower than the typical domain's size; hence, the number of Neighbouring Particles is only a little fraction of the total number. Straightforward determination of which Particles are inside the interaction range requires the computation of all pair-wise distances, a procedure whose computational time would be unpractical or totally impossible for large problems. Two main strategies have been developed in the past in order to reduce the unnecessary computation of distances: the first based on dynamically storing each Particle's neighbourhood list (Verlet list) and the second based on a framework of fixed cells. The paper presents the results of a numerical sensitivity study on the efficiency of the two procedures as a function of such parameters as the Verlet size and the cell dimensions. An insight is given into the relative computational burden; a discussion of the relative merits of the different approaches is also given and some suggestions are provided on the computational and data structure of the neighbourhood search part of SPH codes. Copyright © 2008 John Wiley & Sons, Ltd.
