Domain-of-attraction estimation for uncertain non-polynomial systems

In this paper, we consider the problem of computing estimates of the domain-of-attraction for non-polynomial systems. A polynomial approximation technique, based on multivariate polynomial interpolation and error analysis for remaining functions, is applied to compute an uncertain polynomial system, whose set of trajectories contains that of the original non-polynomial system. The efficiency of the presented method is illustrated by some numerical examples.     

Smoothing of Radon projections type of data by bivariate polynomials

Given information about a function in two variables, consisting of a finite number of Radon projections, we study the problem of smoothing this data by a bivariate polynomial. It turns out that the smoothing problem is closely connected with the interpolation problem. We propose several schemes consisting of sets of parallel chords in the unit disk which ensure uniqueness of the bivariate polynomial having prescribed Radon projections along these chords. Regular schemes play an important role in both interpolation and smoothing of such kind of data. We prove that the existence and uniqueness of the best smoothing polynomial relies on a regularity property of the scheme of chords. Results of some numerical experiments are presented too.     

Hermite interpolation with symmetric polynomials

We study the Hermite interpolation problem on the spaces of symmetric bivariate polynomials. We show that the multipoint Berzolari-Radon sets solve the problem. We also give a Newton formula for the interpolation polynomial and use it to prove a continuity property of the interpolation polynomial with respect to the interpolation points.     

矩形网格上一类二元有理插值问题

本文首先利用Ｖａｎｄｅｒｍｏｎｄｅ矩阵得到矩形网格上二元多项式插值公式,然后利用该公式建立一类二元有理插值问题的存在性判别准则及有理插值函数的表现公式,并给出数值例子     

矩形网格上的二元切触有理插值

二元切触有理插值是有理插值的一个重要内容,而降低其函数的次数和解决其函数的存在性是有理插值的一个重要问题.二元切触有理插值算法的可行性大都是有条件的,且计算复杂度较大,有理函数的次数较高.利用二元Hermite（埃米特）插值基函数的方法和二元多项式插值误差性质,构造出了一种二元切触有理插值算法并将其推广到向量值情形.较之其它算法,有理插值函数的次数和计算量较低.最后通过数值实例说明该算法的可行性是无条件的,且计算量低.     

Asymptotic Conditions for Degree Diminution Along Prescribed Lines

One of the problems in bivariate polynomial interpolation is the choice of a space of polynomials suitable for interpolating a given set of data. Depending on the number of data, a usual space is that of polynomials in 2 variables of total degree not greater than k. However, these spaces are not enough to cover many interpolation problems. Here, we are interested in spaces of polynomials of total degree not greater than k whose degree diminishes along some prescribed directions. These spaces arise naturally in some interpolation problems and we describe them in terms of polynomials satisfying some asymptotic interpolation conditions. This provides a general frame to the interpolation problems studied in some of our recent papers.     

Unisolvency for multivariate polynomial interpolation in Coatmèlec configurations of nodes

A new and straightforward proof of the unisolvability of the problem of multivariate polynomial interpolation based on Coatmèlec configurations of nodes, a class of properly posed set of nodes defined by hyperplanes, is presented. The proof generalizes a previous one for the bivariate case and is based on a recursive reduction of the problem to simpler ones following the so-called Radon-Bézout process.     

A discrete adapted hierarchical basis solver for radial basis function interpolation

In this paper we develop a discrete Hierarchical Basis (HB) to efficiently solve the Radial Basis Function (RBF) interpolation problem with variable polynomial degree. The HB forms an orthogonal set and is adapted to the kernel seed function and the placement of the interpolation nodes. Moreover, this basis is orthogonal to a set of polynomials up to a given degree defined on the interpolating nodes. We are thus able to decouple the RBF interpolation problem for any degree of the polynomial interpolation and solve it in two steps: (1) The polynomial orthogonal RBF interpolation problem is efficiently solved in the transformed HB basis with a GMRES iteration and a diagonal (or block SSOR) preconditioner. (2) The residual is then projected onto an orthonormal polynomial basis. We apply our approach on several test cases to study its effectiveness.     

Block Based Bivariate Blending Rational Interpolation via Symmetric Branched Continued Fractions

This paper constructs a new kind of block based bivariate blending rational interpolation via symmetric branched continued fractions. The construction process may be outlined as follows. The first step is to divide the original set of support points into some subsets (blocks). Then construct each block by using symmetric branched continued fraction. Finally assemble these blocks by Newton’s method to shape the whole interpolation scheme. Our new method offers many flexible bivariate blending rational interpolation schemes which include the classical bivariate Newton’s polynomial interpolation and symmetric branched continued fraction interpolation as its special cases. The block based bivariate blending rational interpolation is in fact a kind of tradeoff between the purely linear interpolation and the purely nonlinear interpolation. Finally, numerical examples are given to show the effectiveness of the proposed method.     

The Minkowski dimension of the bivariate fractal interpolation surfaces

We present a new construction of continuous bivariate fractal interpolation surface for every set of data. Furthermore, we generalize this construction to higher dimensions. Exact values for the Minkowski dimension of the bivariate fractal interpolation surfaces are obtained.     

Newton-Thiele's rational interpolants

It is well known that Newton's interpolation polynomial is based on divided differences which produce useful intermediate results and allow one to compute the polynomial recursively. Thiele's interpolating continued fraction is aimed at building a rational function which interpolates the given support points. It is interesting to notice that Newton's interpolation polynomials and Thiele's interpolating continued fractions can be incorporated in tensor‐product‐like manner to yield four kinds of bivariate interpolation schemes. Among them are classical bivariate Newton's interpolation polynomials which are purely linear interpolants, branched continued fractions which are purely nonlinear interpolants and have been studied by Chaffy, Cuyt and Verdonk, Kuchminska, Siemaszko and many other authors, and Thiele-Newton's bivariate interpolating continued fractions which are investigated in another paper by one of the authors. In this paper, emphasis is put on the study of Newton-Thiele's bivariate rational interpolants. By introducing so‐called blending differences which look partially like divided differences and partially like inverse differences, we give a recursive algorithm accompanied with a numerical example. Moreover, we bring out the error estimation and discuss the limiting case. This revised version was published online in June 2006 with corrections to the Cover Date.     

凸四边形上一类具有C~2-连续的插值问题的样条解及其应用

本文讨论了一类凸四边形上的插值问题.指出这类插值问题是可解的,其解是分片二元三次多项式,且在凸四边形上是C~2-连续的.我们证明了这类插值问题的解的存在性和唯一性,给出了解样条的分片表达式及其逼近度的估计.最后还给出了一个应用实例和图形显示来说明本方法是可行的.     

Complementary Lidstone interpolation on scattered data sets

Recently we have introduced a new technique for combining classical bivariate Shepard operators with three point polynomial interpolation operators (Dell’Accio and Di Tommaso, On the extension of the Shepard-Bernoulli operators to higher dimensions, unpublished). This technique is based on the association, to each sample point, of a triangle with a vertex in it and other ones in its neighborhood to minimize the error of the three point interpolation polynomial. The combination inherits both degree of exactness and interpolation conditions of the interpolation polynomial at each sample point, so that in Caira et al. (J Comput Appl Math 236:1691–1707, 2012) we generalized the notion of Lidstone Interpolation (LI) to scattered data sets by combining Shepard operators with the three point Lidstone interpolation polynomial (Costabile and Dell’Accio, Appl Numer Math 52:339–361, 2005). Complementary Lidstone Interpolation (CLI), which naturally complements Lidstone interpolation, was recently introduced by Costabile et al. (J Comput Appl Math 176:77–90, 2005) and drawn on by Agarwal et al. (2009) and Agarwal and Wong (J Comput Appl Math 234:2543–2561, 2010). In this paper we generalize the notion of CLI to bivariate scattered data sets. Numerical results are provided.     

On the bivariate Shepard-Lidstone operators

We propose a new combination of the bivariate Shepard operators (Coman and Trîmbi?a?, 2001 [2]) by the three point Lidstone polynomials introduced in Costabile and Dell’Accio (2005) [7]. The new combination inherits both degree of exactness and Lidstone interpolation conditions at each node, which characterize the interpolation polynomial. These new operators find application to the scattered data interpolation problem when supplementary second order derivative data are given (Kraaijpoel and van Leeuwen, 2010 [13]). Numerical comparison with other well known combinations is presented.     

矩形网格上二元有理插值的存在性问题

In this paper, making use of bivariate polynomial Lagrange iterpolation formula on rectangular grids, we set up the existence criterion of bivariate rational interpolants problem and its representation formula. Numerical examples are given.     

Semi inherited bivariate interpolation

The bivariate interpolation in two dimensional space R2 is more complicated than that in one dimensional space R, because there is no Haar space of continuous functions in R2. Therefore, the bivariate interpolation has not a unique solution for a set of arbitrary distinct pairwise points. In this work, we suggest a type of basis which depends on the points such that the bivariate interpolation has the unique solution for any set of distinct pairwise points. In this case, the matrix of bivariate interpolation has the semi inherited factorization.     

Strictly positive definite functions on spheres in Euclidean spaces

In this paper we study strictly positive definite functions on the unit sphere of the -dimensional Euclidean space. Such functions can be used for solving a scattered data interpolation problem on spheres. Since positive definite functions on the sphere were already characterized by Schoenberg some fifty years ago, the issue here is to determine what kind of positive definite functions are actually strictly positive definite. The study of this problem was initiated recently by Xu and Cheney (Proc. Amer. Math. Soc. 116 (1992), 977--981), where certain sufficient conditions were derived. A new approach, which is based on a critical connection between this problem and that of multivariate polynomial interpolation on spheres, is presented here. The relevant interpolation problem is subsequently analyzed by three different complementary methods. The first is based on the de Boor-Ron general ``least solution for the multivariate polynomial interpolation problem'. The second, which is suitable only for , is based on the connection between bivariate harmonic polynomials and univariate analytic polynomials, and reduces the problem to the structure of the integer zeros of bounded univariate exponentials. Finally, the last method invokes the realization of harmonic polynomials as the polynomial kernel of the Laplacian, thereby exploiting some basic relations between homogeneous ideals and their polynomial kernels.

     

Fast computation of determinants of Bézout matrices and application to curve implicitization

When using bivariate polynomial interpolation for computing the implicit equation of a rational plane algebraic curve given by its parametric equations, the generation of the interpolation data is the most costly of the two stages of the process. In this work a new way of generating those interpolation data with less computational cost is presented. The method is based on an efficient computation of the determinants of certain constant Bézout matrices.     

Block based Newton-like blending osculatory rational interpolation

With Newton’s interpolating formula, we construct a kind of block based Newton-like blending osculatory interpolation.The interpolation provides us many flexible interpolation schemes for choices which include the expansive Newton’s polynomial interpolation as its special case. A bivariate analogy is also discussed and numerical examples are given to show the effectiveness of the interpolation.