IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-59354-3_25.html

Implicit LU Time Integration Using Domain Decomposition and Overlapping Grids

In: High Performance Computing in Science and Engineering ’02

Author

Listed:
  • Peter Gerlinger

    (Institut für Verbrennungstechnik)

  • Peter Stoll

    (Institut für Thermodynamik der Luft- und Raumfahrt)

  • Fernando Schneider

    (Institut für Verbrennungstechnik)

  • Manfred Aigner

    (Institut für Verbrennungstechnik)

Abstract

An implicit LU-SGS (Lower-Upper Symmetrie Gauss-Seidel) algorithm is used for the simulation of reactive and non-reactive three dimensional high speed flows (supersonic combustion). The numerical method is based on an all Mach number preconditioning to enable convergence of the compressible flow solver in the low Mach number limit. The code is fully vectorized and may be used on massively parallel computers using MPI. Parallelization is performed by domain decomposition which causes losses in efficiency of the implicit numerical solver. Therefore overlapping domains are introduced to reduce both losses in convergence rate as well as in robustness. A comparison with non-intersecting grids demonstrates the effectiveness of this method. To investigate both approaches a 3-D turbulent Mach 3.85 supersonic ramp flow with shock wave boundary-layer interaction is chosen. The simulations use up to 256 nodes on a Cray T3E and up to 16384 blocks for the discretization of the computational domain. In addition results for a 3-D supersonic ramp combustor are presented. The finite-rate chemistry reaction mechanism involves 20 reactions and 9 different species.

Suggested Citation

  • Peter Gerlinger & Peter Stoll & Fernando Schneider & Manfred Aigner, 2003. "Implicit LU Time Integration Using Domain Decomposition and Overlapping Grids," Springer Books, in: Egon Krause & Willi Jäger (ed.), High Performance Computing in Science and Engineering ’02, pages 311-322, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-59354-3_25
    DOI: 10.1007/978-3-642-59354-3_25
    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-3-642-59354-3_25. 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.