Related papers: PetRBF--A parallel O(N) algorithm for radial basis…
Factorization of the Gaussian RBF kernel is developed for free-mesh interpolation in the flat, polynomial limit corresponding to Taylor expansion and the Vandermonde basis of geometric moments. With this spectral approximation, a top-down…
The Poisson-Nernst-Planck (PNP) equations are one of the most effective model for describing electrostatic interactions and diffusion processes in ion solution systems, and have been widely used in the numerical simulations of biological…
This paper presents GRAPHR, the first ReRAM-based graph processing accelerator. GRAPHR follows the principle of near-data processing and explores the opportunity of performing massive parallel analog operations with low hardware and energy…
Meshfree radial basis function (RBF) methods are popular tools used to numerically solve partial differential equations (PDEs). They take advantage of being flexible with respect to geometry, easy to implement in higher dimensions, and can…
In this paper we present a new multilevel quasi-interpolation algorithm for smooth periodic functions using scaled Gaussians as basis functions. Recent research in this area has focussed upon implementations using basis function with finite…
We present an intriguing discovery related to Random Fourier Features: in Gaussian kernel approximation, replacing the random Gaussian matrix by a properly scaled random orthogonal matrix significantly decreases kernel approximation error.…
Ordinary state-based peridynamic (OSB-PD) models have an unparalleled capability to simulate crack propagation phenomena in solids with arbitrary Poisson's ratio. However, their non-locality also leads to prohibitively high computational…
In mesh-based numerical simulations, the interpolation of mesh-defined functions across different meshes is a critical task, and achieving high-precision interpolation is of great significance for improving the computational efficiency and…
Gaussian stochastic process (GaSP) has been widely used as a prior over functions due to its flexibility and tractability in modeling. However, the computational cost in evaluating the likelihood is $O(n^3)$, where $n$ is the number of…
It's well know that Radial Basis Function approximants suffers of bad conditioning if the simple basis of translates is used. A recent work of M.Pazouki and R.Schaback gives a quite general way to build stable, orthonormal bases for the…
This article introduces a novel methodology for the massive parallelization of projection-based depths, addressing the computational challenges of data depth in high-dimensional spaces. We propose an algorithmic framework based on Refined…
The Random Batch Method (RBM) is an effective technique to reduce the computational complexity when solving certain stochastic differential problems (SDEs) involving interacting particles. It can transform the computational complexity from…
The Discrete Fourier Transform (DFT) is essential for various applications ranging from signal processing to convolution and polynomial multiplication. The groundbreaking Fast Fourier Transform (FFT) algorithm reduces DFT time complexity…
We study the numerical evaluation of the integral fractional Laplacian and its application in solving fractional diffusion equations. We derive a pseudo-spectral formula for the integral fractional Laplacian operator based on fractional…
In this paper we propose a new stable and accurate approximation technique which is extremely effective for interpolating large scattered data sets. The Partition of Unity (PU) method is performed considering Radial Basis Functions (RBFs)…
We present a class of reduced basis (RB) methods for the iterative solution of parametrized symmetric positive-definite (SPD) linear systems. The essential ingredients are a Galerkin projection of the underlying parametrized system onto a…
The Reduced Basis (RB) method is a well established method for the model order reduction of problems formulated as parametrized partial differential equations. One crucial requirement for the application of RB schemes is the availability of…
We develop fast and memory efficient numerical methods for learning functions of many variables that admit sparse representations in terms of general bounded orthonormal tensor product bases. Such functions appear in many applications…
We describe the optimization algorithm implemented in the open-source derivative-free solver RBFOpt. The algorithm is based on the radial basis function method of Gutmann and the metric stochastic response surface method of Regis and…
The Radon transform and its adjoint, the back-projection operator, can both be expressed as convolutions in log-polar coordinates. Hence, fast algorithms for the application of the operators can be constructed by using FFT, if data is…