Related papers: Multivariate Newton Interpolation

A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…

The problem of counting monomer-dimer coverings of a lattice is a longstanding problem in statistical mechanics. It has only been exactly solved for the special case of dimer coverings in two dimensions. In earlier work, Stanley proved a…

Ion transport, often described by the Poisson--Nernst--Planck (PNP) equations, is ubiquitous in electrochemical devices and many biological processes of significance. In this work, we develop conservative, positivity-preserving, energy…

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

Quantum Inverse Problem (QIP) is the problem of estimating an unknown quantum system $\rho$ from a set of measurements, whereas the classical counterpart is the Inverse Problem of estimating a distribution from a set of observations. In…

Hyperbolic polynomials is a class of real-roots polynomials that has wide range of applications in theoretical computer science. Each hyperbolic polynomial also induces a hyperbolic cone that is of particular interest in optimization due to…

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

Let $m$ be any integer $\geq 3$. We consider the polynomial equation $$X^n + a_{n-1}\cdot X^{n-1} + \dots + a_1 \cdot X + a_0 \cdot I = O,$$ over $(m \times m)$-matrices $X$ with the real entries, where $I$ is the identity matrix, $O$ is…

For nonautonomous, nonuniformly elliptic integrals with so-called $(p,q)$-growth conditions, we show a general interpolation property allowing to get basic higher integrability results for H\"older continuous minimizers under improved…

Solving high dimensional partial differential equations (PDEs) has historically posed a considerable challenge when utilizing conventional numerical methods, such as those involving domain meshes. Recent advancements in the field have seen…

A pattern of interpolation nodes on the disk is studied, for which the interpolation problem is theoretically unisolvent, and which renders a minimal numerical condition for the collocation matrix when the standard basis of Zernike…

In this work we consider the problem of recovering non-uniform splines from their projection onto spaces of algebraic polynomials. We show that under a certain Chebyshev-type separation condition on its knots, a spline whose inner-products…

Let $q,n \geq 1$ be integers, $[q]=\{1,\ldots, q\}$, and $\mathbb F$ be a field with $|\mathbb F|\geq q$. The set of increasing sequences $$ I(n,q)=\{(f_1,f_2, \dots, f_n) \in [q]^n:~ f_1\leq f_2\leq\cdots \leq f_n \} $$ can be mapped via…

We consider the {\it noisy polynomial interpolation problem\/} of recovering an unknown $s$-sparse polynomial $f(X)$ over the ring $\mathbb Z_{p^k}$ of residues modulo $p^k$, where $p$ is a small prime and $k$ is a large integer parameter,…

The problem of detecting the bifurcation set of polynomial mappings $\mathbb{ C}^m \to \mathbb{ C}^k$, $m\ge 2$, $m\ge k\ge 1$, has been solved in the case $m=2$, $k=1$ only. Its solution, which goes back to the 1970s, involves the…

We introduce a novel spectral, finite-dimensional approximation of general Sobolev spaces in terms of Chebyshev polynomials. Based on this polynomial surrogate model (PSM), we realise a variational formulation, solving a vast class of…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

Physics-Informed Neural Networks (PINN) are neural networks encoding the problem governing equations, such as Partial Differential Equations (PDE), as a part of the neural network. PINNs have emerged as a new essential tool to solve various…

We introduce uniparametric and multiparametric quantisations of the general linear supergroup, in the form of "quantised function algebras", both in a formal setting - yielding "quantum formal series Hopf superalgebras", a` la Drinfeld -…