Related papers: Low-rank approximation of Rippa method for RBF int…

Low-rank approximation is a task of critical importance in modern science, engineering, and statistics. Many low-rank approximation algorithms, such as the randomized singular value decomposition (RSVD), project their input matrix into a…

Active stereo technique using single pattern projection, a.k.a. one-shot 3D scan, have drawn a wide attention from industry, medical purposes, etc. One severe drawback of one-shot 3D scan is sparse reconstruction. In addition, since spatial…

Kolmogorov-Arnold Networks (KANs) approximate multivariate functions using learnable univariate edge functions, typically parameterized by B-spline bases. Although effective, spline-based implementations can be computationally expensive. A…

The radial basis function (RBF) and quasi Monte Carlo (QMC) methods are two very promising schemes to handle high-dimension problems with complex and moving boundary geometry due to the fact that they are independent of dimensionality and…

We introduce a new fundamental algorithm called Matrix-POAFD to solve the matrix least square problem. The method is based on the matching pursuit principle. The method directly extracts, among the given features as column vectors of the…

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.…

In this paper we describe a parallel implicit method based on radial basis functions (RBF) for surface reconstruction. The applicability of RBF methods is hindered by its computational demand, that requires the solution of linear systems of…

Diffusion probabilistic models (DPMs) are widely adopted for their outstanding generative fidelity, yet their sampling is computationally demanding. Polynomial-based multistep samplers mitigate this cost by accelerating inference; however,…

This paper introduces a novel method for human face detection with its orientation by using wavelet, principle component analysis (PCA) and redial basis networks. The input image is analyzed by two-dimensional wavelet and a two-dimensional…

The search for the optimal shape parameter for Radial Basis Function (RBF) kernel approximation has been an outstanding research problem for decades. In this work, we establish a theoretical framework for this problem by leveraging a…

We present a new rational approximation algorithm based on the empirical interpolation method for interpolating a family of parametrized functions to rational polynomials with invariant poles, leading to efficient numerical algorithms for…

We consider the parametric learning problem, where the objective of the learner is determined by a parametric loss function. Employing empirical risk minimization with possibly regularization, the inferred parameter vector will be biased…

In this work we combine the framework of the Reduced Basis method (RB) with the framework of the Localized Orthogonal Decomposition (LOD) in order to solve parametrized elliptic multiscale problems. The idea of the LOD is to split a high…

We call matrix algorithms superfast if they use much fewer flops and memory cells than the input matrix has entries. Using such algorithms is indispensable for Big Data Mining and Analysis, where the input matrices are so immense that one…

Meshfree methods based on radial basis function (RBF) approximation are of interest for numerical solution of partial differential equations (PDEs) because they are flexible with respect to the geometry of the computational domain, they can…

Reduced Order Quadrature (ROQ) methods can greatly reduce the computational cost of Gravitational Wave (GW) likelihood evaluations, and therefore greatly speed up parameter estimation analyses, which is a vital part to maximize the science…

We present a comprehensive study of radial basis function (RBF) approximations for elliptic and obstacle-type boundary value problems under a variational formulation. Our focus is on practical accuracy, robustness and efficiency. To address…

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…

Localized collocation methods based on radial basis functions (RBFs) for elliptic problems appear to be non-robust in the presence of Neumann boundary conditions. In this paper we overcome this issue by formulating the RBF-generated finite…

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…