View Document


Partial FFT Direct Parallel Algorithms forSubsurface Scattering Problems
College: Science & Engineering
ResourceLengthWidthThickness
Paper000
Specimen Elements
Pocatello
Unknown to Unknown
Ronald Gonzales
Idaho State University
Dissertation
No
2/24/2023
digital
City: Pocatello
Doctorate
The present research introduces a direct parallel partial fast Fourier transform (FFT) algorithm for the numerical solutions of the two- and three-dimensional Helmholtz equations. The governing equations are discretized by high-order compact finite difference methods. The resulting discretized system is indefinite, making the convergence of most iterative methods deteriorate as frequency increases. For indefinite systems parallel direct approaches are a better alternative, especially for systems with discontinuous and singular right-hand sides. The research focuses on the efficient parallel implementation of the proposed algorithm in both shared (OpenMP) and distributed (MPI) memory environments. The complexity and speed-up of the direct parallel methods are investigated on scattering problems with realistic ranges of parameters in air, soil and mine-like targets. Key Words: Parallel algorithm, direct solver, FFT, subsurface scattering, mine-like inclusions, OpenMP, MPI, high-order, Sommerfeld-like boundary conditions.

Partial FFT Direct Parallel Algorithms forSubsurface Scattering Problems

Necessary Documents

Paper

Document

Information
Paper -Document

2008 - 2016 Informatics Research Institute (IRI)
Version 0.6.1.5 | beta | 6 April 2016

Other Projects