Abstract
We address the efficiency issue for the globally convergent convexification algorithm for coefficient inverse problems. By properly choosing the upper limit for pseudo-frequency and with quadratic polynomial approximations of the quantities which depend on the pseudo-frequency, we show that the algorithm can be made dramatically faster relative to the previous “tail-free” implementation. Numerical results from imaging and the mathematical modeling of antipersonnel land mines demonstrate that the algorithm can detect the location(s) of the inclusion(s) from the background medium, as well as correctly identify the material property of the inclusion(s) and the background. This indicates that the convexification algorithm may be applied in real-time to detect and image mine-like targets in the field.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
