Related papers: Numerical cubature on scattered data by adaptive i…
For radial basis function (RBF) kernel interpolation of scattered data, Schaback in 1995 proved that the attainable approximation error and the condition number of the underlying interpolation matrix cannot be made small simultaneously. He…
The cubature on Wiener space method, a high-order weak approximation scheme, is established for SPDEs in the case of unbounded characteristics and unbounded payoffs. We first introduce a recently described flexible functional analytic…
As a generalization of the standard phase retrieval problem, we seek to reconstruct symmetric rank-1 matrices from inner products with subclasses of positive semidefinite matrices. For such subclasses, we introduce random cubatures for…
Approximation of scattered data is often a task in many engineering problems. The Radial Basis Function (RBF) approximation is appropriate for large scattered datasets in d-dimensional space. It is non-separable approximation, as it is…
We consider interpolation-based derivative-free optimization in settings where only some derivatives are available. Such situations arise naturally in scientific computing applications involving simulations, adjoint-enabled components,…
There are numerous contexts where one wishes to describe the state of a randomly evolving system. Effective solutions combine models that quantify the underlying uncertainty with available observational data to form scientifically…
We examine implicit representations of parametric or point cloud models, based on interpolation matrices, which are not sensitive to base points. We show how interpolation matrices can be used for ray shooting of a parametric ray with a…
In this paper, we deal with several aspects of the universal Frolov cubature method, that is known to achieve optimal asymptotic convergence rates in a broad range of function spaces. Even though every admissible lattice has this favorable…
To solve the problem of poor performance of deep neural network models due to insufficient data, a simple yet effective interpolation-based data augmentation method is proposed: MSMix (Manifold Swap Mixup). This method feeds two different…
This paper introduces a generalization of the empirical interpolation method (EIM) and the reduced basis method (RBM) in order to allow their combination with data mining and data assimilation. The purpose is to be able to derive sound…
Convergence problems in coupled-cluster iterations are discussed, and a new iteration scheme is proposed. Whereas the Jacobi method inverts only the diagonal part of the large matrix of equation coefficients, we invert a matrix which also…
Approximation of scattered data is often a task in many engineering problems. The Radial Basis Function (RBF) approximation is appropriate for big scattered datasets in $n-$dimensional space. It is a non-separable approximation, as it is…
Computationally expensive Radiative Transfer Models (RTMs) are widely used} to realistically reproduce the light interaction with the Earth surface and atmosphere. Because these models take long processing time, the common practice is to…
Several problems of trigonometric approximation on a hexagon and a triangle are studied using the discrete Fourier transform and orthogonal polynomials of two variables. A discrete Fourier analysis on the regular hexagon is developed in…
Many local integral methods are based on an integral formulation over small and heavilly overlapping stencils with local RBF interpolations. These functions have become an extremely effective tool for interpolation on scattered node sets,…
We construct an interpolatory high-order cubature rule to compute integrals of smooth functions over self-affine sets with respect to an invariant measure. The main difficulty is the computation of the cubature weights, which we…
In computational optics, numerical modeling of diffraction between arbitrary planes offers unparalleled flexibility. However, existing methods suffer from the trade-off between computational accuracy and efficiency. To resolve this dilemma,…
This paper is concerned with applications of the theory of approximation and interpolation based on compensated convex transforms developed in [K. Zhang, E. Crooks, A. Orlando, Compensated convexity methods for approximations and…
Graph signal processing benefits significantly from the direct and highly adaptable supplementary techniques offered by partition of unity methods (PUMs) on graphs. In our approach, we demonstrate the generation of a partition of unity…
In this article, we introduce a new variable selection technique through trimming for finite mixture of regression models. Compared to the traditional variable selection techniques, the new method is robust and not sensitive to outliers.…