Seeding and adjoining zero-halo partitioned parallel scientific codes
From MaRDI portal
Publication:5113718
Recommendations
- scientific article; zbMATH DE number 5353274
- Parallelizable adjoint stencil computations using transposed forward-mode algorithmic differentiation
- Automatic Generation of Efficient Adjoint Code for a Parallel Navier-Stokes Solver
- Adjoints of large simulation codes through automatic differentiation
- Algorithmic Differentiation of Code with Multiple Context-Specific Activities
Cites work
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Approximate Riemann solvers, parameter vectors, and difference schemes
- Automatic Generation of Efficient Adjoint Code for a Parallel Navier-Stokes Solver
- Evaluating Derivatives
- High performance parallel computing of flows in complex geometries
- High-performance derivative computations using CoDiPack
- Recipes for adjoint code construction
- Stabilisation of discrete steady adjoint solvers
- The Tapenade automatic differentiation tool, principles, model, and specification
- Towards the ultimative conservative difference scheme. V: A second-order sequel to Godunov's method
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)