Free-knot Splines Approximation of s-monotone Functions

Let I be a finite interval and r,sN. Given a set M, of functions defined on I, denote by ₊ ^s M the subset of all functions yM such that the s-difference ^s y() is nonnegative on I, >0. Further, denote by ₊ ^s W _p ^r , the class of functions x on I with the seminorm x ^(r)L _p 1, such that ^s x0, >0. Let M _n (h _k ):={ _i=1 ⁿ c _i h _k (w _i t– _i )c _i ,w _i , _i R, be a single hidden layer perceptron univariate model with n units in the hidden layer, and activation functions h _k (t)=t ₊ ^k , tR, kN ₀. We give two-sided estimates both of the best unconstrained approximation E( ₊ ^s W _p ^r ,M _n (h _k ))L _q , k=r–1,r, s=0,1,...,r+1, and of the best s-monotonicity preserving approximation E( ₊ ^s W _p ^r , ₊ ^s M _n (h _k ))L _q , k=r–1,r, s=0,1,...,r+1. The most significant results are contained in theorem 2.2.     

Approximation by Conic Splines

We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ɛ is c ₁ɛ^−1/4 + O(1), if the spline consists of parabolic arcs, and c ₂ɛ^−1/5 + O(1), if it is composed of general conic arcs of varying type. The constants c ₁ and c ₂ are expressed in the Euclidean and affine curvature of the curve. We also show that the Hausdorff distance between a curve and an optimal conic arc tangent at its endpoints is increasing with its arc length, provided the affine curvature along the arc is monotone. This property yields a simple bisection algorithm for the computation of an optimal parabolic or conic spline. The research of SG and GV was partially supported by grant 6413 of the European Commission to the IST-2002 FET-Open project Algorithms for Complex Shapes in the Sixth Framework Program.     

On the Best Least Squares Approximation of Continuous Functions using Linear Splines with Free Knots

Approximations to continuous functions by linear splines cangenerally be greatly improved if the knot points are free variables.In this paper we address the problem of computing a best linearspline L₂-approximant to a given continuous function on a givenclosed real interval with a fixed number of free knots. We describe an algorithm that is currently available and establishthe theoretical basis for two new algorithms that we have developedand tested. We show that one of these new algorithms had goodlocal convergence properties by comparison with the other techniques,though its convergence is quite slow. The second new algorithmis not so robust but is quicker and so is used to aid efficiency.A starting procedure based on a dynamic programming approachis introduced to give more reliable global convergence properties. We thus propose a hybrid algorithm which is both robust andreasonably efficient for this problem.     

On Approximation by Ridge Functions

Ridge functions are defined as functions of the form , where , belongs to the given ``direction' set . In this paper we study the fundamentality of ridge functions for variable directions sets A and discuss the rate of approximation by ridge functions. Date received: June 7, 1994. Date revised: August 3, 1995.     

On the Approximation Order of Splines on Spherical Triangulations

Bounds are provided on how well functions in Sobolev spaces on the sphere can be approximated by spherical splines, where a spherical spline of degree d is a C ^r function whose pieces are the restrictions of homogeneous polynomials of degree d to the sphere. The bounds are expressed in terms of appropriate seminorms defined with the help of radial projection, and are obtained using appropriate quasi-interpolation operators.     

Best Approximation by Free Knot Splines

We consider the problem of finding the best (uniform) approximation of a given continuous function by spline functions with free knots. Our approach can be sketched as follows. By using the Gauß transform with arbitrary positive real parameter t, we map the set of splines under consideration onto a function space, which is arbitrarily close to the spline set, but satisfies the local Haar condition and also possesses other nice structural properties. This enables us to give necessary and sufficient conditions for best approximations (in terms of alternants) and, under some assumptions, even full characterizations and a uniqueness result. By letting t 0, we recover best approximation in the original spline space. Our results are illustrated by some numerical examples, which show in particular the nice alternation behavior of the error function.     

球面上径向基函数最小范数插值逼近的误差估计

研究了球面径向基插值对球面函数的逼近问题,给出了一致逼近的上界估计式．文中结果说明,球面径向基插值的逼近阶会随函数光滑性的提高而增加．     

Approximation of Surfaces by Fairness Bicubic Splines

In this paper we present an approximation method of surfaces by a new type of splines, which we call fairness bicubic splines, from a given Lagrangian data set. An approximating problem of surface is obtained by minimizing a quadratic functional in a parametric space of bicubic splines. The existence and uniqueness of this problem are shown as long as a convergence result of the method is established. We analyze some numerical and graphical examples in order to prove the validity of our method.     

A Data-Reduction Strategy for Splines with Applications to the Approximation of Functions and Data

We present a strategy for reducing the number of knots of agiven B-spline function without perturbing the spline by morethan a given tolerance. The number and location of the remainingknots is determined automatically. Knot removal can be usedsuccessfully to fit a spline to functions and data. We illustratethis with several examples.     

Some Properties of Minimal Splines

S. G. Mikhlin was the first to construct systematically coordinate functions on an equidistant grid solving a system of approximate equations (called “fundamental relations”, see [5]; Goel discussed some special cases earlier in 1969; see also [1, 4, 6]). Further, the idea was developed in the case of irregular grids (which may have finite accumulation points, see [1] ). This paper is devoted to the investigation of A-minimal splines, introduced by the author; they include polynomial minimal splines which have been discussed earlier. Using the idea mentioned above, we give necessary and sufficient conditions for existence, uniqueness and g-continuity of these splines. The application of these results to polynomial splines of m-th degree on an equidistant grid leads us, in particular, to necessary and sufficient conditions for the continuity of their i-th derivative (i = 1, ?, m). These conditions do not exclude discontinuities of other derivatives (e.g. of order less than i). This allows us to give a certain classification of minimal spline spaces. It turns out that the spline classes are in one-to-one-correspondence with certain planes contained in a hyperplane.     

Uniform Approximation by the Highest Defect Continuous Polynomial Splines: Necessary and Sufficient Optimality Conditions and Their Generalisations

In this paper necessary and sufficient optimality conditions for uniform approximation of continuous functions by polynomial splines with fixed knots are derived. The obtained results are generalisations of the existing results obtained for polynomial approximation and polynomial spline approximation. The main result is two-fold. First, the generalisation of the existing results to the case when the degree of the polynomials, which compose polynomial splines, can vary from one subinterval to another. Second, the construction of necessary and sufficient optimality conditions for polynomial spline approximation with fixed values of the splines at one or both borders of the corresponding approximation interval.     

Some Problems of Simultaneous Approximation of Functions of Two Variables and Their Derivatives by Interpolation Bilinear Splines

Exact estimates for the errors of approximation of functions of two variables and their derivatives by interpolation bilinear splines are obtained on certain classes.__________Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 57, No. 2, pp. 147–157, February, 2005.     

On the Approximation of Functions by Polynomials and Entire Functions of Exponential Type

Ukrainian Mathematical Journal - We present a brief survey of works in the approximation theory of functions known to the author and connected with V. K. Dzyadyk’s research works.     

关于随机狄里克莱级数所代表的随机整函数的增长性

Let (Ω,A,P) be a probability spasce. Consider a random Dirichlet series.