Please use this identifier to cite or link to this item:
Title: A fast algorithm for modelling multiple bubbles dynamics
Keywords: A Fast Algorithm For Modelling Multiple Bubbles Dynamics
Issue Date: 24-Jan-2006
Citation: BUI THANH TU (2006-01-24). A fast algorithm for modelling multiple bubbles dynamics. ScholarBank@NUS Repository.
Abstract: This work presents the development of a numerical strategy to combine the Fast Fourier Transforms on Multipoles (FFTM) method and the Boundary Element Method (BEM) to study the dynamics of multiple bubbles physics in a moving boundary problem. The disadvantage of the BEM is to solve the boundary integral equation by generating a very dense matrix system which requires much memory storage and calculations. The FFTM method speeds up the calculation of the boundary integral equation by approximating the far field potentials with multipole and local expansions. It is demonstrated that FFTM is an accurate and efficient method. However, one major drawback of the method is that its efficiency deteriorates quite significantly when the problem is full of empty spaces if the multiple bubbles are well-separated. To overcome this limitation, a new version of FFTM Clustering is proposed. The original FFTM is used to compute the potential contributions from the bubbles within its own group, while contributions from the other separated groups are evaluated via the multipole to local expansions translations operations directly. We tested the FFTM Clustering on some multiple bubble examples to demonstrate its improvement in efficiency over the original method. The efficiency of the FFTM and FFTM Clustering allows us to extend the number of bubbles in a simulation. Physical behavior of multiple bubbles is also presented in this work.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Master thesis-Bui thanh Tu 2005.pdf4.31 MBAdobe PDF



Page view(s)

checked on Apr 20, 2019


checked on Apr 20, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.