Header menu link for other important links
X
Efficient random walks in the presence of complex two-dimensional geometries
, Surya C. Rajan
Published in
2007
Volume: 53
   
Issue: 2
Pages: 329 - 344
Abstract
This paper details an efficient algorithm for particles undergoing random walks in the presence of complex, two-dimensional, solid boundaries. The scheme is developed for the simulation of vortex diffusion using the random vortex method. Both vortex blobs and sheets are handled. The relevant modifications for using the algorithm with the vorticity redistribution technique are also discussed. The algorithm is designed to be used in the framework of an existing fast multipole implementation. A measure for the geometric complexity of a body is introduced and the algorithm's efficiency is studied as various parameters are changed for bodies of varying complexity. © 2007 Elsevier Ltd. All rights reserved.
About the journal
JournalComputers and Mathematics with Applications
ISSN08981221
Open AccessNo
Concepts (13)
  •  related image
    Algorithms
  •  related image
    Computational complexity
  •  related image
    Domain decomposition methods
  •  related image
    Vortex flow
  •  related image
    Vorticity
  •  related image
    Domain decomposition
  •  related image
    GEOMETRIC COMPLEXITY
  •  related image
    RANDOM VORTEX METHOD
  •  related image
    Random walks
  •  related image
    SOLID BOUNDARIES
  •  related image
    VORTEX DIFFUSION
  •  related image
    VORTICITY REDISTRIBUTION TECHNIQUE
  •  related image
    Random processes