Seeding and adjoining zero-halo partitioned parallel scientific codes

DOI10.1080/10556788.2019.1591404zbMATH Open1446.90002OpenAlexW2936347648MaRDI QIDQ5113718FDOQ5113718

Pavanakumar Mohanamuraly, Laurent Hascoët, Jens-Dominik Müller

Publication date: 16 June 2020

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://qmro.qmul.ac.uk/xmlui/handle/123456789/56467

zbMATH Keywords

fixed-point iterationalgorithmic differentiationcomputational fluid dynamics (CFD)gradient-based optimizationmessage passingadjoint source transformationparallel reverse mode

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Methods of reduced gradient type (90C52)

Cites Work

• Recipes for adjoint code construction
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Evaluating Derivatives
• Approximate Riemann solvers, parameter vectors, and difference schemes
• The Tapenade automatic differentiation tool
• Towards the ultimative conservative difference scheme. V: A second-order sequel to Godunov's method
• High performance parallel computing of flows in complex geometries
• Stabilisation of discrete steady adjoint solvers
• High-Performance Derivative Computations using CoDiPack
• Automatic Generation of Efficient Adjoint Code for a Parallel Navier-Stokes Solver

Uses Software

• ADOL-C
• OpenFOAM
• TAPENADE
• TAF
• OP2
• CoDiPack
• SU2
• STAMPS
• AMPI

This page was built for publication: Seeding and adjoining zero-halo partitioned parallel scientific codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113718)