Reducing memory requirements of unsteady adjoint by synergistically using check-pointing and compression (Q6537401)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reducing memory requirements of unsteady adjoint by synergistically using check-pointing and compression |
scientific article; zbMATH DE number 7847123
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reducing memory requirements of unsteady adjoint by synergistically using check-pointing and compression |
scientific article; zbMATH DE number 7847123 |
Statements
Reducing memory requirements of unsteady adjoint by synergistically using check-pointing and compression (English)
0 references
14 May 2024
0 references
binomial check-pointing
0 references
computational fluid dynamics
0 references
lossless and lossy data compression algorithms
0 references
proper generalized decomposition
0 references
unsteady adjoint
0 references
0 references
0 references
0 references
0 references
0 references
