• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Parallel-in-time adjoint-based optimization – application to unsteady incompressible flows

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Adjoint_based_optimisation_algorithm-3 (1)_removed.pdf
    Size:
    16.25Mb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Embargo End Date:
    2024-10-12
    Download
    Type
    Article
    Authors
    Costanzo, S.
    Sayadi, T. cc
    Fosas de Pando, M.
    Schmid, Peter J. cc
    Frey, P.
    KAUST Department
    Department of Mechanical Engineering, KAUST, 23955 Thuwal, Saudi Arabia
    Mechanical Engineering Program
    Physical Science and Engineering (PSE) Division
    Date
    2022-10-12
    Embargo End Date
    2024-10-12
    Permanent link to this record
    http://hdl.handle.net/10754/684308
    
    Metadata
    Show full item record
    Abstract
    Gradient-based optimization algorithms, where gradient information is extracted using adjoint equations, are efficient but can quickly slow down when applied to unsteady and nonlinear flow problems. This is mainly due to the sequential nature of the algorithm, where the primal problem is first integrated forward in time, providing the initial condition for the adjoint problem, which is then integrated backward. In order to address the sequential nature of this optimization procedure parallel-in-time algorithms can be employed. However, the characteristics of the governing equations of interest in this work, and in particular, the divergence-free constraint (incompressibility effect) as well as the nonlinearity and the unsteadiness of the flow, make direct application of existing parallel-in-time algorithms less than straightforward. In this work, we introduce a parallel-in-time procedure, applied to the integration of the adjoint problem, which addresses all the existing constraints and allows quick access to local gradients. The performance of the proposed algorithm is assessed for both steady and unsteady actuation; in both cases it readily outperforms the sequential algorithm.
    Citation
    Costanzo, S., Sayadi, T., Fosas de Pando, M., Schmid, P. J., & Frey, P. (2022). Parallel-in-time adjoint-based optimization – application to unsteady incompressible flows. Journal of Computational Physics, 471, 111664. https://doi.org/10.1016/j.jcp.2022.111664
    Sponsors
    M.F.P. gratefully acknowledges financial support from MINECO/AEI and FEDER/UE through grant DPI2016-75777-R.
    Publisher
    Elsevier BV
    Journal
    Journal of Computational Physics
    DOI
    10.1016/j.jcp.2022.111664
    Additional Links
    https://linkinghub.elsevier.com/retrieve/pii/S0021999122007276
    https://hal.archives-ouvertes.fr/hal-03852515/document
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.jcp.2022.111664
    Scopus Count
    Collections
    Articles; Physical Science and Engineering (PSE) Division; Mechanical Engineering Program

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.