Record Details

Efficient random walks in the presence of complex two-dimensional geometries

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Efficient random walks in the presence of complex two-dimensional geometries
 
Creator RAMACHANDRAN, P
RAMAKRISHNA, A
RAJAN, SC
 
Subject discrete vortex method
fast multipole method
impulsively started cylinder
high-resolution simulations
particle simulations
unsteady-flow
algorithm
equations
square
random walk
vortex diffusion
domain decomposition
geometric complexity
 
Description 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. (C) 2007
 
Publisher PERGAMON-ELSEVIER SCIENCE LTD
 
Date 2011-08-24T05:26:58Z
2011-12-26T12:56:45Z
2011-12-27T05:45:57Z
2011-08-24T05:26:58Z
2011-12-26T12:56:45Z
2011-12-27T05:45:57Z
2007
 
Type Article
 
Identifier COMPUTERS & MATHEMATICS WITH APPLICATIONS, 53(2), 329-344
0898-1221
http://dx.doi.org/10.1016/j.camwa.2006.02.050
http://dspace.library.iitb.ac.in/xmlui/handle/10054/10773
http://hdl.handle.net/10054/10773
 
Language en