Related papers: Nonlinear Craig Interpolant Generation over Unboun…
In this work, we study the Hermite interpolation on $n$-dimensional non-equally spaced, rectilinear grids over a field $\Bbbk $ of characteristic zero, given the values of the function at each point of the grid and the partial derivatives…
We present a unified interpolation scheme that combines compactly-supported positive-definite kernels and multivariate polynomials. This unified framework generalizes interpolation with compactly-supported kernels and also classical…
We have recently presented a general method of proving the fundamental logical properties of Craig and Lyndon Interpolation (IPs) by induction on derivations in a wide class of internal sequent calculi, including sequents, hypersequents,…
The use of interpolants in model checking is becoming an enabling technology to allow fast and robust verification of hardware and software. The application of encodings based on the theory of arrays, however, is limited by the…
In this chapter, we present six different proofs of Craig interpolation for the modal logic K, each using a different set of techniques (model-theoretic, proof-theoretic, syntactic, automata-theoretic, using quasi-models, and algebraic). We…
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 this article we study the estimation of bifurcation coefficients in nonlinear branching problems by means of Rayleigh-Ritz approximation to the eigenvectors of the corresponding linearized problem. It is essential that the approximations…
In this paper we present a Mathematica notebook for computing nonsymmetric and interpolation Macdonald polynomials. We present the new recursive generation algorithm employed within the notebook and the theory required for its development.…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
We introduce a direct numerical treatment of nonlinear higher-index differential-algebraic equations by means of overdetermined polynomial least-squares collocation. The procedure is not much more computationally expensive than standard…
The Hermite interpolation formulas are based on the interpretation of interpolation nodes as roots of suitable polynomials. Therefore, such formulas belong to the class of algebraic interpolations. The article considers a multidimensional…
We define a class of associative algebras generalizing 'clannish algebras', as introduced by the second author, but also incorporating semilinear structure, like a skew polynomial ring. Clannish algebras generalize the well known 'string…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
In a common formulation of semi-infinite programs, the infinite constraint set is a requirement that a function parametrized by the decision variables is nonnegative over an interval. If this function is sufficiently closely approximable by…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
This paper provides approximation orders for a class of nonlinear interpolation procedures for univariate data sampled over $\sigma$ quasi-uniform grids. The considered interpolation is built using both essentially nonoscillatory (ENO) and…
Motivated by polynomial approximations of differential forms, we study analytical and numerical properties of a polynomial interpolation problem that relies on function averages over interval segments. The usage of segment data gives rise…
In this paper, we develop a nonlinear reduction framework based on our recently introduced extended group finite element method. By interpolating nonlinearities onto approximation spaces defined with the help of finite elements, the…
This paper is devoted to the construction of polynomial 2-surfaces which possess a polynomial area element. In particular we study these surfaces in the Euclidean space $\mathbb R^3$ (where they are equivalent to the PN surfaces) and in the…
In contrast to the univariate case, interpolation with polynomials of a given maximal total degree is not always possible even if the number of interpolation points and the space dimension coincide. Due to that, numerous constructions for…