Related papers: A note on interpolation series in the complex doma…
The main result of this paper is a new version of Newton-Hensel lifting that relates to interpolation questions. It allows one to lift polynomials in $Z[x]$ from information modulo a prime number $p\ne 2$ to a power $p^k$ for any $k$, and…
Based on tensor neural network, we propose an interpolation method for high dimensional non-tensor-product-type functions. This interpolation scheme is designed by using the tensor neural network based machine learning method. This means…
Starting from an adapted Whitney decomposition of tube domains in $\C^n$ over irreducible symmetric cones of $\R^n,$ we prove an atomic decomposition theorem in mixed norm weighted Bergman spaces on these domains. We also characterize the…
In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…
We prove an inverse relation and a family of convolution formulas involving partial Bell polynomials. Known and some presumably new combinatorial identities of convolution type are discussed. Our approach relies on an interesting…
Theory interpolation has found several successful applications in model checking. We present a novel method for computing interpolants for ground formulas in the theory of equality. The method produces interpolants from colored congruence…
We present simplified formulae for the analytic integration of the Newton potential of polynomials over boxes in two- and three-dimensional space. These are implemented in an easy-to-use C++ library that allows computations in arbitrary…
The usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is required to be composite, say, a composition of two…
Tensor polynomial identities generalize the concept of polynomial identities on $d \times d$ matrices to identities on tensor product spaces. Here we completely characterize a certain class of tensor polynomial identities in terms of their…
Given a sequence of real numbers, we consider its subsequences converging to possibly different limits and associate to each of them an index of convergence which depends on the density of the associated subsequences. This index turns out…
We consider the extension of the method of Gauss-Newton from complex floating-point arithmetic to the field of truncated power series with complex floating-point coefficients. With linearization we formulate a linear system where the…
In this paper, we introduce a novel identity for generalized Euler polynomials, leading to further generalizations for several relations involving classical Euler numbers, Euler polynomials, Genocchi polynomials, and Genocchi numbers.
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…
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…
We give explicit formulas as well as a quadratic time algorithm to solve (so called) generalized Vandermonde's systems of p linear equations and n variables. It allows in particular to find all (so called Lagrange's) interpolation polynoms…
We present a practical implementation based on Newton's method to find all roots of several families of complex polynomials of degrees exceeding one billion ($10^9$) so that the observed complexity to find all roots is between $O(d\ln d)$…
In this note, we explore the connections between the confluent Vandermonde matrix over an arbitrary field and several mathematical topics, including interpolation polynomials, Hasse derivatives, LU factorization, companion matrices and…
Newton method is one of the most powerful methods for finding solutions of nonlinear equations and for proving their existence. In its "pure" form it has fast convergence near the solution, but small convergence domain. On the other hand…
Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of existence, one would like to compute formulas for these…
In this article we shows some results about algebra with the group of units having special polynomial identity.