IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-94-011-4193-2_21.html
   My bibliography  Save this book chapter

Iterative Space-Marching Method for Compressible Flows at All Speeds

In: Applied and Industrial Mathematics, Venice—2, 1998

Author

Listed:
  • N. K. Yamaleev

    (Inst. of Mathematics)

  • J. Ballmann

    (RWTH Aachen, LFM)

Abstract

A new iterative fully coupled implicit space—marching method is proposed for solving the 2-D steady Euler equations for compressible flows at Mach numbers ranging from subsonic to supersonic. A special treatment of the streamwise pressure gradient component permits us to calculate both supersonic flow regions where the Euler equations are hyperbolic and subsonic regions where the equations reveal elliptic properties. To take into account the elliptic effects of subsonic and transonic flows space—marching sweeps are carried out iteratively. A new parabolic pressure correction procedure is developed to accelerate the convergence rate. This procedure can be applied for subsonic and transonic regimes and is consistent with the characteristic analysis of the Euler equations. At each marching station a Newton iterative technique is used to solve the nonlinear system of equations in a fully coupled manner. To resolve strong shocks and contact discontinuities as well as smooth flow fields with high accuracy implicit second—order symmetric TVD and second—order upwind Richardson schemes are employed to approximate the transverse and streamwise derivatives, respectively. Numerical calculations show that the method is accurate, robust and can efficiently be applied for calculating subsonic, transonic and supersonic flows without streamwise separation.

Suggested Citation

  • N. K. Yamaleev & J. Ballmann, 2000. "Iterative Space-Marching Method for Compressible Flows at All Speeds," Springer Books, in: Renato Spigler (ed.), Applied and Industrial Mathematics, Venice—2, 1998, pages 295-304, Springer.
  • Handle: RePEc:spr:sprchp:978-94-011-4193-2_21
    DOI: 10.1007/978-94-011-4193-2_21
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-94-011-4193-2_21. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.