Related papers: Solution of Interpolation Problems via the Hankel …
Bounded holomorphic interpolation problems associated to finitely many data have, in general, distinct solutions. Uniqueness arises only in some convex extreme configurations. Rational inner functions in a polydisk are the best understood…
This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in…
For $m,n \in \mathbb{N}$, $m\geq 1$ and a given function $f : \mathbb{R}^m\longrightarrow \mathbb{R}$, the polynomial interpolation problem (PIP) is to determine a unisolvent node set $P_{m,n} \subseteq \mathbb{R}^m$ of…
The scheme of divided differences is widely used in many approximation and interpolation problems. Computing the Newton coefficients of the interpolating polynomial is the first step of the Bj\"{o}rck and Pereyra algorithm for solving…
Let $Q_n=[0,1]^n$ be the unit cube in ${\mathbb R}^n$ and let $C(Q_n)$ be a space of continuous functions $f:Q_n\to{\mathbb R}$ with the norm $\|f\|_{C(Q_n)}:=\max_{x\in Q_n}|f(x)|.$ By $\Pi_1\left({\mathbb R}^n\right)$ denote a set of…
We show that the multipole vector decomposition, recently introduced by Copi et al., is a consequence of Sylvester's theorem, and corresponds to the Maxwell's representation. Analyzing it in terms of harmonic polynomials, we show that this…
This paper deals with approximation of smooth convex functions $f$ on an interval by convex algebraic polynomials which interpolate $f$ at the endpoints of this interval. We call such estimates "interpolatory". One important corollary of…
This work aims to introduce the framework of polynomial optimization theory to solve fractional polynomial problems (FPPs). Unlike other widely used optimization frameworks, the proposed one applies to a larger class of FPPs, not…
The polynomial kernels are widely used in machine learning and they are one of the default choices to develop kernel-based classification and regression models. However, they are rarely used and considered in numerical analysis due to their…
The primary objective of this study is to develop novel interpolation operators that interpolate the boundary values of a function defined on a triangle. This is accomplished by constructing New Generalized Boolean sum neural network…
An interpolation problem related to the elliptic Painlev\'e equation is formulated and solved. A simple form of the elliptic Painlev\'e equation and the Lax pair are obtained. Explicit determinant formulae of special solutions are also…
In this paper, we introduce the notion of Jacobi polynomials with multiple reference vectors of a code, and give the MacWilliams type identity for it. Moreover, we derive a formula to obtain the Jacobi polynomials using the Aronhold…
In this work, we address the problem of polynomial interpolation of non-pointwise data. More specifically, we assume that our input information comes from measurements obtained on diffuse compact domains. Although the nodal and the diffused…
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…
In order to solve an initial value problem by the variational iteration method, a sequence of functions is produced which converges to the solution under some suitable conditions. In the nonlinear case, after a few iterations the terms of…
The main goal of this article is to present several quadratic refinements and reverses of the well known Heinz inequality, for numbers and matrices, where the refining term is a quadratic function in the mean parameters. The proposed idea…
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…
Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…
An algebraic approach is presented for the valuative interpolation problem, which recovers and generalizes prior characterizations known in the complex analytic setting by the authors. We use the asymptotic Samuel function to give the…
Random resolution, defined by Buss, Kolodziejczyk and Thapen (JSL, 2014), is a sound propositional proof system that extends the resolution proof system by the possibility to augment any set of initial clauses by a set of randomly chosen…