Trianguläre interpolation

Triangular interpolation problems (problems with biorthogonal polynomial sequence) are studied. Convergence of the corresponding interpolation series is investigated. It is shown that the interpolation polynomials form a basis in appropriate nuclear Fréchet spaces. The results are applied to the interpolation of weighted remainders and the Abel-Gončarov interpolation problem.      

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.     

The proper interpolation space for multivariate Birkhoff interpolation

Multivariate Birkhoff interpolation problem has many important applications, such as in finite element method. In this paper two algorithms are given to compute the basis of the minimal interpolation space and the lower interpolation space respectively for an arbitrary given node set and the corresponding interpolation conditions on each node. We can get the monomial basis, Newton-type basis as well as Lagrange-type basis. The interpolation polynomial can be derived from the basis directly.     

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.     

The use of the stochastic arithmetic to estimate the value of interpolation polynomial with optimal degree

One of the considerable discussions in data interpolation is to find the optimal number of data which minimizes the error of the interpolation polynomial. In this paper, first the theorems corresponding to the equidistant nodes and the roots of the Chebyshev polynomials are proved in order to estimate the accuracy of the interpolation polynomial, when the number of data increases. Based on these theorems, then we show that by using a perturbation method based on the CESTAC method, it is possible to find the optimal degree of the interpolation polynomial. The results of numerical experiments are presented.     

Fast factorization of rectangular Vandermonde matrices with Chebyshev nodes

Numerical Algorithms - The polynomial interpolation problem with distinct interpolation points and the polynomial represented in the power basis gives rise to a linear system of equations with a...     

The order of Lebesgue constant of Lagrange interpolation on several intervals

We consider Lagrange interpolation on the set of finitely many intervals. This problem is closely related to the least deviating polynomial from zero on such sets. We will obtain lower and upper estimates for the corresponding Lebesgue constant. The case of two intervals of equal lengths is simpler, and an explicit construction for two non-symmetric intervals will be given only in a special case.     

三奇次散乱点多项式自然样条插值

为解决较为复杂的三变量散乱数据插值问题,提出了一种三元多项式自然样条插值方法.在使得对一种带自然边界条件的目标泛函极小的情况下,用Hilbert空间样条函数方法,构造出了插值问题的解,并可表为一个分块三元三奇次多项式.其表示形式简单,且系数可由系数矩阵对称的线性代数方程组确定.     

Polynomial interpolation of operators

Necessary and sufficient conditions for the solvability of the polynomial operator interpolation problem in an arbitrary vector space are obtained (for the existence of a Hermite-type operator polynomial, conditions are obtained in a Hilbert space). Interpolational operator formulas describing the whole set of interpolants in these spaces as well as a subset of those polynomials preserving operator polynomials of the corresponding degree are constructed. In the metric of a measure space of operators, an accuracy estimate is obtained and a theorem on the convergence of interpolational operator processes is proved for polynomial operators. Applications of the operator interpolation to the solution of some problems are described. Bibliography: 134 titles. This paper is a continuation of the work published inObchyslyuval'na ta Prykladna Maternatyka, No. 78 (1994). The numeration of chapters, assertions, and formulas is continued. Translated fromObchyslyuval'na ta Prykladna Matematyka, No. 79, 1995, pp 10–116.     

High-Dimensional Adaptive Sparse Polynomial Interpolation and Applications to Parametric PDEs

We consider the problem of Lagrange polynomial interpolation in high or countably infinite dimension, motivated by the fast computation of solutions to partial differential equations (PDEs) depending on a possibly large number of parameters which result from the application of generalised polynomial chaos discretisations to random and stochastic PDEs. In such applications there is a substantial advantage in considering polynomial spaces that are sparse and anisotropic with respect to the different parametric variables. In an adaptive context, the polynomial space is enriched at different stages of the computation. In this paper, we study an interpolation technique in which the sample set is incremented as the polynomial dimension increases, leading therefore to a minimal amount of PDE solving. This construction is based on the standard principle of tensorisation of a one-dimensional interpolation scheme and sparsification. We derive bounds on the Lebesgue constants for this interpolation process in terms of their univariate counterpart. For a class of model elliptic parametric PDE’s, we have shown in Chkifa et al. (Modél. Math. Anal. Numér. 47(1):253–280, 2013) that certain polynomial approximations based on Taylor expansions converge in terms of the polynomial dimension with an algebraic rate that is robust with respect to the parametric dimension. We show that this rate is preserved when using our interpolation algorithm. We also propose a greedy algorithm for the adaptive selection of the polynomial spaces based on our interpolation scheme, and illustrate its performance both on scalar valued functions and on parametric elliptic PDE’s.     

Integral Newton-Type Polynomials with Continual Nodes

We construct an integral Newton-type interpolation polynomial with a continual set of nodes. This interpolant is unique and preserves an operator polynomial of the corresponding degree.     

Multivariate Vandermonde Determinants and General Birkhoff Interpolation

In this paper, we consider the Straight Line Type Node Configuration C (SLTNCC) in multivariate polynomial interpolation as the result of different kinds of transformations of lines (such as parallel translations, rotations). Corresponding to these transformations we define different kinds of interpolation problems for the SLTNCC. The expression of the confluent multivariate Vandermonde determinant of the coefficient matrix for each of these interpolation problems is obtained, and from this expression we conclude the related interpolation problem is unisolvent. Also, we give a kind of generalization of the SLTNCC in Section 5. As well, we obtain an expression of the interpolating polynomial for a kind of interpolation problem discussed in this paper.     

Behavioral Models for List Decoding

Recently it has been shown that list decoding of Reed-Solomon codes may be translated into a bivariate interpolation problem. The data consist of pairs in a finite field and the aim is to find a bivariate polynomial that interpolates the given pairs and is minimal with respect to some criterion. We present a systems theoretic approach to this interpolation problem. With the data points we associate a set of time series, also called trajectories. For this set of trajectories we construct the Most Powerful Unfalsified Model (MPUM). This is the smallest possible model that explains these trajectories. The bivariate polynomial is then derived from a specific polynomial representation of the MPUM.     

About measures and nodal systems for which the Hermite interpolants uniformly converge to continuous functions on the circle and interval

We obtain the Laurent polynomial of Hermite interpolation on the unit circle for nodal systems more general than those formed by the n-roots of complex numbers with modulus one. Under suitable assumptions for the nodal system, that is, when it is constituted by the zeros of para-orthogonal polynomials with respect to appropriate measures or when it satisfies certain properties, we prove the convergence of the polynomial of Hermite-Fejér interpolation for continuous functions. Moreover, we also study the general Hermite interpolation problem on the unit circle and we obtain a sufficient condition on the interpolation conditions for the derivatives, in order to have uniform convergence for continuous functions.Finally, we obtain some improvements on the Hermite interpolation problems on the interval and for the Hermite trigonometric interpolation.     

一种广义插值法

本文考虑一种广义插值问题，插值条件为小区间上的积分值，以弥补现有的插值方法在L2空间不再适用的不足，除了多项式插值外，还讨论了两种一次样条插值方法。     

Limit theorems of the theory of discrete periodic splines

It is known from the discrete harmonic analysis that the interpolation problem with equidistant interpolation points has a unique solution. If the right-hand sides in the interpolation problem are fixed, the spline depends on two parameters: the spline order and the number of points located between neighboring interpolation points. We find explicit expressions for the limits of interpolation spllines with respect to each parameter separately and show that both repeated limits exist. We also prove that these repeated limits are equal and their value is an interpolation trigonometric polynomial. Bibliography: 10 titles. Illustrations: 2 figures.     

The interpolation solution of the second basic plane problem of the dynamics of elastic solids

The second basic plane problem of the dynamics of elastic bodies is considered in the Muskhelishvili formulation, when the known boundary displacements are replaced by interpolation time polynomials and the known initial conditions are replaced by polyharmonic functions, which interpolate the initial conditions in a region with a finite number of interpolation nodes. In this case a solution of the problem, called here the interpolation solution, is possible. It must satisfy the dynamic equations and interpolate the boundary displacements and initial displacements and velocities. This solution is constructed in the form of a polynomial and is reduced to solving a series of boundary-value problems for determining the coefficients of this polynomial.     

A note on the complexity of a phaseless polynomial interpolation

In this paper we revisit the classical problem of polynomial interpolation, with a slight twist; namely, polynomial evaluations are available up to a group action of the unit circle on the complex plane. It turns out that this new setting allows for a phaseless recovery of a polynomial in a polynomial time.     

Birkhoff型三角插值

1 引言 Birkhoff三角插值是近年来比较活跃的一个研究课题,涉及Birkhoff三角插值的研究文献也很多(如G.G.Lorentz~([1]),沈燮昌~([2])等综合性文章).     

A New Method for the Construction of Multivariate Minimal Interpolation Polynomial

The extended Hermite interpolation problem on segment points set over n-dimensional Euclidean space is considered. Based on the algorithm to compute the Gröbner basis of Ideal given by dual basis a new method to construct minimal multivariate polynomial which satisfies the interpolation conditions is given.