arXiv subjects

Nour G. Al Hassanieh

Publications and source records attributed to Nour G. Al Hassanieh.

4 recordsLinked to original sources

arXiv2026

A spectral method for the rapid evaluation of hyperbolic potentials in two dimensions using windowed Fourier projection

We present a fast algorithm for evaluating the (non-smooth) solution of the free-space two-dimensional (2D) scalar wave equation with many point sources, each with a high-frequency band-limited time signature. Such an algorithm is key to an efficient time-domain scattering solver using spatially-discretized hyperbolic layer potentials. Given $M$ sources/targets and $N_t$ time steps, direct evaluation costs $O(M^2N_t^2)$, due to the history dependence. We develop a quasi-linear scaling algorithm that splits the solution at a given time into (a) a non-smooth time-local part, (b) a (smooth) near history involving sources up to ${\mathcal O}(1)$ domain traversal times into the past, plus (c) a (very smooth) far history comprising all waves emitted before the near history. The local part is computed directly via high-order quadrature. A naive spatial Fourier transform for (b) plus (c) would be both slowly converging and arbitrarily oscillatory as time progresses. Yet in (b) the oscillations are controlled, so we use the recent truncated windowed Fourier projection (TK-WFP) method to give rapid convergence. For (c) -- present due to the weak Huygens' principle -- we exploit a new large-time sum-of-exponentials approximation of the free-space wave kernel. Numerical examples with up to a million sources and targets, a domain of $300\times 300$ wavelengths, and 6-digit accuracy, show an acceleration of five orders of magnitude relative to direct evaluation.

math.NA↗

arXiv2025

Truncated kernel windowed Fourier projection: a fast algorithm for the 3D free-space wave equation

We present a spectrally accurate fast algorithm for evaluating the solution to the scalar wave equation in free space driven by a large collection of point sources in a bounded domain. With $M$ sources temporally discretized by $N_t$ time steps of size $Δt$, a naive potential evaluation at $M$ targets on the same time grid requires $\mathcal O(M^2 N_t)$ work. Our scheme requires $\mathcal{O}\left((M + N^3\log N)N_t\right)$ work, where $N$ scales as $\mathcal O(1/Δt)$, i.e., the maximum signal frequency. This is achieved by using the recently-proposed windowed Fourier projection (WFP) method to split the potential into a local part, evaluated directly, plus a smooth history part approximated by an $N^3$-point equispaced discretization of the Fourier transform, where each Fourier coefficient obeys a simple recursion relation. The growing oscillations in the spectral representation (which would be present with a naive use of the Fourier transform) are controlled by spatially truncating the hyperbolic Green's function itself. Thus, the method avoids the need for absorbing boundary conditions. We demonstrate the performance of our algorithm with up to a million sources and targets at 6-digit accuracy. We believe it can serve as a key component in addressing time-domain wave equation scattering problems.

math.NA↗

arXiv2025

A fast algorithm for the wave equation using time-windowed Fourier projection

We introduce a new arbitrarily high-order method for the rapid evaluation of hyperbolic potentials (space-time integrals involving the Green's function for the scalar wave equation). With $M$ points in the spatial discretization and $N_t$ time steps of size $Δt$, a naive implementation would require $\mathcal O(M^2N_t^2)$ work in dimensions where the weak Huygens' principle applies. We avoid this all-to-all interaction using a smoothly windowed decomposition into a local part, treated directly, plus a history part, approximated by a $N_F$-term Fourier series. In one dimension, our method requires $\mathcal O\left((M + N_F \log N_F)N_t\right)$ work, with $N_F =\mathcal O(1/Δt)$, by exploiting the non-uniform fast Fourier transform. We demonstrate the method's performance for time-domain scattering problems involving a large number $M$ of springs (point scatterers) attached to a vibrating string at arbitrary locations, with either periodic or free-space boundary conditions. We typically achieve 10-digit accuracy, and include tests for $M$ up to a million.

math.NA↗

arXiv2022

Local Compatibility Boundary Conditions for High-Order Accurate Finite-Difference Approximations of PDEs

We describe a new approach to derive numerical approximations of boundary conditions for high-order accurate finite-difference approximations. The approach, called the Local Compatibility Boundary Condition (LCBC) method, uses boundary conditions and compatibility boundary conditions derived from the governing equations, as well as interior and boundary grid values, to construct a local polynomial, whose degree matches the order of accuracy of the interior scheme, centered at each boundary point. The local polynomial is then used to derive a discrete formula for each ghost point in terms of the data. This approach leads to centered approximations that are generally more accurate and stable than one-sided approximations. Moreover, the stencil approximations are local since they do not couple to neighboring ghost-point values which can occur with traditional compatibility conditions. The local polynomial is derived using continuous operators and derivatives which enables the automatic construction of stencil approximations at different orders of accuracy. The LCBC method is developed here for problems governed by second-order partial differential equations, and it is verified for a wide range of sample problems, both time-dependent and time-independent, in two space dimensions and for schemes up to sixth-order accuracy.

math.NA↗