Lagrange Interpolation by Bivariate C 1-Splines with Optimal Approximation Order

We develop the first local Lagrange interpolation scheme for C ¹-splines of degree q≥3 on arbitrary triangulations. For doing this, we use a fast coloring algorithm to subdivide about half of the triangles by a Clough–Tocher split in an appropriate way. Based on this coloring, we choose interpolation points such that the corresponding fundamental splines have local support. The interpolating splines yield optimal approximation order and can be computed with linear complexity. Numerical examples with a large number of interpolation points show that our method works efficiently.     

A multivariate QD-like algorithm

The problem of constructing a univariate rational interpolant or Padé approximant for given data can be solved in various equivalent ways: one can compute the explicit solution of the system of interpolation or approximation conditions, or one can start a recursive algorithm, or one can obtain the rational function as the convergent of an interpolating or corresponding continued fraction.In case of multivariate functions general order systems of interpolation conditions for a multivariate rational interpolant and general order systems of approximation conditions for a multivariate Padé approximant were respectively solved in [6] and [9]. Equivalent recursive computation schemes were given in [3] for the rational interpolation case and in [5] for the Padé approximation case. At that moment we stated that the next step was to write the general order rational interpolants and Padé approximants as the convergent of a multivariate continued fraction so that the univariate equivalence of the three main defining techniques was also established for the multivariate case: algebraic relations, recurrence relations, continued fractions. In this paper a multivariate qd-like algorithm is developed that serves this purpose.     

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.     

Analysis and Construction of Multivariate Interpolating Refinable Function Vectors

In this paper, we shall introduce and study a family of multivariate interpolating refinable function vectors with some prescribed interpolation property. Such interpolating refinable function vectors are of interest in approximation theory, sampling theorems, and wavelet analysis. In this paper, we characterize a multivariate interpolating refinable function vector in terms of its mask and analyze the underlying sum rule structure of its generalized interpolatory matrix mask. We also discuss the symmetry property of multivariate interpolating refinable function vectors. Based on these results, we construct a family of univariate generalized interpolatory matrix masks with increasing orders of sum rules and with symmetry for interpolating refinable function vectors. Such a family includes several known important families of univariate refinable function vectors as special cases. Several examples of bivariate interpolating refinable function vectors with symmetry will also be presented.     

On the Relation between Piecewise Polynomial and Rational Approximation in <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(<Emphasis Type="Bold">R</Emphasis><Superscript>2</Superscript>)

In the univariate case there are certain equivalences between the nonlinear approximation methods that use piecewise polynomials and those that use rational functions. It is known that for certain parameters the respective approximation spaces are identical and may be described as Besov spaces. The characterization of the approximation spaces of the multivariate nonlinear approximation by piecewise polynomials and by rational functions is not known. In this work we compare between the two methods in the bivariate case. We show some relations between the approximation spaces of piecewise polynomials defined on n triangles and those of bivariate rational functions of total degree n which are described by n parameters. Thus we compare two classes of approximants with the same number Cn of parameters. We consider this the proper comparison between the two methods.     

Multivariate Bernoulli splines and the periodic interpolation problem

Periodic spline interpolation in Euclidian spaceR d is studied using translates of multivariate Bernoulli splines introduced in [25]. The interpolating polynomial spline functions are characterized by a minimal norm property among all interpolants in a Hilbert space of Sobolev type. The results follow from a relation between multivariate Bernoulli splines and the reproducing kernel of this Hilbert space. They apply to scattered data interpolation as well as to interpolation on a uniform grid. For bivariate three-directional Bernoulli splines the approximation order of the interpolants on a refined uniform mesh is computed.     

An interpolation method by bivariate cubic splines with <Emphasis Type="Italic">c</Emphasis><Superscript>2</Superscript>-join on type-II triangulars at a rectangular domain

In this paper, an interpolating method for bivariate cubic splines with C ²-join on type-II triangular at a rectangular domain is given, and the approximation degree, interpolating existence and uniqueness of the cubic splines are studied. Supported by NSFC General Projects(60473130).     

一种二次保形插值参数曲面

1．引言保形插值是工业设计和制造中经常遇到的问题，有关这方面的研究已有许多文献【‘－u1．设n二Fx；，yi，人，川7一0，1，…；n；j＝0；l，…，。；x；＜x；＋1．l＝0，1，…．n—1；yi＜的十；，J二O，L…，。一卫｝是一给定的数据集，Cadson和［ltsch、Beatson和zejerJ－1985年分别提出的方法只保持被插数据集的轴向单调性；Dodd和Roulier等人于1983和1987年提出的方法只保持被插点集网格线上的轴向凸凹性和单调性；Constantini和FOntanella于1990年提出的方法可保持被插点集在所有于区域的边界及共内部的轴向凸凹性和单调性；…     

A shape-preserving approximation by weighted cubic splines

This paper addresses new algorithms for constructing weighted cubic splines that are very effective in interpolation and approximation of sharply changing data. Such spline interpolations are a useful and efficient tool in computer-aided design when control of tension on intervals connecting interpolation points is needed. The error bounds for interpolating weighted splines are obtained. A method for automatic selection of the weights is presented that permits preservation of the monotonicity and convexity of the data. The weighted B-spline basis is also well suited for generation of freeform curves, in the same way as the usual B-splines. By using recurrence relations we derive weighted B-splines and give a three-point local approximation formula that is exact for first-degree polynomials. The resulting curves satisfy the convex hull property, they are piecewise cubics, and the curves can be locally controlled with interval tension in a computationally efficient manner.     

Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems

We construct iteration functions for the simultaneous computation of the solutions of a system of equations, with local quadratic convergence: they generalize to the multivariate case the well-known Weierstrass function for polynomials, which is expected to be globally convergent except on a zero-measured set of starting points. We clarify these functions using univariate interpolation. Both for polynomials and algebraic systems with real coefficients, we extend the conjecture of global convergence to the research of real roots or solutions.     

Interpolation Wavelets in Boundary Value Problems

We propose and validate a simple numerical method that finds an approximate solution with any given accuracy to the Dirichlet boundary value problem in a disk for a homogeneous equation with the Laplace operator. There are many known numerical methods that solve this problem, starting with the approximate calculation of the Poisson integral, which gives an exact representation of the solution inside the disk in terms of the given boundary values of the required functions. We employ the idea of approximating a given 2π-periodic boundary function by trigonometric polynomials, since it is easy to extend them to harmonic polynomials inside the disk so that the deviation from the required harmonic function does not exceed the error of approximation of the boundary function. The approximating trigonometric polynomials are constructed by means of an interpolation projection to subspaces of a multiresolution analysis (approximation) with basis 2π-periodic scaling functions (more exactly, their binary rational compressions and shifts). Such functions were constructed by the authors earlier on the basis of Meyer-type wavelets; they are either orthogonal and at the same time interpolating on uniform grids of the corresponding scale or only interpolating. The bounds on the rate of approximation of the solution to the boundary value problem are based on the property ofMeyer wavelets to preserve trigonometric polynomials of certain (large) orders; this property was used for other purposes in the first two papers listed in the references. Since a numerical bound of the approximation error is very important for the practical application of the method, a considerable portion of the paper is devoted to this issue, more exactly, to the explicit calculation of the constants in the order bounds of the error known earlier.     

On the variational characterization and convergence of bivariate splines

It is shown that bivariate interpolatory splines defined on a rectangleR can be characterized as being unique solutions to certain variational problems. This variational property is used to prove the uniform convergence of bivariate polynomial splines interpolating moderately smooth functions at data which includes interpolation to values on a rectangular grid. These results are then extended to bivariate splines defined on anL-shaped region.This research was supported by a University of Kansas General Research Grant.     

Zur Approximation pseudoanalytischer Funktionen durch Pseudopolynome

In the theory of pseudoanalytic functions one can define (pseudoanalytic) rational functions, especially polynomials called “pseudopolynomials”. (See Bers [3], [4], Vekua [12]) Therefore it can be developed a theory of approximation and interpolation by rational functions. First results have been published by Bers [3] (Runge's theorem), Ismailov and Taglieva [8]. Let G be a domain of the complex plane bounded by a closed Jordan curve, let w(z) be pseudoanalytic in G. In this paper we deal with a relation between the behaviour of w(z) on C (Hölder-continuity) and the degree of approximation of w(z) by pseudopolynomials. The results correspond to certain theorems of Curtiss, Sewell and Walsh in the theory of analytic functions.     

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

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

AN INTERPOLATION METHOD BY BIVARIATE CUBIC SPLINES WITH C~2 -JOIN ON TYPE-II TRIANGULARS AT A RECTANGULAR DOMAIN

In this paper, an interpolating method for bivariate cubic splines with C2-join on type-II triangular at a rectangular domain is given, and the approximation degree, inter-polating existence and uniqueness of the cubic splines are studied.     

On Optimal Error Bounds for Derivatives of Interpolating Splines on a Uniform Partition

Based on Peano kernel technique, explicit error bounds (optimal for the highest order derivative) are proved for the derivatives of cardinal spline interpolation (interpolating at the knots for odd degree splines and at the midpoints between two knots for even degree splines). The results are based on a new representation of the Peano kernels and on a thorough investigation of their zero distributions. The bounds are given in terms of Euler–Frobenius polynomials and their zeros.     

Free multivariate splines

We introduce a definition of free multivariate splines which generalizes the univariate notion of splines with free knots. We then concentrate on the simplest case, piecewise constant functions and characterize some classes of functions which have a prescribed order of approximation inL _p by these splines. These characterizations involve the classical Besov spaces.     

The Budan-Fourier theorem for splines

The Budan-Fourier theorem for polynomials connects the number of zeros in an interval with the number of sign changes in the sequence of successive derivatives evaluated at the end-points. An extension is offered to splines with knots of arbitrary multiplicities, in which case the connection involves the number of zeros of the highest derivative. The theorem yields bounds on the number of zeros of splines and is a valuable tool in spline interpolation and approximation with boundary conditions.     

Approximation of a function of two variables by a product of functions of one variable on a given domain

We are concerned with the problem of uniform approximation of a continuous function of two variables by a product of continuous functions of one variable on some domain D. This problem have been examined so far only on a rectangular domain D = U × V, where U and V are compact sets. An algorithm to give a solution of this problem in the discrete case is available. We put forward an algorithm which in certain cases allows one to construct an approximate solution of the problem on a given domain (not necessarily rectangular). This approximate solution is built in the form of interpolating natural splines, which in turn are constructed by means of discrete approximation. Depending on the degree of the splines, the problem can be solved in classes of functions with appropriate degree of smoothness.     

Tensor spline approximation

The cyclic-shift tensor-factorization interpolation method recently described by de Boor can be used in particular for least-squares fitting of multivariate data on a rectangular grid and for evaluation of the resulting tensor-product splines, taking advantage of existing linear algebra and univariate spline software. We discuss the computational details of this method, pointing out variants and suggesting techniques for dealing with ill-conditioned least-squares problems.