.png){kind=icon}
Return
Reverse time migration with optimal checkpointing
.png){kind=icon}
PRE
AI
DOI：10.1190/1.2742686.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
INVERSION
Journal
IF:
3.2
Papers:
8.4K
Citations:
3.3W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSave
Artificial Intelligence in the Diagnosis and Treatment of Pancreatic Cystic Lesions and Adenocarcinoma.png)
Cancers
OAAI
CancersIF0
OAAIShareSaveShareSaveShareSaveShareSave
View more