Related papers: Computing minimal interpolants in $C^{1,1}(\mathbb…
Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers.…
Given an interpolating Blaschke product $B$ with zeros $\{a_j\}$, we seek to characterize the sequences of values $\{w_j\}$ for which the interpolation problem $$f(a_j)=w_j\qquad (j=1,2,\dots)$$ can be solved with a function $f$ from the…
Given a finite sequence $a:={a_1, ..., a_N}$ in a domain $\Omega \subset C^n$, and complex scalars $v:={v_1, ..., v_N}$, consider the classical extremal problem of finding the smallest uniform norm of a holomorphic function verifying…
In the present paper, using S.L. Sobolev's method, interpolation spline that minimizes the expression $\int_0^1(\varphi^{(m)}(x)+\omega^2\varphi^{(m-2)}(x))^2dx$ in the $K_2(P_m)$ space are constructed. Explicit formulas for the…
We give a set of test functions for the interpolation problem on $H_1^\infty$ , the constrained interpolation problem studied by Davidson, Paulsen, Raghupathi and Singh. We show that this set of test functions is minimal.
Nonlinear interpolants have been shown useful for the verification of programs and hybrid systems in contexts of theorem proving, model checking, abstract interpretation, etc. The underlying synthesis problem, however, is challenging and…
Suppose $\Omega$ is a closed bounded subset of ${\mathbb R}^n,$ $S$ is an $n$-dimensional non-degenerate simplex, $\xi(\Omega;S):=\min \left\{\sigma\geq 1: \, \Omega\subset \sigma S\right\}$. Here $\sigma S$ is the result of homothety of…
Computing electron-defect (e-d) interactions from first principles has remained impractical due to computational cost. Here we develop an interpolation scheme based on maximally localized Wannier functions (WFs) to efficiently compute e-d…
We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…
We define $F$-polynomials as linear combinations of dilations by some frequencies of an entire function $F$. In this paper we use Pade interpolation of holomorphic functions in the unit disk by $F$-polynomials to obtain explicitly…
Let $A=K[a_1,\ldots,a_n]$ be a weighted $\mathbb{N}$-filtered solvable polynomial algebra with filtration $FA=\{ F_pA\}_{p\in\mathbb{N}}$, where solvable polynomial algebras are in the sense of (A. Kandri-Rody and V. Weispfenning,…
Given a "black box" function to evaluate an unknown rational polynomial f in Q[x] at points modulo a prime p, we exhibit algorithms to compute the representation of the polynomial in the sparsest shifted power basis. That is, we determine…
We consider the problem of interpolating a function given on scattered points using Hermite-Birkhoff formulas on the sphere and other manifolds. We express each proposed interpolant as a linear combination of basis functions, the…
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…
We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…
Low-rank approximations are essential in modern data science. The interpolative decomposition provides one such approximation. Its distinguishing feature is that it reuses columns from the original matrix. This enables it to preserve matrix…
We present a technique for the approximation of a class of Hilbert space-valued maps which arise within the framework of Model Order Reduction for parametric partial differential equations, whose solution map has a meromorphic structure.…
The interpolant existence problem (IEP) for a logic L is to decide, given formulas P and Q, whether there exists a formula I, built from the shared symbols of P and Q, such that P entails I and I entails Q in L. If L enjoys the Craig…
Minimal cubature rules of degree $4n-1$ for the weight functions $$ W_{\a,\b,\pm \frac12}(x,y) = |x+y|^{2\a+1} |x-y|^{2\b+1} ((1-x^2)(1-y^2))^{\pm \frac12} $$ on $[-1,1]^2$ are constructed explicitly and are shown to be closed related to…
For $1<p\leq 2$, any $n\geq 1$ and any $f:\{-1,1\}^{n} \to \mathbb{R}$, we obtain $(\mathbb{E} |\nabla f|^{p})^{1/p} \geq C(p)(\mathbb{E}|f|^{p} - |\mathbb{E}f|^{p})^{1/p}$ where $C(p)$ is the smallest positive zero of the confluent…