相关论文: On the approximation properties of fast Leja point…
The spectacular development of Laser-Plasma Accelerators (LPA) appears very promising for a free electron laser application. The handling of the inherent properties of those LPA beams already allowed controlled production of LPA-based…
Aiming at drastic speedup for point-feature embeddings at test time, we propose a new framework that uses a pair of multi-layer perceptrons (MLP) and a lookup table (LUT) to transform point-coordinate inputs into high-dimensional features.…
Auto encoding models have been extensively studied in recent years. They provide an efficient framework for sample generation, as well as for analysing feature learning. Furthermore, they are efficient in performing interpolations between…
Sparse grids based on Lagrange polynomials have become one of the staple methods for approximating functions that are high-dimensional and expensive to evaluate, in the context e.g. of PDE-based parametric design exploration. They are…
Interpolation of classes of differentiated functions given on a finite interval by trigonometric splines using the phantom node method is considered. This method consists in supplementing a given sequence of values of an approximate…
A method is presented for forming polynomial interpolants on squares and cubes, which are more efficient in the so-called Euclidean degree than other commonly used methods with the same number of collocation points. These methods have…
We give a complete characterization of limiting interpolation spa\-ces for the real method of interpolation using extrapolation theory. For this purpose the usual tools (e.g., Boyd indices or the boundedness of Hardy type operators) are not…
In this paper, applied strictly monotonic increasing scaled maps, a kind of well-conditioned linear barycentric rational interpolations are proposed to approximate functions of singularities at the origin, such as $x^\alpha$ for $\alpha \in…
Joint Alignment (JA) of images aims to align a collection of images into a unified coordinate frame, such that semantically-similar features appear at corresponding spatial locations. Most existing approaches often require long training…
We prove a strong approximation result for the empirical process associated to a stationary sequence of real-valued random variables, under dependence conditions involving only indicators of half lines. This strong approximation result also…
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…
A Lagrangian method is introduced for calculating simultaneous n-point correlations of a passive scalar advected by a random velocity field, with random forcing and finite molecular diffusivity kappa. The method, which is here presented in…
In this paper, we build up a framework for sparse interpolation. We first investigate the theoretical limit of the number of unisolvent points for sparse interpolation under a general setting and try to answer some basic questions of this…
Multilinear interpolation is a powerful tool used in obtaining strong type boundedness for a variety of operators assuming only a finite set of restricted weak-type estimates. A typical situation occurs when one knows that a multilinear…
Low-rank approximation of a matrix by means of random sampling has been consistently efficient in its empirical studies by many scientists who applied it with various sparse and structured multipliers, but adequate formal support for this…
We propose an iterative estimating equations procedure for analysis of longitudinal data. We show that, under very mild conditions, the probability that the procedure converges at an exponential rate tends to one as the sample size…
We present a stable and convergent method for solving initial value problems based on the use of differentiation matrices obtained by Lagrange interpolation. This implicit multistep-like method is easy-to-use and performs pretty well in the…
Interpolating between points is a problem connected simultaneously with finding geodesics and study of generative models. In the case of geodesics, we search for the curves with the shortest length, while in the case of generative models we…
While interpolatory bases such as the Lagrange basis form the cornerstone of classical finite element methods, they have been replaced in the more general finite element setting of isogeometric analysis in favor of other desirable…
To approximate solutions of a linear differential equation, we project, via trigonometric interpolation, its solution space onto a finite-dimensional space of trigonometric polynomials and construct a matrix representation of the…