On the Interpolation by Discrete Splines with Equidistant Nodes

In this paper we consider equidistant discrete splines S(j), j , which may grow as O(|j|^s) as |j|→∞. Such splines are relevant for the purposes of digital signal processing. We give the definition of the discrete B-splines and describe their properties. Discrete splines are defined as linear combinations of shifts of the B-splines. We present a solution to the problem of discrete spline cardinal interpolation of the sequences of power growth and prove that the solution is unique within the class of discrete splines of a given order.     

The Divergence of Lagrange Interpolation for |x| at Equidistant Nodes

In 1918 S. N. Bernstein published the surprising result that the sequence of Lagrange interpolation polynomials to |x| at equally spaced nodes in [−1, 1] diverges everywhere, except at zero and the end-points. In the present paper, we prove that the sequence of Lagrange interpolation polynomials corresponding to |x|^α (0<α1) on equidistant nodes in [−1, 1] diverges everywhere in the interval except at zero and the end-points.     

Periodic Quartic Splines with Equi-spaced Knots

We define a periodic quartic spline s from its nodal values.We show existence and uniqueness of such splines and obtainerror bounds of the form .     

在等距节点处的反周期函数的(0,m1,m2,...,mp)三角插值

研究了以π为周期的反周期函数的Birkhoff三角插值,解决了在等距节点处的反周期函数的(0,m1,m2,…,mp)三角插值问题,得到了解存在的条件.     

On Weighted Average Interpolation with Cardinal Splines

Given a sequence of data \(\{ y_{n} \} _{n \in \mathbb{Z}}\) with polynomial growth and an odd number \(d\), Schoenberg proved that there exists a unique cardinal spline \(f\) of degree \(d\) with polynomial growth such that \(f ( n ) =y_{n}\) for all \(n\in \mathbb{Z}\). In this work, we show that this result also holds if we consider weighted average data \(f\ast h ( n ) =y_{n}\), whenever the average function \(h\) satisfies some light conditions. In particular, the interpolation result is valid if we consider cell-average data \(\int_{n-a}^{n+a}f ( x ) dx=y_{n}\) with \(0< a\leq 1/2\). The case of even degree \(d\) is also studied.     

On the Zero-Divergence of Equidistant Lagrange Interpolation

 In 1942, P. Szász published the surprising result that if a function f is of bounded variation on [−1, 1] and continuous at 0 then the sequence of the equidistant Lagrange interpolation polynomials converges at 0 to . In the present note we give a construction of a function continuous on [−1, 1] whose Lagrange polynomials diverge at 0. Moreover, we show that the rate of divergence attains almost the maximal possible rate.     

On the Zero-Divergence of Equidistant Lagrange Interpolation

 In 1942, P. Szász published the surprising result that if a function f is of bounded variation on [−1, 1] and continuous at 0 then the sequence of the equidistant Lagrange interpolation polynomials converges at 0 to . In the present note we give a construction of a function continuous on [−1, 1] whose Lagrange polynomials diverge at 0. Moreover, we show that the rate of divergence attains almost the maximal possible rate. (Received 2 February 2000)     

On the Transfinite Interpolation and Approximationby a Class of Periodic Bivariate Cubic Splines onType-II Triangulation

本文讨论了II-型三角剖分     

Local Lagrange Interpolation with Bivariate Splines of Arbitrary Smoothness

We describe a method which can be used to interpolate function values at a set of scattered points in a planar domain using bivariate polynomial splines of any prescribed smoothness. The method starts with an arbitrary given triangulation of the data points, and involves refining some of the triangles with Clough-Tocher splits. The construction of the interpolating splines requires some additional function values at selected points in the domain, but no derivatives are needed at any point. Given n data points and a corresponding initial triangulation, the interpolating spline can be computed in just O(n) operations. The interpolation method is local and stable, and provides optimal order approximation of smooth functions.     

Lebesgue Constant of Local Cubic Splines with Equally Spaced Nodes

It is proved that the uniform Lebesgue constant (the norm of a linear operator from C to C) of local cubic splines with equally spaced nodes, which preserve cubic polynomials, is equal to 11/9.     

Interpolation by Rational Functions with Nodes on the Unit Circle

From the Erds–Turán theorem, it is known that if f is a continuous function on and L _n (f, z) denotes the unique Laurent polynomial interpolating f at the (2 n + 1)th roots of unity, then Several years later, Walsh and Sharma produced similar result but taking into consideration a function analytic in and continuous on and making use of algebraic interpolating polynomials in the roots of unity.In this paper, the above results will be generalized in two directions. On the one hand, more general rational functions than polynomials or Laurent polynomials will be used as interpolants and, on the other hand, the interpolation points will be zeros of certain para-orthogonal functions with respect to a given measure on .     

一类新的插值结点

有界单连通区域Ｇ，其边界θＧ＝Г∈（１，α），α〉０。本计算节以广义Ｆａｂｅｒ多项式φｎ（ｚ）的零点为插值结点的Ｌａｇｒａｎｇｅ插值多项式的逼近性质，得到了它对Ａ（Ｇ↑－）中的函数的一致逼近阶和平均逼近阶的估计，并且得到了它对Ｅ＾ｐ（Ｇ）中函数的平均逼近阶的估计，还指出关于平均逼近阶的估计是不可改进的。     

Study of the Convergence of Interpolation Processes with Splines of Even Degree

Siberian Mathematical Journal - We study the convergence of interpolation processes by Subbotin polynomial splines of even degree. We prove that the good conditionality of a system of equations for...     

Interpolation and Approximation by Splines on [0, ∞ )

We investigate interpolation and approximation problems by splines, which possess a countable set of knots on the positive axis. In particular, we characterize those sets of points, which admit unique Lagrange interpolation and give some sufficient and some necessary conditions for best approximations. Moreover, we show that the classical results of spline-approximation theory are not available for splines with a countable set of knots.     

Weighted Convergence of Lagrange Interpolation Based on Gauss-Kronrod Nodes

The Gauss-Kronrod quadrature scheme, which is based on the zeros of Legendrepolynomials and Stieltjes polynomials, is a standard rule for automaticnumerical integration in mathematical software libraries. For a long time,very little was known about the underlying Lagrange interpolationprocesses. Recently, the authors proved new bounds and asymptoticproperties for the Stieltjes polynomials and, subsequently, appliedthese results to investigate the associated interpolation processes. Thepurpose of this paper is to survey the quality of these interpolationprocesses, with additional results that extend and complete the existingones. The principal new results in this paper are necessary and sufficientconditions for weighted convergence. In particular, we show that theLagrange interpolation polynomials associated with the above interpolationprocesses have the same speed of convergence as the polynomials of bestapproximation in certain weighted Besov spaces.     

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

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

基于等距节点积分公式的牛顿迭代法及其收敛阶

利用等距节点的数值积分公式构造牛顿迭代法的变形格式.我们证明了利用4等分5个节点的Newton-Cotes公式构造的变形牛顿迭代法收敛阶为3,并进一步证明了对于最常用的3等分4节点、5等分6节点、6等分7节点、7等分8节点积分公式,所得到的变形牛顿迭代法收敛阶都是3.最后,本文猜想,利用任意等分的积分公式构造变形牛顿迭代法,所得的迭代格式收敛阶都是3.     

Mean Convergence of Derivatives of Extended Lagrange Interpolation with Additional Nodes

Weighted L^p convergence of derivatives of extended Lagrange interpolation at the union of zeros of generalized Jacobi polynomials and some additional points is investigated.