Related papers: Multiscale methods with compactly supported radial…
In this paper, we study the benefits of using polyharmonic splines and node layouts with smoothly varying density for developing robust and efficient radial basis function generated finite difference (RBF-FD) methods for pricing of…
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)…
Radial basis functions are a common mathematical tool used to construct a smooth interpolating function from a set of data points. A spatial prior based on thin-plate spline radial basis functions can be easily implemented resulting in a…
The method of regularized Stokeslets (MRS) is a numerical approach using regularized fundamental solutions to compute the flow due to an object in a viscous fluid where inertial effects can be neglected. The elastic object is represented as…
In this paper we derive local estimates of solutions of the Perturbed Stokes system. This system arises as a reduction of the Stokes system near a curved part of the boundary of the domain if one applies a diffeomorphism flatting the…
A collection of algorithms is described for numerically computing with smooth functions defined on the unit disk. Low rank approximations to functions in polar geometries are formed by synthesizing the disk analogue of the double Fourier…
Generalized Fourier series with orthogonal polynomial bases have useful applications in several fields, including differential equations, pattern recognition, and image and signal processing. However, computing the generalized Fourier…
The spatial random-effects model is flexible in modeling spatial covariance functions, and is computationally efficient for spatial prediction via fixed rank kriging. However, the success of this model depends on an appropriate set of basis…
The Partition of Unity (PU) method, performed with local Radial Basis Function (RBF) approximants, has been proved to be an effective tool for solving large scattered data interpolation problems. However, in order to achieve a good…
We develop a framework for solving the stationary, incompressible Stokes equations in an axisymmetric domain. By means of Fourier expansion with respect to the angular variable, the three-dimensional Stokes problem is reduced to an…
In this paper, we solve nonlinear conservation laws using the radial basis function generated finite difference (RBF-FD) method. Nonlinear conservation laws have solutions that entail strong discontinuities and shocks, which give rise to…
Radial Basis Function Networks (RBFNs) are used primarily to solve curve-fitting problems and for non-linear system modeling. Several algorithms are known for the approximation of a non-linear curve from a sparse data set by means of RBFNs.…
In the fields of control theory and machine learning, the dynamic low-rank approximation for large-scale matrices has received substantial attention. Considering large-scale semilinear stiff matrix differential equations, we propose…
In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…
This contribution presents a new analysis of properties of the interpolation using Radial Bases Functions (RBF) related to large data sets interpolation. The RBF application is convenient method for scattered d-dimensional interpolation.…
A computational scheme for solving 2D Laplace boundary-value problems using rational functions as the basis functions is described. The scheme belongs to the class of desingularized methods, for which the location of singularities and…
Semi-lagrangian schemes for discretization of the dynamic programming principle are based on a time discretization projected on a state-space grid. The use of a structured grid makes this approach not feasible for high-dimensional problems…
Radial basis function generated finite difference (RBF-FD) methods for PDEs require a set of interpolation points which conform to the computational domain $\Omega$. One of the requirements leading to approximation robustness is to place…
We propose a new algorithm to solve optimization problems of the form $\min f(X)$ for a smooth function $f$ under the constraints that $X$ is positive semidefinite and the diagonal blocks of $X$ are small identity matrices. Such problems…
Radial basis functions have become a popular tool for approximation and solution of partial differential equations (PDEs). The recently proposed multilevel sparse interpolation with kernels (MuSIK) algorithm proposed in \cite{Georgoulis}…