Related papers: Computing minimal interpolants in $C^{1,1}(\mathbb…
In this paper, we propose two new interpolation algorithms for sparse multivariate polynomials represented by a straight-line program(SLP). Both of our algorithms work over any finite fields $F_q$ with large characteristic. The first one is…
We develop foundations for computing Craig interpolants and similar intermediates of two given formulas with first-order theorem provers that construct clausal tableaux. Provers that can be understood in this way include efficient…
We calculate the minimal surface bounded by four-sided figures whose projection on a plane is a rectangle, starting with the bilinear interpolation and using, for smoothness, the Chebyshev polynomial expansion in our discretized numerical…
We derive a Fast Multipole Method (FMM) where a low-rank approximation of the kernel is obtained using the Empirical Interpolation Method (EIM). Contrary to classical interpolation-based FMM, where the interpolation points and basis are…
In this paper, we aim to construct fractal interpolation function(FIF) on the product of two Sierpi\'nski gaskets. Further, we collect some results regarding smoothness of the constructed FIF. We prove, in particular, that the FIF are…
We introduce explicit families of good interpolation points for interpolation on a triangle in $\mathbb{R}^2$ that may be used for either polynomial interpolation or a certain rational interpolation for which we give explicit formulas.
For nonlinear reduced-order models, especially for those with non-polynomial nonlinearities, the computational complexity still depends on the dimension of the original dynamical system. As a result, the reduced-order model loses its…
Let $E, F\subset \R^d$ be two self-similar sets. Under mild conditions, we show that $F$ can be $C^1$-embedded into $E$ if and only if it can be affinely embedded into $E$; furthermore if $F$ can not be affinely embedded into $E$, then the…
In this paper, norm estimates are obtained for the problem of minimal-norm tangential interpolation by vector-valued analytic functions in weighted H^p spaces, expressed in terms of the Carleson constants of related scalar measures.…
Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…
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…
Recent research has established complexity results for the problem of deciding the existence of interpolants in logics lacking the Craig Interpolation Property (CIP). The proof techniques developed so far are non-constructive, and no…
We consider the problem of obtaining interpolation constraints for function classes, i.e., necessary and sufficient constraints that a set of points, function values and (sub)gradients must satisfy to ensure the existence of a global…
Existing techniques for Craig interpolation for the quantifier-free fragment of the theory of arrays are inefficient for computing sequence and tree interpolants: the solver needs to run for every partitioning $(A, B)$ of the interpolation…
We present a novel barycentric interpolation algorithm designed for analytic functions $f\in\mathcal{A}(E)$ defined on the complex plane. The algorithm, which encompasses both polynomial and rational interpolation, is tailored to handle…
Let $a: I\to \mathbb{R}^3 $ be a real analytic curve satisfying some conditions. In this article, we show that for any real analytic curve $l:I\to \mathbb R^3$ close to $a$ (in a sense which is precisely defined in the paper) there exists a…
Given a way to evaluate an unknown polynomial with integer coefficients, we present new algorithms to recover its nonzero coefficients and corresponding exponents. As an application, we adapt this interpolation algorithm to the problem of…
Interpolation inequalities for $C^m$ functions allow to bound derivatives of intermediate order $0 < j<m$ by bounds for the derivatives of order $0$ and $m$. We review various interpolation inequalities for $L^p$-norms ($1 \le p \le…
We construct automorphisms of $\C^n$ which map certain discrete sequences one onto another with prescribed finite jet at each point, thus solving a general Mittag-Leffler interpolation problem for automorphisms. Under certain circumstances,…
Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which…