English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49287/83828 (59%)
Visitors : 7150388      Online Users : 70
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45989


    Title: A segregated solution algorithm for incompressible flows in general co-ordinates
    Authors: Sheu, Tony W. H.;Lee, Shi-Min
    Contributors: 淡江大學航空太空工程學系
    Keywords: Incompressible Flow;Navier-Stokes Equations;Pressure Fields
    Date: 1996-03
    Issue Date: 2013-03-20 16:20:54 (UTC+8)
    Publisher: Chichester: John Wiley & Sons Ltd.
    Abstract: To analyse an incompressible Navier–Stokes flow problem in a boundary- fitted curvilinear co-ordinate system is definitely not a trivial task. In the primitive variable formulation, choices between working variables and their storage points have to be made judiciously. The present work engages contravariant velocity components and scalar pressure which stagger each other in the mesh to prevent even–odd pressure oscillations from emerging. Now that smoothness of the pressure field is attainable, the remaining task is to ensure a discrete divergence-free velocity field for an incompressible flow simulation. Aside from the flux discretizations, the indispensable metric tensors, Jacobian and Christoffel symbols in the transformed equations should be approximated with care. The guiding idea is to get the property of geometric identity pertaining to these grid-sensitive discretizations. In addition, how to maintain the revertible one-to-one equivalence at the discrete level between primitive and contravariant velocities is another theme in the present staggered formulation. A semi-implicit segregated solution algorithm felicitous for a large-scale flow simulation was utilized to solve the entire set of basic equations iteratively. Also of note is that the present segregated solution algorithm has the virtue of requiring no user-specified relaxation parameters for speeding up the satisfaction of incompressibility in an optimal sense. Three benchmark problems, including an analytic problem, were investigated to justify the capability of the present formulation in handling problems with complex geometry. The test cases considered and the results obtained herein make a useful contribution in solving problems subsuming cells with arbitrary shapes in a boundary-fitted grid system.
    Relation: International Journal for Numerical Methods in Fluids 22(6), pp.515-548
    DOI: 10.1002/(SICI)1097-0363(19960330)22:63.0.CO;2-N
    Appears in Collections:[航空太空工程學系暨研究所] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML107View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback