Monotone and Convex C 1 Hermite Interpolants Generated by a Subdivision Scheme

   Abstract. We propose C ¹ Hermite interpolants generated by the general subdivision scheme introduced by Merrien [17] and satisfying monotonicity or convexity constraints. For arbitrary values and slopes of a given function f at the end-points of a bounded interval, which are compatible with the contraints, the given algorithms construct shape-preserving interpolants. Moreover, these algorithms are quite simple and fast as well as adapted to CAGD. We also give error estimates in the case of interpolation of smooth functions.     

G1 fitting with clothoids

A new algorithm for the solution to the problem of Hermite G¹ interpolation with a clothoid curve is herein proposed, that is, a clothoid that interpolates two given points in a plane with assigned unit tangent vectors. The interpolation problem is formulated as a system of three nonlinear equations with multiple solutions, which is difficult to solve even numerically. In this work the solution of this system is reduced to the computation of the zeros of only one single nonlinear function in one variable. The location of the relevant zero is tackled analytically: it is provided the interval containing the zero where the solution is proved to exist and to be unique. A simple guess function allows to find that zero with very few iterations in all of the possible instances. Computing clothoid curves calls for evaluating Fresnel‐related integrals, asymptotic expansions near critical values are herein conceived to avoid loss of precision. This is particularly important when the solution of the interpolation problem is close to a straight line or an arc of circle. The present algorithm is shown to be simple and compact. The comparison with literature algorithms proves that the present algorithm converges more quickly and accuracy is conserved in all of the possible instances, whereas other algorithms have a loss of accuracy near the transition zones. Copyright © 2014 John Wiley & Sons, Ltd.     

ON LAGRANGE INTERPOLATION TO ｜x｜^α（1 〈α 〈 2） WITH EQUALLY SPACED NODES

S.M. Lozinskii proved the exact convergence rate at the zero of Lagrange interpolation polynomials to |x| based on equidistant nodes in [−1,1], In 2000, M. Rever generalized S.M. Lozinskii’s result to |x|^α(0≤α≤1). In this paper we will present the exact rate of convergence at the point zero for the interpolants of |x|^α(1<α<2).     

Fast Algorithms for Nonparametric Curve Estimation

Abstract

Naive implementations of local polynomial fits and kernel estimators require almost O(n ²) operations. In this article two fast O(n) algorithms for nonparametric local polynomial fitting are presented. They are based on updating normal equations. Numerical stability is guaranteed by controlling ill-conditioned situations for small bandwidths and data-tuned restarting of the updating procedure. Restarting at every output point results in a moderately fast but highly stable O(n ^7/5) algorithm. Applicability of algorithms is evaluated for estimation of regression curves and their derivatives. The idea is also applied to kernel estimators of regression curves and densities.     

Quadratic Interpolation on Spheres

Riemannian quadratics are C ¹ curves on Riemannian manifolds, obtained by performing the quadratic recursive deCastlejeau algorithm in a Riemannian setting. They are of interest for interpolation problems in Riemannian manifolds, such as trajectory-planning for rigid body motion. Some interpolation properties of Riemannian quadratics are analysed when the ambient manifold is a sphere or projective space, with the usual Riemannian metrics.     

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.     

Sequential Reflexive Logics with Noncontingency Operator

Hilbert systems L and sequential calculi [L ] for the versions of logics L= T,S4,B,S5, and Grz stated in a language with the single modal noncontingency operator A=A¬ A are constructed. It is proved that cut is not eliminable in the calculi [L ], but we can restrict ourselves to analytic cut preserving the subformula property. Thus the calculi [T ], [S4 ], [S5 ] ([Grz ], respectively) satisfy the (weak, respectively) subformula property; for [B ₂ ], this question remains open. For the noncontingency logics in question, the Craig interpolation property is established.     

Shape-Preserving Approximation by Space Curves

This paper describes a new method for the construction of C ² shape-preserving curves which approximate an ordered set of data in R ³. The curves are obtained using the variable degree polynomial spline spaces recently described in [5].     

On the poisedness of Bojanov–Xu interpolation

In this paper, we consider the bivariate Hermite interpolation introduced by Bojanov and Xu [SIAM J. Numer. Anal. 39(5) (2002) 1780–1793]. The nodes of the interpolation with Π_2k-δ, where δ=0 or 1, are the intersection points of 2k+1 distinct rays from the origin with a multiset of k+1-δ concentric circles. Parameters are the values and successive radial derivatives, whenever the corresponding circle is multiple. The poisedness of this interpolation was proved only for the set of equidistant rays [Bojanov and Xu, 2002] and its counterparts with other conic sections [Hakopian and Ismail, East J. Approx. 9 (2003) 251–267]. We show that the poisedness of this (k+1-δ)(2k+1) dimensional Hermite interpolation problem is equivalent to the poisedness of certain 2k+1 dimensional Lagrange interpolation problems. Then the poisedness of Bojanov–Xu interpolation for a wide family of sets of rays satisfying some simple conditions is established. Our results hold also with above circles replaced by ellipses, hyperbolas, and pairs of parallel lines.Next a conjecture [Hakopian and Ismail, J. Approx. Theory 116 (2002) 76–99] concerning a poisedness relation between the Bojanov–Xu interpolation, with set of rays symmetric about x-axis, and certain univariate lacunary interpolations is established. At the end the poisedness for a wide class of lacunary interpolations is obtained.     

Existence and uniqueness of positive radial solutions for a class of quasilinear elliptic equations

The existence and uniqueness of positive radial solutions of the equations of the type [IML0001] in B_R, p>1 with Dirichlet condition are proved for λ large enough and f satisfying a condition[IML0002] is non-decreasing on [IML0003] It is also proved that all the positive solutions in C₁ ⁰(B^R) of the above equations are radially symmetric solutions for f satisfying [IML0004] and λ large enough.     

A unified Pythagorean hodograph approach to the medial axis transform and offset approximation

Algorithms based on Pythagorean hodographs (PH) in the Euclidean plane and in Minkowski space share common goals, the main one being rationality of offsets of planar domains. However, only separate interpolation techniques based on these curves can be found in the literature. It was recently revealed that rational PH curves in the Euclidean plane and in Minkowski space are very closely related. In this paper, we continue the discussion of the interplay between spatial MPH curves and their associated planar PH curves from the point of view of Hermite interpolation. On the basis of this approach we design a new, simple interpolation algorithm. The main advantage of the unifying method presented lies in the fact that it uses, after only some simple additional computations, an arbitrary algorithm for interpolation using planar PH curves also for interpolation using spatial MPH curves. We present the functionality of our method for G¹ Hermite data; however, one could also obtain higher order algorithms.     

Boundary element preconditioners for a hypersingular integral equation on an interval

We propose an almost optimal preconditioner for the iterative solution of the Galerkin equations arising from a hypersingular integral equation on an interval. This preconditioning technique, which is based on the single layer potential, was already studied for closed curves [11,14]. For a boundary element trial space, we show that the condition number is of order (1 + | log h _min|)², where h _min is the length of the smallest element. The proof requires only a mild assumption on the mesh, easily satisfied by adaptive refinement algorithms.     

A de Montessus type convergence study of a least-squares vector-valued rational interpolation procedure

In a recent paper of the author [A. Sidi, A new approach to vector-valued rational interpolation, J. Approx. Theory 130 (2004) 177–187], three new interpolation procedures for vector-valued functions F(z), where F:C→C^N, were proposed, and some of their algebraic properties were studied. One of these procedures, denoted IMPE, was defined via the solution of a linear least-squares problem. In the present work, we concentrate on IMPE, and study its convergence properties when it is applied to meromorphic functions with simple poles and orthogonal vector residues. We prove de Montessus and Koenig type theorems when the points of interpolation are chosen appropriately.     

Probabilistic analysis of a new class of strip packing algorithms

A new class of algorithms for online packing of rectangles into a strip is proposed and studied. It is proved that the expectation of the unfilled area for this class of algorithms is O(N ^2/3) in the standard (for this type of problems) probabilistic model for N random rectangles.     

Characteristic 2 approach to bivariate interpolation problems

We investigate bivariate Hermite interpolation problems in characteristic 2. Given a nonnegative integer t, we describe all the sub-linear systems generated by monomials, in which there is no curve passing through a general point with multiplicity at least 2 ^t . As an application, we show that a certain linear system of plane curves with ten base points is non-special.      

Asymptotic expansion and extrapolation for Bernstein polynomials with applications

Given a real functionf C ^2k [0,1],k 1 and the corresponding Bernstein polynomials {B _n (f)} _n we derive an asymptotic expansion formula forB _n (f). Then, by applying well-known extrapolation algorithms, we obtain new sequences of polynomials which have a faster convergence thanB _n (f). As a subclass of these sequences we recognize the linear combinations of Bernstein polynomials considered by Butzer, Frentiu, and May [2, 6, 9]. In addition we prove approximation theorems which extend previous results of Butzer and May. Finally we consider some applications to numerical differentiation and quadrature and we perform numerical experiments showing the effectiveness of the considered technique.This work was partially supported by a grant from MURST 40.     

Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs

In [1] it is proved that an uncrowded (k + 1)-hypergraph of average degree t^k contains an independent set of size (cn/t)(1n t)^1/k. We present a polynomial time algorithm that finds such an independent set by derandomizing the original probabilistic proof. The technique that we use can be applied to derandomize other random algorithms that use several random variables having sufficiently small variances. © 1996 John Wiley & Sons, Inc.     

On polynomial solvability of some problems of a vector subset choice in a Euclidean space of fixed dimension

The problems under study are connected with the choice of a vector subset from a given finite set of vectors in the Euclidean space ℝ ^k . The sum norm and averaged square of the sumnorm are considered as the target functions (to be maximized). The optimal combinatorial algorithms with time complexity O(k ² n ^2k ) are developed for these problems. Thus, the polynomial solvability of these problems is proved for k fixed.     

Error analysis of finite element approximations of the stochastic Stokes equations

Numerical solutions of the stochastic Stokes equations driven by white noise perturbed forcing terms using finite element methods are considered. The discretization of the white noise and finite element approximation algorithms are studied. The rate of convergence of the finite element approximations is proved to be almost first order (h|ln h|) in two dimensions and one half order ( h^\frac12h^{\frac{1}{2}}) in three dimensions. Numerical results using the algorithms developed are also presented.     

Isolated rational curves on K3-fibered Calabi–Yau threefolds

In this paper we study 16 complete intersection K3-fibered Calabi--Yau variety types in biprojective space ℙ ^{n 1}}×ℙ¹. These are all the CICY-types that are K3 fibered by the projection on the second factor. We prove existence of isolated rational curves of bidegree (d,0) for every positive integer d on a general Calabi–Yau variety of these types. The proof depends heavily on existence theorems for curves on K3-surfaces proved by S. Mori and K. Oguiso. Some of these varieties are related to Calabi–Yau varieties in projective space by a determinantal contraction, and we use this to prove existence of rational curves of every degree for a general Calabi–Yau variety in projective space. Received: 14 October 1997 / Revised version: 18 January 1998