Related papers: Moebius-Invariant Natural Neighbor Interpolation
It is often of interest to infer lower-dimensional structure underlying complex data. As a flexible class of non-linear structures, it is common to focus on Riemannian manifolds. Most existing manifold learning algorithms replace the…
We exhibit a change of variables that maintains the Mahler measure of a given polynomial. This method leads to the construction of highly non-trivial polynomials with given Mahler measure and settles some conjectural numerical formulas due…
We construct filtrations on homotopy invariant sheaves with transfers and show that under Ayoub's conjectures on $n$-motives, our filtration agrees with the one conjectured by Ayoub and Barbieri-Viale if the latter exists. Our construction…
In this work, we have investigated various style transfer approaches and (i) examined how the stylized reconstruction changes with the change of loss function and (ii) provided a computationally efficient solution for the same. We have used…
Chebyshev interpolation polynomials exhibit the exponential approximation property to analytic functions on a cube. Based on the Chebyshev interpolation polynomial approximation, we propose iterative polynomial approximation algorithms to…
P. Berglund, T. H\"ubsch, and M. Henningson proposed a method to construct mirror symmetric Calabi-Yau manifolds. They considered a pair consisting of an invertible polynomial and of a finite (abelian) group of its diagonal symmetries…
A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…
Submanifolds of Frobenius manifolds are studied. In particular, so-called natural submanifolds are defined and, for semi-simple Frobenius manifolds, classified. These carry the structure of a Frobenius algebra on each tangent space, but…
We investigate non-stationary orthogonal wavelets based on a non-stationary interpolatory subdivision scheme reproducing a given set of exponentials. The construction is analogous to the construction of Daubechies wavelets using the…
M\"obius transformations play an important role in both geometry and spherical image processing - they are the group of conformal automorphisms of 2D surfaces and the spherical equivalent of homographies. Here we present a novel,…
This work aims to provide a deep-learning solution for the motion interpolation task. Previous studies solve it with geometric weight functions. Some other works propose neural networks for different problem settings with consecutive pose…
The study of interpolation nodes and their associated Lebesgue constants are central to numerical analysis, impacting the stability and accuracy of polynomial approximations. In this paper, we will explore the Morrow-Patterson points, a set…
The aim of this note is to prove the algebraic geometry analogue of the Invariant tubular neighborhood theorem which concerns the actions of compact Lie groups on smooth manifolds.
In order to generate novel 3D shapes with machine learning, one must allow for interpolation. The typical approach for incorporating this creative process is to interpolate in a learned latent space so as to avoid the problem of generating…
Padua points is a family of points on the square $[-1,1]^2$ given by explicit formulas that admits unique Lagrange interpolation by bivariate polynomials. The interpolation polynomials and cubature formulas based on the Padua points are…
We prove a sufficient condition for the Jacobian problem in the setting of real, complex and mixed polynomial mappings. This follows from the study of the bifurcation locus of a mapping subject to a new Newton non-degeneracy condition.
Variable projection methods prove highly efficient in solving separable nonlinear least squares problems by transforming them into a reduced nonlinear least squares problem, typically solvable via the Gauss-Newton method. When solving…
The invariant subspace method is refined to present more unity and more diversity of exact solutions to evolution equations. The key idea is to take subspaces of solutions to linear ordinary differential equations as invariant subspaces…
The Empirical Interpolation Method (EIM) is a greedy procedure that constructs approximate representations of two-variable functions in separated form. In its classical presentation, the two variables play a non-symmetric role. In this…
This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…