Fair upper bounds for the curvature in univariate convex interpolation

In convex interpolation the curvature of the interpolants should be as small as possible. We attack this problem by treating interpolation subject to bounds on the curvature. In view of the concexity the lower bound is equal to zero while the upper bound is assumed to be piecewise constant. The upper bounds are called fair with respect to a function class if the interpolation problem becomes solvable for all data sets in strictly convex position. We derive fair a priori bounds for classes of quadraticC ¹, cubicC ², and quarticC ³ splines on refined grids.     

Approximation by cubicC 1-splines on arbitrary triangulations

Summary In this paper, we present an efficient representation for bivariate piecewise cubicC ¹-splines on arbitrary triangulations. A numerical method is discussed for computing the dimension of the spaceS ₃ ¹ () of these splines. We consider subspaces ofS ₃ ¹ () satisfying certain boundary conditions. Some applications are given where piecewise cubicC ¹-functions are used to solve interpolation problems and least squares approximation problems.     

Admissible slopes for monotone and convex interpolation

Summary In many applications, interpolation of experimental data exhibiting some geometric property such as nonnegativity, monotonicity or convexity is unacceptable unless the interpolant reflects these characteristics. This paper identifies admissible slopes at data points of variousC ¹ interpolants which ensure a desirable shape. We discuss this question, in turn for the following function classes commonly used for shape preserving interpolations: monotone polynomials,C ¹ monotone piecewise polynomials, convex polynomials, parametric cubic curves and rational functions.     

Cubature rule associated with a discrete blending sum of quadratic spline quasi-interpolants

A new cubature rule for a parallelepiped domain is defined by integrating a discrete blending sum of C¹ quadratic spline quasi-interpolants in one and two variables. We give the weights and the nodes of this cubature rule and we study the associated error estimates for smooth functions. We compare our method with cubature rules based on the tensor products of spline quadratures and classical composite Simpson’s rules.     

Basis of splines associated with some singular differential operators

Functions being piecewise in Ker (D ^k DpD) are a special case of Chebyshev splines having one nontrivial weight and also a special case of singular splines. An algorithm is designed which enables calculating with related B-splines and their derivatives. Ifp(t) is approximated by a piecewise constant, an interesting recurrence for calculating with polynomial B-splines is obtained.     

A tension approach to controlling the shape of cubic spline surfaces on FVS triangulations

We propose a parametric tensioned version of the FVS macro-element to control the shape of the composite surface and remove artificial oscillations, bumps and other undesired behaviour. In particular, this approach is applied to C¹ cubic spline surfaces over a four-directional mesh produced by two-stage scattered data fitting methods.     

Two shape preserving lagrangeC 2-interpolants

Summary We present a LagrangeC ²-interpolant to scattered convex data which preserves convexity. We also present a LagrangeC ²-interpolant to uniformly spaced monotone data sites which preserves monotonicity. In both cases no further conditions are required on the data values. These interpolants are explicitely described and local. Error isO(h ³) when the function to be interpolated isC ³.     

Taylorian fields and subdivision algorithms

Some recents papers [3,8] provide a new approach for the concept of subdivision algorithms, widely used in CAGD: they develop the idea of interpolatory subdivision schemes for curves. In this paper, we show how the old results of H. Whitney [13,14] on Taylorian fields giving necessary and sufficient conditions for a function to be of classC ^k on a compact provide also necessary and sufficient conditions which can be used to construct interpolatory subdivision schemes, in order to obtain, at the limit, aC ¹ (orC ^k ,k>1 eventually) function. Moreover, we give general results for the approximation properties of these schemes, and error bounds for the approximation of a given function.     

Error estimates in W 2,∞-semi-norms for discrete interpolating D 2-splines

We derive error estimates in W^2,∞-semi-norms for multivariate discrete D²-splines that interpolate an unknown function at the vertices of given triangulations. These results are widely based on the construction of approximation operators and linear projectors onto piecewise polynomial spaces having weakly stable local bases.     

AC 0-collocation-like method for two-point boundary value problems

Summary A method of a collocation type based onC ⁰-piecewise polynomial spaces is presented for a two-point boundary value problem of the second order. The method has an optimal order of convergence under smoothness requirements on the exact solution which are weaker than forC ¹-collocation methods. If the differential operator is symmetric, a modification of this method leads to a symmetric system of linear equations. It is shown that if the collocation solution is a piecewise polynomial of degree not greater thanr, the method is stable and convergent with orderh ^r inH ¹-norm. A similar symmetric modification forC ⁰-colloction-finite element method [7] is also obtained. Superconvergence at the nodes is established.     

Cubic Spline Prewavelets on the Four-Directional Mesh

Dedicated to Professor M. J. D. Powell on the occasion of his sixty-fifth birthday and his retirement. In this paper, we design differentiable, two-dimensional, piecewise polynomial cubic prewavelets of particularly small compact support. They are given in closed form, and provide stable, orthogonal decompositions of L ² (R ² ) . In particular, the splines we use in our prewavelet constructions give rise to stable bases of spline spaces that contain all cubic polynomials, whereas the more familiar box spline constructions cannot reproduce all cubic polynomials, unless resorting to a box spline of higher polynomial degree.     

TURBS—Topologically Unrestricted Rational B-Splines

We present a new approach to the construction of piecewise polynomial or rational C ^k -spline surfaces of arbitrary topological structure. The basic idea is to use exclusively parametric smoothness conditions, and to solve the well-known problems at extraordinary points by admitting singular parametrizations. The smoothness of the spline surfaces is guaranteed by specifying a regular smooth reparametrization explicitly. The resulting space of topologically unrestricted rational B-splines (TURBS) is linear and possesses a natural refinement property. Compared with all known methods the construction principle of TURBS is of striking simplicity and the required polynomial bi-degree is essentially decreased from O(k ² ) to d=2k+2 . January 5, 1996. Date revised: September 5, 1996.     

Adaption allows efficient integration of functions with unknown singularities

We study numerical integration for functions f with singularities. Nonadaptive methods are inefficient in this case, and we show that the problem can be efficiently solved by adaptive quadratures at cost similar to that for functions with no singularities. Consider first a class of functions whose derivatives of order up to r are continuous and uniformly bounded for any but one singular point. We propose adaptive quadratures Q*_n, each using at most n function values, whose worst case errors are proportional to n^−r. On the other hand, the worst case error of nonadaptive methods does not converge faster than n⁻¹. These worst case results do not extend to the case of functions with two or more singularities; however, adaption shows its power even for such functions in the asymptotic setting. That is, let F^∞_r be the class of r-smooth functions with arbitrary (but finite) number of singularities. Then a generalization of Q*_n yields adaptive quadratures Q**_n such that |I(f)−Q**_n(f)|=O(n^−r) for any f ∈ F^∞_r. In addition, we show that for any sequence of nonadaptive methods there are `many' functions in F^∞_r for which the errors converge no faster than n⁻¹. Results of numerical experiments are also presented. The authors were partially supported, respectively, by the State Committee for Scientific Research of Poland under Project 1 P03A 03928 and by the National Science Foundation under Grant CCR-0095709.     

Convex interval interpolation with cubic splines

A necessary and sufficient criterion is presented under which the problem of the convex interval interpolation with cubicC ¹-splines has at least one solution. The criterion is given as an algorithm which turns out to be effective.Dedicated to Professor Julius Albrecht on the occasion of his 60th birthday.     

Good Banach spaces for piecewise hyperbolic maps via interpolation

We introduce a weak transversality condition for piecewise C^1+α and piecewise hyperbolic maps which admit a C^1+α stable distribution. We show bounds on the essential spectral radius of the associated transfer operators acting on classical anisotropic Sobolev spaces of Triebel–Lizorkin type which are better than previously known estimates (when our assumption on the stable distribution holds). In many cases, we obtain a spectral gap from which we deduce the existence of finitely many physical measures with basin of total measure. The analysis relies on standard techniques (in particular complex interpolation) but gives a new result on bounded multipliers. Our method applies also to piecewise expanding maps and to Anosov diffeomorphisms, giving a unifying picture of several previous results on a simpler scale of Banach spaces.     

The numerical analysis on a Volterra equation with asymptotically periodic solution

We consider order one operational quadrature methods on a certain integro-differential equation of Volterra type on (0,∞), with piecewise linear convolution kernels. The forms of discretization solution are patterned after a continuous one of Hannsgen (1979) [2]. An l¹ remainder stability and an error bound are derived.     

Haar measures on HopfC *-algebras

In this paper, we first use Markov-Kakutani's fixed point theorem to prove the existence and uniqueness of Haar measures on cocommutative HopfC ^*-algebras. Also we show that in the commutative case, there exists a natural one-to-one correspondence between the Haar measure on a given HopfC ^*-algebra and Haar measures on the associated semigroup. Finally, we show that for HopfC ^*-algebras with Peter-Weyl property, they have Haar measures.Work supported in part by the NSF.     

Two interpolation operators on irregularly distributed data in inner product spaces

Two interpolation operators in inner product spaces for irregularly distributed data are compared. The first is a well-known polynomial operator, which in a certain sense generalizes the classical Lagrange interpolation polynomial. The second can be obtained by modifying the first so as to get a partition-of-unity interpolant. Numerical tests and considerations on errors show that the two operators have very different approximation performances, and that by suitable modifications both can provide acceptable results, working in particular from R^m to Rⁿ and from C[−π,π] to R.     

Geometric construction of quintic parametric B-splines

The aim of this paper is to present a new class of B-spline-like functions with tension properties. The main feature of these basis functions consists in possessing C³$C^3$ or even C⁴$C^4$ continuity and, at the same time, being endowed by shape parameters that can be easily handled. Therefore they constitute a useful tool for the construction of curves satisfying some prescribed shape constraints. The construction is based on a geometric approach which uses parametric curves with piecewise quintic components.