Related papers: A fast Fourier transform based direct solver for t…
We introduce a Fourier-Bessel-based spectral solver for Cauchy problems featuring Laplacians in polar coordinates under homogeneous Dirichlet boundary conditions. We use FFTs in the azimuthal direction to isolate angular modes, then perform…
The integral equation method is widely used in numerical simulations of 2D/3D acoustic and electromagnetic scattering problems, which needs a large number of values of the Green's functions. A significant topic is the scattering problems in…
We introduce a general purpose algorithm for rapidly computing certain types of oscillatory integrals which frequently arise in problems connected to wave propagation and general hyperbolic equations. The problem is to evaluate numerically…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…
This manuscript presents an efficient solver for the linear system that arises from the Hierarchical Poincar\'e-Steklov (HPS) discretization of three dimensional variable coefficient Helmholtz problems. Previous work on the HPS method has…
A finite element approach for approximating the solution of a mathematical model for the response of a penetrable, bounded object (obstacle) to the excitation by an external electromagnetic field is presented and investigated. The model…
We discuss efficient algorithms for the accurate forward and reverse evaluation of the discrete Fourier-Bessel transform (dFBT) as numerical tools to assist in the 2D polar convolution of two radially symmetric functions, relevant, e.g., to…
The Method of Fundamental Solutions (MFS) is a popular tool to solve Laplace and Helmholtz boundary value problems. Its main drawback is that it often leads to ill-conditioned systems of equations. In this paper we investigate for the…
The computational efficiency and rapid convergence of fast Fourier transform (FFT)-based solvers render them a powerful numerical tool for periodic cell problems in multiscale modeling. On regular grids, they tend to outperform traditional…
In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…
This paper considers the non-Hermitian Zakharov-Shabat (ZS) scattering problem which forms the basis for defining the SU$(2)$-nonlinear Fourier transform (NFT). The theoretical underpinnings of this generalization of the conventional…
One might argue that solving a trajectory optimization problem over a million grid points is preposterous. How about solving such a problem at an incredibly fast computational time? On a small form-factor processor? Algorithmic details that…
A direct solver is introduced for solving overdetermined linear systems involving nonuniform discrete Fourier transform matrices. Such matrices can be transformed into a Cauchy-like form that has hierarchical low rank structure. The rank…
The method of the fundamental solutions (MFS) is used to construct an approximate solution for a partial differential equation in a bounded domain. It is demonstrated by combining the fundamental solutions shifted to the points outside the…
This research work focuses on the design of a high-resolution fast Fourier transform (FFT) /inverse fast Fourier transform (IFFT) processors for constraints analysis purpose. Amongst the major setbacks associated with such high resolution,…
Starting from a comparison of some established numerical algorithms for the computation of the eigenvalues (discrete or solitonic spectrum) of the non-Hermitian version of the Zakharov-Shabat spectral problem, this article delivers new…
Due to its highly oscillating solution, the Helmholtz equation is numerically challenging to solve. To obtain a reasonable solution, a mesh size that is much smaller than the reciprocal of the wavenumber is typically required (known as the…
We introduce a new numerical method for solving time-harmonic acoustic scattering problems. The main focus is on plane waves scattered by smoothly varying material inhomogeneities. The proposed method works for any frequency $\omega$, but…
Recently, a new polynomial basis over binary extension fields was proposed such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order $\mathcal{O}(n\lg(n))$, where $n$ is the number of points…