Related papers: A simple method for finite range decomposition of …
In this article we establish novel decompositions of Gaussian fields taking values in suitable spaces of generalized functions, and then use these decompositions to prove results about Gaussian multiplicative chaos. We prove two…
The aim of this note is to present a self-contained proof of the fact that a function can be approximated using a linear combination of Gaussian coherent states, with a number of terms controlled in terms of the smoothness and of the decay…
We consider linear second order differential equation y''= f with zero Dirichlet boundary conditions. At the continuous level this problem is solvable using the Green function, and this technique has a counterpart on the discrete level. The…
Numerical simulations of waves in highly heterogeneous media have important applications, but direct computations are prohibitively expensive. In this paper, we develop a new generalized multiscale finite element method with the aim of…
We propose a new algorithm for tensor decomposition, based on Jennrich's algorithm, and apply our new algorithmic ideas to blind deconvolution and Gaussian mixture models. Our first contribution is a simple and efficient algorithm to…
This paper develops a smoothing-based postprocessing method for superconvergence in finite element methods. The method applies a few smoothing iterations, such as damped Jacobi, Gauss-Seidel, or conjugate gradient, with initial guess being…
We introduce new estimation methods for a sub-class of the Gaussian scale mixture models for wavelet trees by Wainwright, Simoncelli & Willsky that rely on modern results for composite likelihoods and approximate Bayesian inference. Our…
We propose a greedy variational method for decomposing a non-negative multivariate signal as a weighted sum of Gaussians, which, borrowing the terminology from statistics, we refer to as a Gaussian mixture model. Notably, our method has the…
In this article we aim at defining the discrete Gaussian free field (DGFF) on a compact manifold. Since there is no canonical grid approximation of a manifold, we construct a random graph that suitably replaces the square lattice…
We develop a new representation for the integrals associated with Feynman diagrams. This leads directly to a novel method for the numerical evaluation of these integrals, which avoids the use of Monte Carlo techniques. Our approach is based…
Our goal is to present an elementary approach to the analysis and programming of sparse grid finite element methods. This family of schemes can compute accurate solutions to partial differential equations, but using far fewer degrees of…
A novel method, the Gaussian Integral Method (GIM), is presented for calculating void fractions in Computational Fluid Dynamics-Discrete Element Method (CFD-DEM) simulations. GIM is versatile and applicable to various grid types, including…
We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…
The standard solution to time-harmonic electromagnetic scattering problems in homogeneous layered media relies on the use of the electric field dyadic Green's function. However, for small values of the governing angular frequency $\omega$,…
This paper examines the effectiveness of the Dyson-Schwinger (DS) equations as a calculational tool in quantum field theory. The DS equations are an infinite sequence of coupled equations that are satisfied exactly by the connected Green's…
The Galerkin difference (GD) basis is a set of continuous, piecewise polynomials defined using a finite difference like grid of degrees of freedom. The one dimensional GD basis functions are naturally extended to multiple dimensions using…
This paper presents an algorithm to simulate Gaussian random vectors whose precision matrix can be expressed as a polynomial of a sparse matrix. This situation arises in particular when simulating Gaussian Markov random fields obtained by…
We present a new kind of basis function for discretizing the Schr\"odinger equation in electronic structure calculations, called a gausslet, which has wavelet-like features but is composed of a sum of Gaussians. Gausslets are placed on a…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
This paper presents a novel method for solving partial differential equations on three-dimensional CAD geometries by means of immersed isogeometric discretizations that do not require quadrature schemes. It relies on a new developed…