Divergenzverhalten mehrdimensionaler Shannonscher Abtastreihen

The behaviour of multidimensional Shannon sampling series for continuous functions is examined. A continuous function g ₁∈C ₀ [0,1]² with support in the rectangle [0,1] × [0,?] is indicated in the paper for which the two dimensional Shannon sampling series diverge almost everywhere in the rectangle [0,1] × [?,1]. This shows that the localization principle for Shannon sampling series cannot hold in two dimensions and in higher dimensions. The result solves a problem formulated by P.L. Butzer. Received: 21 December 1995 / Revised version: 5 October 1996     

Mellin-type differential equations and associated sampling expansions

This paper is devoted to a self-contained approach to Mellin-type differential equations and associated ssampling expansions. Here the first order differential operator is not the normal d/dx but D_M,c=xd/dx+c,c E R being connected with the definition of the Mellin transform. Existence and uniqueness theorems are established for a system of first order Mellin equations and the properties of nth order linear equations are investigated. Then self adjoint Mellin-type second order Sturm-Liouville eigenvalue problems are considered and properties of the eigenvalues, eigenfunctions and Green's functions are derived. As applications. sampling representations for two classes of integral transforms arising from the eigenvalue problem are introduced. In the first class the kernesl are solutions of the problem and in the second they are expressed in terms of green's function.     

Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources

The semi-random source, defined by Sántha and Vazirani, is a general mathematical mode for imperfect and correlated sources of randomness (physical sources such as noise dicdes). In this paper an algorithm is presented which efficiently generates “high quality” random sequences (quasirandom bit-sequences) from two independent semi-random sources. The general problem of extracting “high quality” bits is shown to be related to communication complexity theory, leading to a definition of strong communication complexity of a boolean function. A hierarchy theorem for strong communication complexity classes is proved; this allows the previous algorithm to be generalized to one that can generate quasi-random sequences from two communicating semi-random sources This research was supported in part by an IBM Doctoral Felloswhip and by NSF Grant MCS 82-04506.     

A shape-preserving quasi-interpolation operator satisfying quadratic polynomial reproduction property to scattered data

In this paper, we construct a univariate quasi-interpolation operator to non-uniformly distributed data by cubic multiquadric functions. This operator is practical, as it does not require derivatives of the being approximated function at endpoints. Furthermore, it possesses univariate quadratic polynomial reproduction property, strict convexity-preserving and shape-preserving of order 3 properties, and a higher convergence rate. Finally, some numerical experiments are shown to compare the approximation capacity of our quasi-interpolation operator with that of Wu and Schaback’s quasi-interpolation scheme.     

Barycentric rational interpolation with no poles and high rates of approximation

It is well known that rational interpolation sometimes gives better approximations than polynomial interpolation, especially for large sequences of points, but it is difficult to control the occurrence of poles. In this paper we propose and study a family of barycentric rational interpolants that have no real poles and arbitrarily high approximation orders on any real interval, regardless of the distribution of the points. These interpolants depend linearly on the data and include a construction of Berrut as a special case.     

A recursive method for computing interpolants

In this paper, we describe a recursive method for computing interpolants defined in a space spanned by a finite number of continuous functions in R^d${\mathbb{R}}^d$. We apply this method to construct several interpolants such as spline interpolants, tensor product interpolants and multivariate polynomial interpolants. We also give a simple algorithm for solving a multivariate polynomial interpolation problem and constructing the minimal interpolation space for a given finite set of interpolation points.     

A family of stable nonlinear nonseparable multiresolution schemes in 2D

Multiresolution representations of data are powerful tools in data compression. For a proper adaptation to the edges, a good strategy is to consider a nonlinear approach. Thus, one needs to control the stability of these representations. In this paper, 2D multiresolution processing algorithms that ensure this stability are introduced. A prescribed accuracy is ensured by these strategies.     

Bivariate Lagrange interpolation at the Padua points: the ideal theory approach

The Padua points are a family of points on the square [−1, 1]² given by explicit formulas that admits unique Lagrange interpolation by bivariate polynomials. Interpolation polynomials and cubature formulas based on the Padua points are studied from an ideal theoretic point of view, which leads to the discovery of a compact formula for the interpolation polynomials. The L ^p convergence of the interpolation polynomials is also studied. S. De Marchi and M. Vianello were supported by the “ex-60%” funds of the University of Padua and by the INdAM GNCS (Italian National Group for Scientific Computing). Y. Xu was partially supported by NSF Grant DMS-0604056.     

Transfinite interpolation on the medians of a triangle and best L 1-approximation

Let be a triangle in and let be the set of its three medians. We construct interpolants to smooth functions using transfinite (or blending) interpolation on The interpolants are of type f(₁)+g(₂)+h(₃), where (₁,₂,₃) are the barycentric coordinates with respect to the vertices of . Based on an error representation formula, we prove that the interpolant is the unique best L¹-approximant by functions of this type subject the function to be approximated is from a certain convexity cone in C³().Received: 17 December 2003     

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.     

Hermite-Fejer type interpolation of higher order

The paper introduces Hermite-Fejér type (Hermite type) interpolation of higher order denoted by S _mn(f)(S* _mm(f)), and gives some basic properties including expression formulas, convergence relationship between S _mn(f) and H _mn(f) (Hermite-Fejér interpolation of higher order), and the saturation of S _mn(f). Supported by the Science Foundation of Shanxi Province for Returned Scholars.     

On the least squares fit by radial functions to multidimensional scattered data

Summary This paper investigates some aspects of discrete least squares approximation by translates of certain classes of radial functions. Its specific aims are (i) to provide conditions under which the associated least squares matrix is invertible and (ii) to give upper bounds for the Euclidean norms of the inverses of these matrices (when they exist).The second named author was supported by the National Science Foundation under grant number DMS-8901345     

Interpolation lattices in several variables

Principal lattices are classical simplicial configurations of nodes suitable for multivariate polynomial interpolation in n dimensions. A principal lattice can be described as the set of intersection points of n + 1 pencils of parallel hyperplanes. Using a projective point of view, Lee and Phillips extended this situation to n + 1 linear pencils of hyperplanes. In two recent papers, two of us have introduced generalized principal lattices in the plane using cubic pencils. In this paper we analyze the problem in n dimensions, considering polynomial, exponential and trigonometric pencils, which can be combined in different ways to obtain generalized principal lattices.We also consider the case of coincident pencils. An error formula for generalized principal lattices is discussed. Partially supported by the Spanish Research Grant BFM2003-03510, by Gobierno de Aragón and Fondo Social Europeo.     

Lattices on simplicial partitions

In this paper, (d+1)-pencil lattices on simplicial partitions in R^d are studied. The barycentric approach naturally extends the lattice from a simplex to a simplicial partition, providing a continuous piecewise polynomial interpolant over the extended lattice. The number of degrees of freedom is equal to the number of vertices of the simplicial partition. The constructive proof of this fact leads to an efficient computer algorithm for the design of a lattice.     

Lattices on simplicial partitions which are not simply connected

In this paper, (d+1)-pencil lattices on simplicial partitions in R^d, which are not simply connected, are studied. It is shown, how the fact that a partition is not simply connected can be used to increase the flexibility of a lattice. A local modification algorithm is developed also to deal with slight partition topology changes that may appear afterwards a lattice has already been constructed.     

Rational interpolation with a single variable pole

In this paper the necessary and sufficient conditions for given data to admit a rational interpolant in _k,1 with no poles in the convex hull of the interpolation points is studied. A method for computing the interpolant is also provided.Partially supported by DGICYT-0121.     

Multivariate polynomial interpolation under projectivities II: Neville-Aitken formulas

This is the second part of a note on interpolation by real polynomials of several real variables. For certain regular knot systems (geometric or regular meshes, tensor product grids), Neville-Aitken algorithms are derived explicitly. By application of a projectivity they can be extended in a simple way to arbitrary (k+1)-pencil lattices as recently introduced by Lee and Phillips. A numerical example is given.Partially supported by CICYT Res. Grant PS87-0060.Travel Grant Programa Europa 1991, CAI Zaragoza.     

The Lebesgue constant for Lagrange interpolation on equidistant nodes

Summary Forn=1, 2, 3, ..., let _n denote the Lebesgue constant for Lagrange interpolation based on the equidistant nodesx _{k, n} =k, k=0, 1, 2, ...,n. In this paper an asymptotic expansion for log _n is obtained, thereby improving a result of A. Schönhage.