Related papers: Efficient method for localized functions using dom…
The double Fourier sphere (DFS) method uses a clever trick to transform a function defined on the unit sphere to the torus and subsequently approximate it by a Fourier series, which can be evaluated efficiently via fast Fourier transforms.…
We introduce an extended discontinuous Galerkin discretization of hyperbolic-parabolic problems on multidimensional semi-infinite domains. Building on previous work on the one-dimensional case, we split the strip-shaped computational domain…
A systematic method is presented for constructing effective Hamiltonians for general phonon-related structural transitions. The key feature is the application of group theoretical methods to identify the subspace in which the effective…
In this paper, we propose a linearized Fourier pseudo-spectral method, which preserves the total mass and energy conservation laws, for the damped nonlinear Schr\"{o}dinger equation in three dimensions. With the aid of the semi-norm…
A rapid transformation is derived between spherical harmonic expansions and their analogues in a bivariate Fourier series. The change of basis is described in two steps: firstly, expansions in normalized associated Legendre functions of all…
Solving inverse and optimization problems over solutions of nonlinear partial differential equations (PDEs) on complex spatial domains is a long-standing challenge. Here we introduce a method that parameterizes the solution using spectral…
The singular values of convolutional mappings encode interesting spectral properties, which can be used, e.g., to improve generalization and robustness of convolutional neural networks as well as to facilitate model compression. However,…
Local Fourier analysis is a useful tool for predicting and analyzing the performance of many efficient algorithms for the solution of discretized PDEs, such as multigrid and domain decomposition methods. The crucial aspect of local Fourier…
We consider bivariate piecewise polynomial finite element spaces for curved domains bounded by piecewise conics satisfying homogeneous boundary conditions, construct stable local bases for them using Bernstein-B\'ezier techniques, prove…
We present a high order, Fourier penalty method for the Maxwell's equations in the vicinity of perfect electric conductor boundary conditions. The approach relies on extending the smooth non-periodic domain of the equations to a periodic…
The Fast Multipole Method (FMM) for the Poisson equation is extended to the case of non-axisymmetric problems in an axisymmetric domain, described by cylindrical coordinates. The method is based on a Fourier decomposition of the source into…
A special class of integrable nonlinear differential equations related to A.III-type symmetric spaces and having additional reductions are analyzed via the inverse scattering method (ISM). Using the dressing method we construct two classes…
Fourier extension is an approximation method that alleviates the periodicity requirements of Fourier series and avoids the Gibbs phenomenon when approximating functions. We describe a similar extension approach using regular wavelet bases…
We present direct logarithmically optimal in theory and fast in practice algorithms to implement the tensor product high order finite element method on multi-dimensional rectangular parallelepipeds for solving PDEs of the Poisson kind. They…
This work is concerned with spectral collocation methods for fractional PDEs in unbounded domains. The method consists of expanding the solution with proper global basis functions and imposing collocation conditions on the Gauss-Hermite…
We present a fast and spectrally accurate method for efficient computation of the three dimensional Coulomb potential with periodicity in one direction. The algorithm is FFT-based and uses the so-called Ewald decomposition, which is…
The method of fundamental solution (MFS) is an efficient meshless method for solving a boundary value problem in an exterior unbounded domain. The numerical solution obtained by the MFS is accurate, while the corresponding matrix equation…
We present a new framework for the fast solution of inhomogeneous elliptic boundary value problems in domains with smooth boundaries. High-order solvers based on adaptive box codes or the fast Fourier transform can efficiently treat the…
Computing solutions to partial differential equations using the fast Fourier transform can lead to unwanted oscillatory behavior. Due to the periodic nature of the discrete Fourier transform, waves that leave the computational domain on one…
We present a new computationally efficient method for multi-beamforming in the broadband setting. Our "fast beamspace transformation" forms $B$ beams from $M$ sensor outputs using a number of operations per sample that scales linearly (to…