{"title":"A gradient-optimized least-squares reverse time migration based on the safe type-I anderson acceleration","authors":"Yingming Qu , Chongpeng Huang","doi":"10.1016/j.cageo.2025.105984","DOIUrl":null,"url":null,"abstract":"<div><div>Least-squares reverse time migration (LSRTM) can generate preferable images for complex media, but faces substantial computational challenges in field data applications, especially in 3D cases. Many optimization algorithms have been proposed to alleviate this problem, such as the limited-memory Broyden-Fletcher-Goldfarb-Shanno (LBFGS) method, the restarted generalized minimal residual method, and Anderson acceleration (AA). AA is a popular gradient optimization algorithm that has been widely used in many fields due to its ability to greatly accelerate the convergence of fixed-point iterations and considerably reduce the computational cost. According to Broyden's method, AA is divided into type-I AA (AA-I) and type-II AA (AA-II), with most implementations favoring AA-II due to residual oscillation issues observed in AA-I during data residual minimization. To address the residual vibration issue of AA-I and expedite the convergence of LSRTM, we apply a safe AA-I method to LSRTM, incorporating Powell-type regularization, re-start checking, and safe guarding steps. The Powell-type regularization guarantees the non-singularity of AA-I, while the re-start checking preserves its strong linear independence, both contributing to the stability of AA-I. The safe guarding steps examine the data residual reduction and accelerate the convergence. Our analysis reveals that the optimal step length for the safe AA-I method is approximately 5 times or 10 times the initial steepest descent (SD) iteration. We also derive an exponential scaling law for the safe AA-I step length. In addition, the safe AA-I has faster data residual convergence speed, less computational cost, and higher quality images than SD, conjugate gradient (CG), AA-II, and LBFGS. The safe AA-I is approximately twice as efficient as the LBFGS. Field validation through land seismic data processing shows that LSRTM based on the safe AA-I delivers enhanced structural resolution with sharper imaging events and improved stratigraphic continuity relative to LBFGS-based implementations.</div></div>","PeriodicalId":55221,"journal":{"name":"Computers & Geosciences","volume":"204 ","pages":"Article 105984"},"PeriodicalIF":4.2000,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Geosciences","FirstCategoryId":"89","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0098300425001347","RegionNum":2,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Least-squares reverse time migration (LSRTM) can generate preferable images for complex media, but faces substantial computational challenges in field data applications, especially in 3D cases. Many optimization algorithms have been proposed to alleviate this problem, such as the limited-memory Broyden-Fletcher-Goldfarb-Shanno (LBFGS) method, the restarted generalized minimal residual method, and Anderson acceleration (AA). AA is a popular gradient optimization algorithm that has been widely used in many fields due to its ability to greatly accelerate the convergence of fixed-point iterations and considerably reduce the computational cost. According to Broyden's method, AA is divided into type-I AA (AA-I) and type-II AA (AA-II), with most implementations favoring AA-II due to residual oscillation issues observed in AA-I during data residual minimization. To address the residual vibration issue of AA-I and expedite the convergence of LSRTM, we apply a safe AA-I method to LSRTM, incorporating Powell-type regularization, re-start checking, and safe guarding steps. The Powell-type regularization guarantees the non-singularity of AA-I, while the re-start checking preserves its strong linear independence, both contributing to the stability of AA-I. The safe guarding steps examine the data residual reduction and accelerate the convergence. Our analysis reveals that the optimal step length for the safe AA-I method is approximately 5 times or 10 times the initial steepest descent (SD) iteration. We also derive an exponential scaling law for the safe AA-I step length. In addition, the safe AA-I has faster data residual convergence speed, less computational cost, and higher quality images than SD, conjugate gradient (CG), AA-II, and LBFGS. The safe AA-I is approximately twice as efficient as the LBFGS. Field validation through land seismic data processing shows that LSRTM based on the safe AA-I delivers enhanced structural resolution with sharper imaging events and improved stratigraphic continuity relative to LBFGS-based implementations.
期刊介绍:
Computers & Geosciences publishes high impact, original research at the interface between Computer Sciences and Geosciences. Publications should apply modern computer science paradigms, whether computational or informatics-based, to address problems in the geosciences.