Reducing memory requirements of unsteady adjoint by synergistically using check-pointing and compression
From MaRDI portal
Publication:6537401
DOI10.1002/fld.5136MaRDI QIDQ6537401
Kyriakos C. Giannakoglou, E. M. Papoutsis-Kiachagias, Andreas-Stefanos I. Margetis
Publication date: 14 May 2024
Published in: International Journal for Numerical Methods in Fluids (Search for Journal in Brave)
computational fluid dynamicsproper generalized decompositionunsteady adjointbinomial check-pointinglossless and lossy data compression algorithms
Cites Work
- Unnamed Item
- Continuous adjoint methods for turbulent flows, applied to shape and topology optimization: industrial applications
- Sensitivity analysis of limit cycle oscillations
- Continuous adjoint approach to the Spalart-Allmaras turbulence model for incompressible flows
- Solution of the implicitly discretized fluid flow equations by operator- splitting
- Towards efficient backward-in-time adjoint computations using data compression techniques
- Reduced order modelling for unsteady fluid flow using proper orthogonal decomposition and radial basis functions
- Lossy compression techniques supporting unsteady adjoint on 2D/3D unstructured grids
- A calculation procedure for heat, mass and momentum transfer in three- dimensional parabolic flows
- The proper generalized decomposition for advanced numerical simulations. A primer
- Optimal Multistage Algorithm for Adjoint Computation
- A Single Formula for the “Law of the Wall”
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Numerical study of the turbulent flow past an airfoil with trailing edge separation
- MultiStage Approaches for Optimal Offline Checkpointing
- Unsteady incompressible flows past two cylinders in tandem and staggered arrangements
- Algorithm 799: revolve
- Function minimization by conjugate gradients
Related Items (1)
This page was built for publication: Reducing memory requirements of unsteady adjoint by synergistically using check-pointing and compression
