.png){kind=icon}
返回
Reverse time migration with optimal checkpointing
.png){kind=icon}
PRE
AI
DOI：10.1190/1.2742686.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Reverse time migration (RTM) requires that fields computed in forward time be accessed in reverse order. Such out-of-order access, to recursively computed fields, requires that some part of the recursion history be stored (checkpointed), with the remainder computed by repeating parts of the forward computation. Optimal checkpointing algorithms choose checkpoints in such a way that the total storage is minimized for a prescribed level of excess computation, or vice versa. Optimal checkpointing dramatically reduces the storage required by RTM, compared to that needed for nonoptimal implementations, at the price of a small increase in computation. This paper describes optimal checkpointing in a form which applies both to RTM and other applications of the adjoint state method, such as construction of velocity updates from prestack wave equation migration.
Keyword:
INVERSION
期刊
IF:
3.2
论文数:
8.4K
被引数:
3.3W
机构
暂无机构信息
引用论文
Synthesis of Novel Naphthoquinone Fused Cyclic a-Aminophosphonates新型萘醌稠合环α-氨基膦酸酯的合成.png)
HETEROCYCLES
OAAI
HETEROCYCLESIF0
OAAI分享收藏Artificial Intelligence in the Diagnosis and Treatment of Pancreatic Cystic Lesions and AdenocarcinomaCancers
OAAI
CancersIF0
OAAI分享收藏
查看更多内容