Paper
30 May 2022 Scalable FFT-Krylov subspace method for landmine imaging problem
Author Affiliations +
Abstract
The objective of this paper is to present an efficient parallel implementation of the iterative compact high-order approximation numerical solver for 3D Helmholtz equation on multicore computers. The high-order parallel iterative algorithm is built upon a combination of a Krylov subspace-type method with a direct parallel Fast Fourier transform (FFT) type preconditioner from the authors’ previous work, as shown in Ref. 7. In this paper, we will be presenting the result of our algorithm by computationally simulating data with realistic ranges of parameters in soil and mine-like targets. Our algorithm will also be incorporating second, fourth, and sixth-order compact finite difference schemes. The accuracy and result of the fourth and sixth-order compact approximation will be shown alongside the scalability of our implementation in the parallel programming environment.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yun Teck Lee and Yury Gryazin "Scalable FFT-Krylov subspace method for landmine imaging problem", Proc. SPIE 12116, Chemical, Biological, Radiological, Nuclear, and Explosives (CBRNE) Sensing XXIII, 121160Y (30 May 2022); https://doi.org/10.1117/12.2618712
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithm development

Iterative methods

Land mines

Matrices

Numerical analysis

Signal processing

Computer programming

Back to Top