Related papers: A Least Squares Radial Basis Function Partition of…

In this paper, we employ Bayesian optimization to concurrently explore the optimal values for both the shape parameter and the radius in the partition of unity interpolation using radial basis functions. Bayesian optimization is a…

This paper proposes a Direct Rational Radial Basis Functions Partition of Unity (D-RRBF-PU) approach to compute derivatives of functions with steep gradients or discontinuities. The novelty of the method concerns how derivatives are…

Fractional Laplace equations are becoming important tools for mathematical modeling and prediction. Recent years have shown much progress in developing accurate and robust algorithms to numerically solve such problems, yet most solvers for…

We introduce an efficient algorithm, called partition of unity extension or PUX, to construct an extension of desired regularity of a function given on a complex multiply connected domain in $2D$. Function extension plays a fundamental role…

Local meshless methods obtain higher convergence rates when RBF approximations are augmented with monomials up to a given order. If the order of the approximation method is spatially variable, the numerical solution is said to be p-refined.…

We introduce a new Partition of Unity Method for the numerical homogenization of elliptic partial differential equations with arbitrarily rough coefficients. We do not restrict to a particular ansatz space or the existence of a finite…

Steady and unsteady Poisson and Stokes equations are solved using mesh dependent Finite Element Method and meshless Radial Basis Function Collocation Method to compare the performances of these two numerical techniques across several…

We present a new method for the solution of PDEs on manifolds $\mathbb{M} \subset \mathbb{R}^d$ of co-dimension one using stable scale-free radial basis function (RBF) interpolation. Our method involves augmenting polyharmonic spline (PHS)…

Approximation of scattered data is often a task in many engineering problems. The Radial Basis Function (RBF) approximation is appropriate for large scattered (unordered) datasets in d-dimensional space. This approach is useful for a higher…

Conventionally, piecewise polynomials have been used in the boundary elements method (BEM) to approximate unknown boundary values. Since infinitely smooth radial basis functions (RBFs) are more stable and accurate than the polynomials for…

While pseudospectral (PS) methods can feature very high accuracy, they tend to be severely limited in terms of geometric flexibility. Application of global radial basis functions overcomes this, however at the expense of problematic…

Machine learning has been successfully applied to various fields of scientific computing in recent years. In this work, we propose a sparse radial basis function neural network method to solve elliptic partial differential equations (PDEs)…

This article aims to develop a direct numerical approach to solve the space-fractional partial differential equations (PDEs) based on a new differential quadrature (DQ) technique. The fractional derivatives are approximated by the weighted…

Polyharmonic spline (PHS) radial basis functions (RBFs) are used together with polynomials to create local RBF-finite-difference (RBF-FD) weights on different node layouts for spatial discretization of the compressible Navier-Stokes…

In this paper the Partition of Unity Method (PUM) is efficiently performed using Radial Basis Functions (RBFs) as local approximants. In particular, we present a new space-partitioning data structure extremely useful in applications because…

We present a framework for solving time-dependent partial differential equations (PDEs) in the spirit of the random feature method. The numerical solution is constructed using a space-time partition of unity and random feature functions.…

Partition of unity methods (PUMs) on graphs are simple and highly adaptive auxiliary tools for graph signal processing. Based on a greedy-type metric clustering and augmentation scheme, we show how a partition of unity can be generated in…

Approximation of scattered geometric data is often a task in many engineering problems. The Radial Basis Function (RBF) approximation is appropriate for large scattered (unordered) datasets in d-dimensional space. This method is useful for…

One commonly finds in applications of smooth radial basis functions (RBFs) that scaling the kernels so they are `flat' leads to smaller discretization errors. However, the direct numerical approach for computing with flat RBFs (RBF-Direct)…

In this paper we propose a new efficient interpolation tool, extremely suitable for large scattered data sets. The partition of unity method is used and performed by blending Radial Basis Functions (RBFs) as local approximants and using…