Number of the records: 1  

Parallel iterative solution of the incompressible Navier-Stokes equations with application to rotating wings

  1. 1.
    SYSNO ASEP0448127
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleParallel iterative solution of the incompressible Navier-Stokes equations with application to rotating wings
    Author(s) Šístek, Jakub (MU-W) RID, ORCID, SAI
    Cirak, F. (GB)
    Source TitleComputers & Fluids. - : Elsevier - ISSN 0045-7930
    Roč. 122, 20 November (2015), s. 165-183
    Number of pages19 s.
    Languageeng - English
    CountryGB - United Kingdom
    KeywordsNavier-Stokes ; incompressible flow ; Krylov subspace methods
    Subject RIVBA - General Mathematics
    R&D ProjectsGA14-02067S GA ČR - Czech Science Foundation (CSF)
    Institutional supportMU-W - RVO:67985840
    UT WOS000363828200013
    EID SCOPUS84942244914
    DOI10.1016/j.compfluid.2015.08.026
    AnnotationWe discuss aspects of implementation and performance of parallel iterative solution techniques applied to low Reynolds number flows around fixed and moving rigid bodies. The incompressible Navier–Stokes equations are discretised with Taylor-Hood finite elements in combination with a semi-implicit pressure-correction method. The resulting sequence of convection–diffusion and Poisson equations are solved with preconditioned Krylov subspace methods. To achieve overall scalability we consider new auxiliary algorithms for mesh handling and assembly of the system matrices. We compute the flow around a translating plate and a rotating insect wing to establish the scaling properties of the developed solver. The largest meshes have up to 132 × 106 hexahedral finite elements leading to around 3.3 × 109 unknowns. For the scalability runs the maximum core count is around 65.5 × 103.
    WorkplaceMathematical Institute
    ContactJarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
    Year of Publishing2016
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.