EconPapers    
Economics at your fingertips  
 

Fast multipole singular boundary method for Stokes flow problems

Wenzhen Qu, Wen Chen, Zhuojia Fu and Yan Gu

Mathematics and Computers in Simulation (MATCOM), 2018, vol. 146, issue C, 57-69

Abstract: This paper firstly employs the fast multipole method (FMM) to accelerate the singular boundary method (SBM) solution of the Stokes equation. We present a fast multipole singular boundary method (FMSBM) based on the combination of the SBM and the FMM. The proposed FMSBM scheme reduces CPU operations and memory requirements by one order of magnitude, namely O(N) (where N is the number of boundary nodes). Thus, the strategy overcomes costly expenses of the SBM due to its dense interpolation matrix while keeping its major merits being free of mesh, boundary-only discretization, and high accuracy in the solution of the Stokes equation. The performance of this scheme is tested to a few benchmark problems. Numerical results demonstrate its efficiency, accuracy and applicability.

Keywords: Fast multipole method; Singular boundary method; Meshless boundary collocation method; Stokes flow problems (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475417303397
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:146:y:2018:i:c:p:57-69

DOI: 10.1016/j.matcom.2017.10.001

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().

 
Page updated 2025-03-19
Handle: RePEc:eee:matcom:v:146:y:2018:i:c:p:57-69