Related papers: Fast finite-difference convolution for 3D problems…
We propose a locally one dimensional (LOD) finite difference method for multidimensional Riesz fractional diffusion equation with variable coefficients on a finite domain. The numerical method is second-order convergent in both space and…
We develop the uniform sparse Fast Fourier Transform (usFFT), an efficient, non-intrusive, adaptive algorithm for the solution of elliptic partial differential equations with random coefficients. The algorithm is an adaption of the sparse…
This paper presents a fast high-order method for the solution of two-dimensional problems of scattering by penetrable inhomogeneous media, with application to high-frequency configurations containing (possibly) discontinuous refractivities.…
A novel 3-D higher-order finite-difference time-domain framework with complex frequency-shifted perfectly matched layer for the modeling of wave propagation in cold plasma is presented. Second- and fourth-order spatial approximations are…
For many shape analysis problems in computer vision and scientific imaging (e.g., computational anatomy, morphological cytometry), the ability to align two closed curves in the plane is crucial. In this paper, we concentrate on rigidly…
We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and…
Resolvent analysis of the linearized Navier-Stokes equations provides useful insight into the dynamics of transitional and turbulent flows and can provide a model for the dominant coherent structures within the flow, particularly for flows…
This paper describes a fast direct boundary element method for elastodynamic transmission problems in two dimensions, which can be used for analyzing elastic wave scattering by an inclusion. We develop an efficient solver based on a…
For the first time, we develop in this paper the globally convergent convexification numerical method for a Coefficient Inverse Problem for the 3D Helmholtz equation for the case when the backscattering data are generated by a point source…
We describe and test numerically an adaptive meshless generalized finite difference method based on radial basis functions that competes well with the finite element method on standard benchmark problems with reentrant corners of the…
Stencil computations are widely used to simulate the change of state of physical systems across a multidimensional grid over multiple timesteps. The state-of-the-art techniques in this area fall into three groups: cache-aware tiled looping…
Lagrangian coherent structures (LCS) in fluid flows appear as co-dimension one ridges of the finite time Lyapunov exponent (FTLE) field. In three- dimensions this means two-dimensional ridges. A fast algorithm is presented here to locate…
The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and…
It is well known that multigrid methods are optimally efficient for solution of elliptic equations (O(N)), which means that effort is proportional to the number of points at which the solution is evaluated). Thus this is an ideal method to…
Advances in deep learning have enabled physics-informed neural networks to solve partial differential equations. Numerical differentiation using the finite-difference (FD) method is efficient in physics-constrained designs, even in…
In this work, we develop a fast and accurate method for the scattering of flexural-gravity waves by a thin plate of varying thickness overlying a fluid of infinite depth. This problem commonly arises in the study of sea ice and ice shelves,…
A 3-D inverse medium problem in the frequency domain is considered. Another name for this problem is Coefficient Inverse Problem. The goal is to reconstruct spatially distributed dielectric constants from scattering data. Potential…
We propose a novel framework for fast integral operations by uncovering hidden geometries in the row and column structures of the underlying operators. This is accomplished through the \texttt{Questionnaire} algorithm, an iterative…
We present a new method for computing the Near-To-Far-Field (NTFF) transformation in FDTD simulations which has an overall scaling of $O(N^3)$ instead of the standard $O(N^4)$. By mapping the far field with a cartesian coordinate system the…
New implicit and implicit-explicit time-stepping methods for the wave equation in second-order form are described with application to two and three-dimensional problems discretized on overset grids. The implicit schemes are single step,…