IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v15y2022i7p2476-d781235.html
   My bibliography  Save this article

Verification of the Parallel Transport Codes Parafish and AZTRAN with the TAKEDA Benchmarks

Author

Listed:
  • Julian Duran-Gonzalez

    (Karlsruhe Institute of Technology (KIT), Institute of Neutron Physics and Reactor Technology (INR), Hermann-von-Helmholtz-Platz 1, 76344 Eggenstein-Leopoldshafen, Germany)

  • Victor Hugo Sanchez-Espinoza

    (Karlsruhe Institute of Technology (KIT), Institute of Neutron Physics and Reactor Technology (INR), Hermann-von-Helmholtz-Platz 1, 76344 Eggenstein-Leopoldshafen, Germany)

  • Luigi Mercatali

    (Karlsruhe Institute of Technology (KIT), Institute of Neutron Physics and Reactor Technology (INR), Hermann-von-Helmholtz-Platz 1, 76344 Eggenstein-Leopoldshafen, Germany)

  • Armando Gomez-Torres

    (Instituto Nacional de Investigaciones Nucleares, Departamento de Sistemas Nucleares, Carretera México-Toluca S/N, Ocoyoacac 52750, Mexico)

  • Edmundo del Valle-Gallegos

    (Instituto Politécnico Nacional, Escuela Superior de Física y Matemáticas, Av. IPN S/N, Alcaldía Gustavo A, Madero 07738, Mexico)

Abstract

With the increase in computational resources, parallel computation in neutron transport codes is inherent since it allows simulations with high spatial-angular resolution. Among the different methodologies available for the solution of the neutron transport equation, spherical harmonics ( P N ) and discrete-ordinates ( S N ) approximations have been widely used, as they are established classical methods for performing nuclear reactor calculations. This work focuses on describing and verifying two parallel deterministic neutron transport codes under development. The first one is the Parafish code that is based on the finite-element method and P N approximation. The second one is the AZTRAN code, based on the RTN-0 nodal method and S N approximation. The capabilities of these two codes have been tested on the TAKEDA benchmarks and the results obtained show good behavior and accuracy compared to the Monte Carlo reference solutions. Additionally, the speedup obtained by each code in the parallel execution is acceptable. In general, the results encourage further improvement in the codes to be comparable to other well-validated deterministic transport codes.

Suggested Citation

  • Julian Duran-Gonzalez & Victor Hugo Sanchez-Espinoza & Luigi Mercatali & Armando Gomez-Torres & Edmundo del Valle-Gallegos, 2022. "Verification of the Parallel Transport Codes Parafish and AZTRAN with the TAKEDA Benchmarks," Energies, MDPI, vol. 15(7), pages 1-16, March.
  • Handle: RePEc:gam:jeners:v:15:y:2022:i:7:p:2476-:d:781235
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/15/7/2476/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/15/7/2476/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Hennart, Jean-Pierre & del Valle, Edmundo, 2010. "Nodal finite element approximations for the neutron transport equation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 80(11), pages 2168-2176.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:gam:jeners:v:15:y:2022:i:7:p:2476-:d:781235. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.