Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao https://doi.org/10.1...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
https://doi.org/10.1115/imece2...
Article . 2000 . Peer-reviewed
License: ASME Site License Agreemen
Data sources: Crossref
versions View all 1 versions
addClaim

Numerical Simulation of Taylor Vortex Flow by GDQ Method

Authors: L. Wang; C. Shu; Y. T. Chew;

Numerical Simulation of Taylor Vortex Flow by GDQ Method

Abstract

Abstract In this study, the GDQ method was used to simulate a specific flow regime, Taylor vortex flow, of the motion of fluids between two concentric cylinders with rotating inner cylinder and stationary outer cylinder. An approach combining the SIMPLE strategy and GDQ discretization based on non-staggered mesh was proposed to solve the time-dependent, three-dimensional incompressible Navier-Stokes equations in primitive variable form. The numerical solution obtained has the accuracy of second-order in temporal discretization and high-order in spatial discretization. Also, this numerical code may allow the direct numerical simulations for the various regimes of Couette-Taylor flow problem. The performance of this approach was studied through a test case of Taylor vortex flow. The reported numerical results were compared with those from others. For this approach, accurate numerical results can be obtained by using fewer grid points compared with low-order methods. As a consequence, the computational effort can be greatly reduced.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!