IDEAS home Printed from https://ideas.repec.org/a/bpj/mcmeap/v29y2023i2p95-126n4.html
   My bibliography  Save this article

A time-step-robust algorithm to compute particle trajectories in 3-D unstructured meshes for Lagrangian stochastic methods

Author

Listed:
  • Balvet Guilhem

    (EDF R&D, 6 Quai Watier, 78400, Chatou, France ; and CEREA, École des Ponts, EDF R&D, Île-de-France, France)

  • Minier Jean-Pierre
  • Ferrand Martin

    (EDF R&D, 6 Quai Watier, 78400, Chatou, France ; and CEREA, École des Ponts, EDF R&D, Île-de-France, France)

  • Henry Christophe

    (Université Côte d’Azur, Inria, CNRS, Sophia-Antipolis, France)

  • Roustan Yelva

    (CEREA, École des Ponts, Champs-sur-Marne, ; and EDF R&D, Île-de-France, France)

Abstract

The purpose of this paper is to propose a time-step-robust cell-to-cell integration of particle trajectories in 3-D unstructured meshes in particle/mesh Lagrangian stochastic methods. The main idea is to dynamically update the mean fields used in the time integration by splitting, for each particle, the time step into sub-steps such that each of these sub-steps corresponds to particle cell residence times. This reduces the spatial discretization error. Given the stochastic nature of the models, a key aspect is to derive estimations of the residence times that do not anticipate the future of the Wiener process. To that effect, the new algorithm relies on a virtual particle, attached to each stochastic one, whose mean conditional behavior provides free-of-statistical-bias predictions of residence times. After consistency checks, this new algorithm is validated on two representative test cases: particle dispersion in a statistically uniform flow and particle dynamics in a non-uniform flow.

Suggested Citation

  • Balvet Guilhem & Minier Jean-Pierre & Ferrand Martin & Henry Christophe & Roustan Yelva, 2023. "A time-step-robust algorithm to compute particle trajectories in 3-D unstructured meshes for Lagrangian stochastic methods," Monte Carlo Methods and Applications, De Gruyter, vol. 29(2), pages 95-126, June.
  • Handle: RePEc:bpj:mcmeap:v:29:y:2023:i:2:p:95-126:n:4
    DOI: 10.1515/mcma-2023-2002
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/mcma-2023-2002
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.

    File URL: https://libkey.io/10.1515/mcma-2023-2002?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:bpj:mcmeap:v:29:y:2023:i:2:p:95-126:n:4. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.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.