Frequency-domain wave scattering problems that arise in acoustics and electromagnetism can be often described by the Helmholtz equation. This work presents a boundary integral equation method for the Helmholtz equation in 3-D multilayered media with many doubly periodic smooth layers. Compared with conventional quasi-periodic Green’s function method, the new method is robust at all scattering parameters. A periodizing scheme is used to decompose the solution into near-and far-field contributions. The near-field contribution uses the free-space Green’s function in an integral equation on the interface in the unit cell and its immediate eight neighbors; the far-field contribution uses proxy point sources that enclose the unit cell. A specialized high-order quadrature is developed to discretize the underlying surface integral operators to keep the number of unknowns per layer small. We achieve overall linear computational complexity in the number of layers by reducing the linear system into block tridiagonal form and then solving the system directly via block LU decomposition. The new solver is capable of handling a 100-interface structure with 961.3k unknowns to 10−5 accuracy in less than 2 hours on a desktop workstation.
more »
« less
Improved least-squares migration through double-sweeping solver
Based on a recently developed approximate wave-equation solver, we have developed a methodology to reduce the computational cost of seismic migration in the frequency domain. This approach divides the domain of interest into smaller subdomains, and the wavefield is computed using a sequential process to determine the downward- and upward-propagating wavefields — hence called a double-sweeping solver. A sequential process becomes possible using a special approximation of the interface conditions between subdomains. This method is incorporated into the least-squares migration framework as an approximate solver. The associated computational effort is comparable to one-way wave-equation approaches, yet, as illustrated by the numerical examples, the accuracy and convergence behavior are comparable to that of the full-wave equation.
more »
« less
- Award ID(s):
- 2111234
- PAR ID:
- 10466777
- Publisher / Repository:
- SEG
- Date Published:
- Journal Name:
- GEOPHYSICS
- Volume:
- 88
- Issue:
- 3
- ISSN:
- 0016-8033
- Page Range / eLocation ID:
- S131 to S141
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
This work aims at comparing the accuracy and overall performance of a low-Mach CFD solver and a fully-compressible CFD solver for direct numerical simulation (DNS) of nonequilibrium plasma assisted ignition (PAI) using a phenomenological model described in Castela et al. [1]. The phenomenological model describes the impact of nanosecond pulsed plasma discharges by introducing source terms in the reacting flow equations, instead of solving the detailed plasma kinetics at every time step of the discharge. Ultra-fast gas heating and dissociation ofO2 are attributed to the electronic excitation ofN2 and the subsequent quenching to ground state. This process is highly exothermic, and is responsible for dissociation of O2 to form O radicals; both of which promote faster ignition. Another relatively slower process of gas heating associated with vibrational-to-translational relaxation is also accounted for, by solving an additional vibrational energy transport equation. A fully-compressible CFD solver for high Mach (M>0.2) reacting flows, developed by extending the default rhoCentralFoam solver in OpenFOAM, is used to perform DNS of PAI in a 2D domain representing a cross section of a pin-to-pin plasma discharge configuration. The same case is also simulated using a low-Mach, pressure-based CFD solver, built by extending the default reactingFoam solver. The lack of flow or wave dominated transport after the plasma-induced weak shock wave leaves the domain causes inaccurate computation of all the transport variables, with a rather small time step dictated by the CFL condition, with the fully-compressible solver. These issues are not encountered in the low-Mach solver. Finally, the low-Mach solver is used to perform DNS of PAI in lean, premixed, isotropic turbulent mixtures of CH4-air at two different Reynolds numbers of 44 and 395. Local convection of the radicals and vibrational energy from the discharge domain, and straining of the high temperature reaction zones resulted in slower ignition of the case with the higher Re. A cascade effect of temperature reduction in the more turbulent case also resulted in a five - six times smaller value of the vibrational to translational gas heating source term, which further inhibited ignition. Two pulses were sufficient for ignition of the Re = 44 case, whereas three pulses were required for the Re = 395 case; consistent with the results of Ref. [1].more » « less
-
In this paper, we develop a Finite Volume solver for a 3D incompressible Oldroyd-B model with infinity relaxation time. The Finite Volume solver is implemented by using a lead- ing open-source computational mechanics software OpenFOAM. We have imposed the di- vergence free condition as a constraint on the momentum equation to derive a pressure equation and a predictor-corrector procedure is applied when solving the velocity field. Both stability analysis and numerical experiments are given to show the robustness and accuracy of our algorithm. Two concrete examples on a cubical domain and a dumbbell are computed and illustrated.more » « less
-
The objective of this paper is to develop efficient numerical algorithms for the linear advection-diffusion equation in fractured porous media. A reduced fracture model is considered where the fractures are treated as interfaces between subdomains and the interactions between the fractures and the surrounding porous medium are taken into account. The model is discretized by a backward Euler upwind-mixed hybrid finite element method in which the flux variable represents both the advective and diffusive fluxes. The existence, uniqueness, as well as optimal error estimates in both space and time for the fully discrete coupled problem are established. Moreover, to facilitate different time steps in the fracture-interface and the subdomains, global-in-time, nonoverlapping domain decomposition is utilized to derive two implicit iterative solvers for the discrete problem. The first method is based on the time-dependent Steklov–Poincaré operator, while the second one employs the optimized Schwarz waveform relaxation (OSWR) approach with Ventcel-Robin transmission conditions. A discrete space-time interface system is formulated for each method and is solved iteratively with possibly variable time step sizes. The convergence of the OSWR-based method with conforming time grids is also proved. Finally, numerical results in two dimensions are presented to verify the optimal order of convergence of the monolithic solver and to illustrate the performance of the two decoupled schemes with local time-stepping on problems of high Péclet numbers.more » « less
-
This paper presents a method that uses neural networks as a caching mechanism to reduce the variance of Monte Carlo Partial Differential Equation solvers, such as the Walk-on-Spheres algorithm [Sawhney and Crane 2020]. While these Monte Carlo PDE solvers have the merits of being unbiased and discretization-free, their high variance often hinders real-time applications. On the other hand, neural networks can approximate the PDE solution, and evaluating these networks at inference time can be very fast. However, neural-network-based solutions may suffer from convergence difficulties and high bias. Our hybrid system aims to combine these two potentially complementary solutions by training a neural field to approximate the PDE solution using supervision from a WoS solver. This neural field is then used as a cache in the WoS solver to reduce variance during inference. We demonstrate that our neural field training procedure is better than the commonly used self-supervised objectives in the literature. We also show that our hybrid solver exhibits lower variance than WoS with the same computational budget: it is significantly better for small compute budgets and provides smaller improvements for larger budgets, reaching the same performance as WoS in the limit.more » « less
An official website of the United States government

