Please use this identifier to cite or link to this item:
|Title:||Discrete singular convolution-finite subdomain method for the solution of incompressible viscous flows||Authors:||Wan, D.C.
|Issue Date:||20-Jul-2002||Citation:||Wan, D.C., Patnaik, B.S.V., Wei, G.W. (2002-07-20). Discrete singular convolution-finite subdomain method for the solution of incompressible viscous flows. Journal of Computational Physics 180 (1) : 229-255. ScholarBank@NUS Repository. https://doi.org/10.1006/jcph.2002.7089||Abstract:||This paper proposes a discrete singular convolution-finite subdomain method (DSC-FSM) for the analysis of incompressible viscous flows in multiply connected complex geometries. The DSC algorithm has its foundation in the theory of distributions. A block-structured grid of fictitious overlapping interfaces is designed to decompose a complex computational geometry into a finite number of subdomains. In each subdomain, the governing Navier-Stokes equations are discretized by using the DSC algorithm in space and a third-order Runge-Kutta scheme in time. Information exchange between fictitious overlapping zones is realized by using the DSC interpolating algorithm. The Taylor problem, with decaying vortices, could be solved to machine precision, with an excellent comparison against the exact solution. The reliability of the proposed method is tested by simulating the flow in a lid-driven cavity. The utility of the DSC-FSM approach is further illustrated by two other benchmark problems, viz., the flow over a backward-facing step and the laminar flow past a square prism. The present results compare well with the numerical and experimental data available in the literature. © 2002 Elsevier Science (USA).||Source Title:||Journal of Computational Physics||URI:||http://scholarbank.nus.edu.sg/handle/10635/104761||ISSN:||00219991||DOI:||10.1006/jcph.2002.7089|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.