Related papers: Subresultants, Sylvester sums and the rational int…
In this paper, we give new sparse interpolation algorithms for black box univariate and multivariate rational functions h=f/g whose coefficients are integers with an upper bound. The main idea is as follows: choose a proper integer beta and…
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 design convergent multipoint Pade interpolation schemes to Cauchy transforms of non-vanishing complex densities with respect to Jacobi-type weights on analytic arcs, under mild smoothness assumptions on the density. We rely on our…
In this paper we present an efficient algorithm for bivariate interpolation, which is based on the use of the partition of unity method for constructing a global interpolant. It is obtained by combining local radial basis function…
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…
In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester's formula was also recently proved by Lascoux and Pragacz by using multi-Schur…
A logic has uniform interpolation if its formulas can be projected down to given subsignatures, preserving all logical consequences that do not mention the removed symbols; the weaker property of (Craig) interpolation allows the projected…
In this work we blend interpolation theory with numerical integration, constructing an interpolator based on integrals over $n$-dimensional balls. We show that, under hypotheses on the radius of the $n$-balls, the problem can be treated as…
Analytic interpolation problems with rationality and derivative constraints are ubiquitous in systems and control. This paper provides a new method for such problems, both in the scalar and matrix case, based on a non-standard Riccati-type…
The Pavlov equation is one of the simplest integrable systems of vector fields arising from various problems of mathematical physics and differential geometry which are intensively studied in recent literature. In this report, solving a…
Along this work we study an indefinite abstract smoothing problem. After establishing necessary and sufficient conditions for the existence of solutions to this problem, the set of admissible parameters is discussed in detail. Then, its…
Symmetrizable matrices are those which are symmetric when multiplied by a diagonal matrix with positive entries. The Cauchy interlace theorem states that the eigenvalues of a real symmetric matrix interlace with those of any principal…
The theory of symmetric multivariate Lagrange interpolation is a beautiful but rather unknown tool that has many applications. Here we derive from it an Exchange Lemma that allows to explain in a simple and natural way the full description…
On one hand, consider the problem of finding global solutions to a polynomial optimization problem and, on the other hand, consider the problem of interpolating a set of points with a complex exponential function. This paper proposes a…
Recently the authors presented a matrix representation approach to real Appell polynomials essentially determined by a nilpotent matrix with natural number entries. It allows to consider a set of real Appell polynomials as solution of a…
In a previous paper, we derived necessary and sufficient conditions for the invertibility of square submatrices of the Pascal upper triangular matrix. To do so, we established a connection with the two-point Birkhoff interpolation problem.…
Given a solution of a semilinear dispersive partial differential equation with a real analytic nonlinearity, we relate its Cauchy data at two different times by nonlinear representation formulas in terms of convergent series. These series…
We describe a strategy for solving nonlinear eigenproblems numerically. Our approach is based on the approximation of a vector-valued function, defined as solution of a non-homogeneous version of the eigenproblem. This approximation step is…
We study the Cauchy problem for the (2+1) integrable nonlinear Schr\"odinger equation by the inverse scattering transform (IST) method. This Cauchy problem with given initial data and boundary data at infinity is reduced by IST to the…
The problem of computing Craig Interpolants has recently received a lot of interest. In this paper, we address the problem of efficient generation of interpolants for some important fragments of first order logic, which are amenable for…