Upper semicontinuity of parametric projections

In this paper we study upper semicontinuity of the metric projection P _(p)(x) with respect to (x, p), where x is a point in a normed linear space X and (p) is an approximatively compact subset of X depending on a parameter p. An application to parametric spline approximation is given.     

CONTINUITY OF THE ONE-SIDED BEST UNIFORM APPROXIMATION OPERATOR

Abstract

The purpose of this paper is to relate the continuity and selection properties of the one-sided best uniform approximation operator to similar properties of the metric projection. Let M be a closed subspace of C(T) which contains constants. Then the one-sided best uniform approximation operator is Hausdorff continuous (resp. Lipschitz continuous) on C(T) if and only if the metric projection P_M is Haudorff continuous (resp. Lipschitz continuous) on C(T). Also, the metric projection P_M admits a continuous (resp. Lipschitz continuous) selection if and only if the one-sided best uniform approximation operator admits a continuous (resp. Lipschitz continuous) selection.     

Three-Convex Approximation by Free Knot Splines in C [0, 1]

A Jackson-type estimate is obtained for the approximation of 3 -convex functions by 3 -convex splines with free knots. The order of approximation is the same as for the Jackson-type estimate for unconstrained approximation by splines with free knots. Shape-preserving free knot spline approximation of k -convex functions, k > 3 , is also considered. January 15, 1996. Date revised: December 9, 1996.     

Constrained approximation by splines with free knots

In this paper, a method that combines shape preservation and least squares approximation by splines with free knots is developed. Besides the coefficients of the spline a subset of the knot sequence, the so-calledfree knots, is included in the optimization process resulting in a nonlinear least squares problem in both the coefficients and the knots. The original problem, a special case of aconstrained semi-linear least squares problem, is reduced to a problem that has only the knots of the spline as variables. The reduced problem is solved by a generalized Gauss-Newton method. Special emphasise is given to the efficient computation of the residual function and its Jacobian. Dedicated to our colleague and teacher Prof. Dr. J. W. Schmidt on the occasion of his 65th birthday Research of the first author was supported by Deutsche Forschungsgemeinschaft under grant Schm 968/2-1,2-2.     

Fourier Series with Linear Splines on an Interval

We construct orthonormal bases of linear splines on a finite interval [a, b] and then we study the Fourier series associated to these orthonormal bases. For continuous functions defined on [a, b], we prove that the associated Fourier series converges pointwisely on (a, b) and also uniformly on [a, b], if it convergences pointwisely at a and b.     

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.     

Interpolation by periodic splines with Birkhoff knots

Summary We give a complete characterization of the Hermite interpolation problem by periodic splines with Birkhoff knots. As a dual result we derive the characterization of the Birkhoff interpolation by periodic splines with multiple knots.Sponsored by the Bulgarian Ministry of Education and Science under Contract No. MM-15     

S-convex,monotone, and positive interpolation with rational bicubic splines of C2-continuity

In this paper we deal with shape preserving interpolation of data sets given on rectangular grids. The aim is to show that there exist spline interpolants of the continuity classC ² which areS-convex, monotone, or positive if the data sets have these properties. This is done by using particular rational bicubic splines defined on the grids introduced by the data. Interpolants of the desired type can be constructed by a simple search procedure.     

Optimal addition of knots to cubature formulae for planar regions

Summary A method is described to add knots to a cubature formula of degree 2k–1 for an integral over a symmetric region, to obtain a cubature formula of degree 2k+1. This method is used to construct cubature formulae for the square, the circle, the hexagon and the entire plane.     

Hereditary invertible linear surjections and splitting problems for selections

Let A+B be the pointwise (Minkowski) sum of two convex subsets A and B of a Banach space. Is it true that every continuous mapping h:X→A+B splits into a sum h=f+g of continuous mappings f:X→A and g:X→B? We study this question within a wider framework of splitting techniques of continuous selections. Existence of splittings is guaranteed by hereditary invertibility of linear surjections between Banach spaces. Some affirmative and negative results on such invertibility with respect to an appropriate class of convex compacta are presented. As a corollary, a positive answer to the above question is obtained for strictly convex finite-dimensional precompact spaces.     

Extensions by Means of Expansions and Selections

We provide proper mapping-characterizations of some embedding-like properties weaker than -embedding. For instance, we show that a subset A of a space X is -embedded in X if and only if for every continuous map g: A → Y into a Banach space Y of weight w(Y) ⩽ λ, there exists a continuous set-valued mapping φ of X into the nonempty compact subsets of Y such that g is a selection for φ∣A (i.e., g(x) ∈ φ(x) for every x ∈ A). On the other hand, we show that a subset A is C*-embedded in X if and only if for every continuous set-valued mapping φ of X into the non-empty compact subsets of a Banach space Y, every continuous selection g: A → Y for φ∣A is continuously extendable to the whole of X. Combining both results we get the well-known mapping-characterization of -embedding which makes more transparent the relation ‘’. Other weak components of -embedding are described in terms of expansions and selections, possible applications are demonstrated as well.     

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.     

Bivariate spline interpolation with optimal approximation order

Let Δ be a triangulation of some polygonal domain Ω ⊂ R² and let S_q^r(Δ) denote the space of all bivariate polynomial splines of smoothness r and degree q with respect to Δ. We develop the first Hermite-type interpolation scheme for S _q ^r (Δ), q ≥ 3r + 2, whose approximation error is bounded above by Kh ^q +1, where h is the maximal diameter of the triangles in Δ, and the constant K only depends on the smallest angle of the triangulation and is independent of near-degenerate edges and near-singular vertices. Moreover, the fundamental functions of our scheme are minimally supported and form a locally linearly independent basis for a superspline subspace of S _q ^r (Δ). This shows that the optimal approximation order can be achieved by using minimally supported splines. Our method of proof is completely different from the quasi-interpolation techniques for the study of the approximation power of bivariate splines developed in [7] and [18].     

Simple Cubature Formulas with High Polynomial Exactness

We study cubature formulas for d -dimensional integrals with arbitrary weight function of tensor product form. We present a construction that yields a high polynomial exactness: for fixed degree, the number of knots depends on the dimension in an order-optimal way. The cubature formulas are universal: the order of convergence is almost optimal for two different scales of function spaces. The construction is simple: a small number of arithmetical operations is sufficient to compute the knots and the weights of the formulas. August 25, 1997. Date revised: December 3, 1998. Date accepted: March 3, 1999.     

Ordinals and set-valued zero-selections for hyperspaces

A continuous zero-selection f for the Vietoris hyperspace F(X) of the nonempty closed subsets of a space X is a Vietoris continuous map f:F(X)→X which assigns to every nonempty closed subset an isolated point of it. It is well known that a compact space X has a continuous zero-selection if and only if it is an ordinal space, or, equivalently, if X can be mapped onto an ordinal space by a continuous one-to-one surjection. In this paper, we prove that a compact space X has an upper semi-continuous set-valued zero-selection for its Vietoris hyperspace F(X) if and only if X can be mapped onto an ordinal space by a continuous finite-to-one surjection.     

Moduli of continuity of selections from nonconvex maps

We consider two continuous selection problems related to the differential inclusion F(t, x). Assuming thatF is Hölder or Lipschitz continuous with compact, not necessarily convex values, we provide estimates on the modulus of continuity of these selections.     

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 Bound on the Approximation Order of Surface Splines

The functions φ _m :=|.| ^2m-d if d is odd, and φ _m :=|.| ^2m-d \log|.| if d is even, are known as surface splines, and are commonly used in the interpolation or approximation of smooth functions. We show that if one's domain is the unit ball in R ^d , then the approximation order of the translates of φ _m is at most m . This is in contrast to the case when the domain is all of R ^d where it is known that the approximation order is exactly 2m . April 23, 1996. Date revised: May 5, 1997.     

On the relationship between functions with the same optimal knots in spline and piecewise polynomial approximation

The relationship between functions with the same optimal knots for L₂[0, 1] approximation by kth order splines or piecewise polynomials is investigated. It is shown that if two functions have positive continuous kth derivatives they will have the same optimal knots if and only if they differ by a polynomial of order k. An application to design selection for continuous time regression is considered and extensions to L_p approximation are also provided.     

On continuous choice of retractions onto nonconvex subsets

For a Banach space B and for a class A of its bounded closed retracts, endowed with the Hausdorff metric, we prove that retractions on elements A∈A can be chosen to depend continuously on A, whenever nonconvexity of each A∈A is less than . The key geometric argument is that the set of all uniform retractions onto an α-paraconvex set (in the spirit of E. Michael) is -paraconvex subset in the space of continuous mappings of B into itself. For a Hilbert space H the estimate can be improved to and the constant can be replaced by the root of the equation α+α²+α³=1.