Related papers: A Fourier continuation framework for high-order ap…
A numerical scheme is presented for approximating fractional order Poisson problems in two and three dimensions. The scheme is based on reformulating the original problem posed over $\Omega$ on the extruded domain…
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…
It is shown that if a non-zero function $f\in B_\sigma$ has infinitely many double zeros on the real axis, then there exists at least one pair of consecutive zeros whose distance apart is greater than $\dfrac{\pi}{\sigma}\tau^{1/4}$,…
A higher-order numerical method is presented for scalar valued, coupled forward-backward stochastic differential equations. Unlike most classical references, the forward component is not only discretized by an Euler-Maruyama approximation…
A new method is presented for Fourier decomposition of the Helmholtz Green Function in cylindrical coordinates, which is equivalent to obtaining the solution of the Helmholtz equation for a general ring source. The Fourier coefficients of…
We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…
We consider a unique continuation problem where the Dirichlet trace of the solution is known to have finite dimension. We prove Lipschitz stability of the unique continuation problem and design a finite element method that exploits the…
We present fast, spatially dispersionless and unconditionally stable high-order solvers for Partial Differential Equations (PDEs) with variable coefficients in general smooth domains. Our solvers, which are based on (i) A certain "Fourier…
Generalized Fiducial Inference (GFI) is motivated by R.A. Fisher's approach of obtaining posterior-like distributions when there is no prior information available for the unknown parameter. Without the use of Bayes' theorem GFI proposes a…
In his monograph Chebyshev and Fourier Spectral Methods, John Boyd claimed that, regarding Fourier spectral methods for solving differential equations, ``[t]he virtues of the Fast Fourier Transform will continue to improve as the relentless…
The construction of finite element approximations in $\mathbf{H}(\mbox{div}, {\Omega})$ usually requires the Piola transformation to map vector polynomials from a master element to vector fields in the elements of a partition of the region…
We provide a rigorous convergence proof demonstrating that the well-known semi-analytical Fourier cosine (COS) formula for the inverse Fourier transform of continuous probability distributions can be extended to discrete probability…
We present a computationally efficient algorithm for stable numerical differentiation from noisy, uniformly-sampled data on a bounded interval. The method combines multi-interval Fourier extension approximations with an adaptive domain…
Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…
This paper concerns extension of the classical Lagrange theorem, on the eventual periodicity of continued fraction expansions of quadratic surds, and the versions of it found in the literature in the case of complex numbers. In this…
In this paper, we use some standard numerical techniques to approximate the hypergeometric function $$ {}_2F_1[a,b;c;x]=1+\frac{ab}{c}x+\frac{a(a+1)b(b+1)}{c(c+1)}\frac{x^2}{2!}+\cdots $$ for a range of parameter triples $(a,b,c)$ on the…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. In the third paper, the analytical analysis of multiscale phenomena inherent in the…
We propose a high-order FDTD scheme based on the correction function method (CFM) to treat interfaces with complex geometry without increasing the complexity of the numerical approach for constant coefficients. Correction functions are…
Recent work has shown that parameterizing and optimizing coordinate transformations using normalizing flows, i.e., invertible neural networks, can significantly accelerate the convergence of spectral approximations. We present the first…
We study the problem of estimating the average of a Lipschitz continuous function $f$ defined over a metric space, by querying $f$ at only a single point. More specifically, we explore the role of randomness in drawing this sample. Our goal…