Related papers: Modified Virtual Grid Difference for Discretizing …
It is known that the solution of a conservative steady-state two-sided fractional diffusion problem can exhibit singularities near the boundaries. As consequence of this, and due to the conservative nature of the problem, we adopt a finite…
In some cases, computational benefit can be gained by exploring the hyper parameter space using a deterministic set of grid points instead of a Markov chain. We view this as a numerical integration problem and make three unique…
We propose an infinity Laplacian method to address the problem of interpolation on an unstructured point cloud. In doing so, we find the labeling function with the smallest infinity norm of its gradient. By introducing the non-local…
Deep neural networks have proved very successful on archetypal tasks for which large training sets are available, but when the training data are scarce, their performance suffers from overfitting. Many existing methods of reducing…
The Laplacian appears in several partial differential equations used to model wave propagation. Summation-by-parts--simultaneous approximation term (SBP-SAT) finite difference methods are often used for such equations, as they combine…
The spectral structure of the Laplacian-Beltrami operator (LBO) on manifolds has been widely used in many applications, include spectral clustering, dimensionality reduction, mesh smoothing, compression and editing, shape segmentation,…
Multilevel Monte Carlo (MLMC) is a recently proposed variation of Monte Carlo (MC) simulation that achieves variance reduction by simulating the governing equations on a series of spatial (or temporal) grids with increasing resolution.…
A multiscale optimization framework for problems over a space of Lipschitz continuous functions is developed. The method solves a coarse-grid discretization followed by linear interpolation to warm-start project gradient descent on…
This paper is dedicated to the development of numerical analysis for high-order methods solving partial differential equations on scattered point clouds. We build a novel geometric error analysis framework by estimating the error in the…
We propose a novel framework to solve PDEs on moving manifolds, where the evolving surface is represented by a moving point cloud. This has the advantage of avoiding the need to discretize the bulk volume around the surface, while also…
Most of deterministic solvers for rarefied gas dynamics use discrete velocity (or discrete ordinate) approximations of the distribution function on a Cartesian grid. This grid must be sufficiently large and fine to describe the distribution…
3D point cloud - a new signal representation of volumetric objects - is a discrete collection of triples marking exterior object surface locations in 3D space. Conventional imperfect acquisition processes of 3D point cloud - e.g.,…
The multigrid-reduction-in-time (MGRIT) technique has proven to be successful in achieving higher run-time speedup by exploiting parallelism in time. The goal of this article is to develop and analyze a MGRIT algorithm, using FCF-relaxation…
Within the mode-coupling theory (MCT) of the glass transition, we reconsider the numerical schemes to evaluate the MCT functional. Here we propose nonuniform discretizations of the wave number, in contrast to the standard equidistant grid,…
In this paper we present a geometric multigrid method with Jacobi and Vanka relaxation for hybridized and embedded discontinuous Galerkin discretizations of the Laplacian. We present a local Fourier analysis (LFA) of the two-grid…
Probabilistic point cloud registration methods are becoming more popular because of their robustness. However, unlike point-to-plane variants of iterative closest point (ICP) which incorporate local surface geometric information such as…
We present a hybrid particle/grid approach for simulating incompressible fluids on collocated velocity grids. We interchangeably use particle and grid representations of transported quantities to balance efficiency and accuracy. A novel…
Point cloud bundle adjustment is critical in large-scale point cloud mapping. However, it is both computationally and memory intensive, with its complexity growing cubically as the number of scan poses increases. This paper presents…
We introduce a numerical method for approximating arbitrary differential operators on vector fields in the weak form given point cloud data sampled randomly from a $d$ dimensional manifold embedded in $\mathbb{R}^n$. This method generalizes…
In many applications of practical interest, solutions of partial differential equation models arise as critical points of an underlying (energy) functional. If such solutions are saddle points, rather than being maxima or minima, then the…