Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/104830
DC FieldValue
dc.titleNumerical solutions of incompressible euler and navier-stokes equations by efficient discrete singular convolution method
dc.contributor.authorWan, D.C.
dc.contributor.authorWei, G.W.
dc.date.accessioned2014-10-28T03:12:20Z
dc.date.available2014-10-28T03:12:20Z
dc.date.issued2000
dc.identifier.citationWan, D.C.,Wei, G.W. (2000). Numerical solutions of incompressible euler and navier-stokes equations by efficient discrete singular convolution method. Acta Mechanica Sinica/Lixue Xuebao 16 (3) : 237-239. ScholarBank@NUS Repository.
dc.identifier.issn05677718
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/104830
dc.description.abstractAn efficient discrete singular convolution (DSC) method is introduced to the numerical solutions of incompressible Euler and Navier-Stokes equations with periodic boundary conditions. Two numerical tests of two-dimensional Navier-Stokes equations with periodic boundary conditions and Euler equations for doubly periodic shear layer flows are carried out by using the DSC method for spatial derivatives and fourth-order Runge-Kutta method for time advancement, respectively. The computational results show that the DSC method is efficient and robust for solving the problems of incompressible flows, and has the potential of being extended to numerically solve much broader problems in fluid dynamics.
dc.sourceScopus
dc.subjectDSC method
dc.subjectFourth-order Runge-Kutta method
dc.subjectIncompressible flows
dc.subjectPeriodic boundary
dc.typeArticle
dc.contributor.departmentCOMPUTATIONAL SCIENCE
dc.description.sourcetitleActa Mechanica Sinica/Lixue Xuebao
dc.description.volume16
dc.description.issue3
dc.description.page237-239
dc.description.codenAMSNE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


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