Bivariate interpolation based on univariate subdivision schemes

The paper presents a bivariate subdivision scheme interpolating data consisting of univariate functions along equidistant parallel lines by repeated refinements. This method can be applied to the construction of a surface passing through a given set of parametric curves. Following the methodology of polysplines and tension surfaces, we define a local interpolator of four consecutive univariate functions, from which we sample a univariate function at the mid-point. This refinement step is the basis to an extension of the 4-point subdivision scheme to our setting. The bivariate subdivision scheme can be reduced to a countable number of univariate, interpolatory, non-stationary subdivision schemes. Properties of the generated interpolant are derived, such as continuity, smoothness and approximation order.     

A unified framework for interpolating and approximating univariate subdivision

In this paper we show that the refinement rules of interpolating and approximating univariate subdivision schemes with odd-width masks of finite support can be derived ones from the others by simple operations on the mask coefficients. These operations are formalized as multiplication/division of the associated generating functions by a proper link polynomial.We then apply the proposed result to some families of stationary and non-stationary subdivision schemes, showing that it also provides a constructive method for the definition of novel refinement algorithms.     

Smoothness equivalence properties of univariate subdivision schemes and their projection analogues

We study the following modification of a linear subdivision scheme S: let M be a surface embedded in Euclidean space, and P a smooth projection mapping onto M. Then the P-projection analogue of S is defined as T := P ◦ S. As it turns out, the smoothness of the scheme T is always at least as high as the smoothness of the underlying scheme S or the smoothness of P minus 1, whichever is lower. To prove this we use the method of proximity as introduced by Wallner et al. (Constr Approx 24(3):289–318, 2006; Comput Aided Geom Design 22(7):593–622, 2005). While smoothness equivalence results are already available for interpolatory schemes S, this is the first result that confirms smoothness equivalence properties of arbitrary order for general non-interpolatory schemes.     

Families of univariate and bivariate subdivision schemes originated from quartic B-spline

Families of parameter dependent univariate and bivariate subdivision schemes are presented in this paper. These families are new variants of the Lane-Riesenfeld algorithm. So the subdivision algorithms consist of both refining and smoothing steps. In refining step, we use the quartic B-spline based subdivision schemes. In smoothing step, we average the adjacent points. The bivariate schemes are the non-tensor product version of our univariate schemes. Moreover, for odd and even number of smoothing steps, we get the primal and dual schemes respectively. Higher regularity of the schemes can be achieved by increasing the number of smoothing steps. These schemes can be nicely generalized to contain local shape parameters that allow the user to adjust locally the shape of the limit curve/surface.     

Geometrically concave univariate distributions

In this paper our aim is to show that if a probability density function is geometrically concave (convex), then the corresponding cumulative distribution function and the survival function are geometrically concave (convex) too, under some assumptions. The proofs are based on the so-called monotone form of l'Hospital's rule and permit us to extend our results to the case of the concavity (convexity) with respect to Hölder means. To illustrate the applications of the main results, we discuss in details the geometrical concavity of the probability density function, cumulative distribution function and survival function of some common continuous univariate distributions. Moreover, at the end of the paper, we present a simple alternative proof to Schweizer's problem related to the Mulholland's generalization of Minkowski's inequality.     

On vector subdivision

In this paper we give a complete characterization of the convergence of stationary vector subdivision schemes and the regularity of the associated limit function. These results extend and complete our earlier work on vector subdivision and its use in the construction of multiwavelets. Received March 19, 1997; in final form November 13, 1997     

On univariate function identification problems

Mathematical Programming - Applications in the areas of data fitting, forecasting, and estimation naturally lead to a rich class of constrained infinite-dimensional optimization problems over...     

From symmetric subdivision masks of Hurwitz type to interpolatory subdivision masks

In this paper we present a general strategy to deduce a family of interpolatory masks from a symmetric Hurwitz non-interpolatory one. This brings back to a polynomial equation involving the symbol of the non-interpolatory scheme we start with. The solution of the polynomial equation here proposed, tailored for symmetric Hurwitz subdivision symbols, leads to an efficient procedure for the computation of the coefficients of the corresponding family of interpolatory masks. Several examples of interpolatory masks associated with classical approximating masks are given.     

Distribution-free monitoring of univariate processes

We consider statistical process control (SPC) of univariate processes when observed data are not normally distributed. Most existing SPC procedures are based on the normality assumption. In the literature, it has been demonstrated that their performance is unreliable in cases when they are used for monitoring non-normal processes. To overcome this limitation, we propose two SPC control charts for applications when the process data are not normal, and compare them with the traditional CUSUM chart and two recent distribution-free control charts. Some empirical guidelines are provided for practitioners to choose a proper control chart for a specific application with non-normal data.     

Zeros of univariate interval polynomials

Polynomials with perturbed coefficients, which can be regarded as interval polynomials, are very common in the area of scientific computing due to floating point operations in a computer environment. In this paper, the zeros of interval polynomials are investigated. We show that, for a degree n interval polynomial, the number of interval zeros is at most n and the number of complex block zeros is exactly n if multiplicities are counted. The boundaries of complex block zeros on a complex plane are analyzed. Numeric algorithms to bound interval zeros and complex block zeros are presented.     

Finiteness conjecture and subdivision

The finiteness conjecture by J.C. Lagarias and Y. Wang states that the joint spectral radius of a finite set of square matrices is attained on some finite product of such matrices. This conjecture is known to be false in general. Nevertheless, we show that this conjecture is true for a big class of finite sets of square matrices used for the smoothness analysis of scalar univariate subdivision schemes with finite masks.     

Robust estimation ofk-component univariate normal mixtures

The estimating equations derived from minimising aL ₂ distance between the empirical distribution function and the parametric distribution representing a mixture ofk normal distributions with possibly different means and/or different dispersion parameters are given explicitly. The equations are of theM estimator form in which the function is smooth, bounded and has bounded partial derivatives. As a consequence it is shown that there is a solution of the equations which is robust. In particular there exists a weakly continuous, Fréchet differentiable root and hence there is a consistent root of the equations which is asymptotically normal. These estimating equations offer a robust alternative to the maximum likelihood equations, which are known to yield nonrobust estimators.     

Edge subdivision and dimension

The dimension of a partial order can be multiplied by an arbitrarily large factor when edges are subdivided.This research was supported by National Science Foundation grant DCR-8604577.     

Spectra of subdivision operators

Let be a sequence of complex numbers and except for finitely many . The subdivision operator associated with is the bi-infinite matrix . This operator plays an important role in wavelet analysis and subdivision algorithms. As the adjoint it is closely related to the well-known transfer operators (also called Ruelle operator).

In this paper we show that for any , the spectrum of in is always a closed disc centered at the origin. Moreover, except for finitely many points, all the points in the open disc of the spectrum lie in the residual spectrum.

     

Noninterpolatory Hermite subdivision schemes

Bivariate interpolatory Hermite subdivision schemes have recently been applied to build free-form subdivision surfaces. It is well known to geometric modelling practitioners that interpolatory schemes typically lead to ``unfair" surfaces--surfaces with unwanted wiggles or undulations--and noninterpolatory (a.k.a. approximating in the CAGD community) schemes are much preferred in geometric modelling applications. In this article, we introduce, analyze and construct noninterpolatory Hermite subdivision schemes, a class of vector subdivision schemes which can be applied to iteratively refine Hermite data in a not necessarily interpolatory fashion. We also study symmetry properties of such subdivision schemes which are crucial for application in free-form subdivision surfaces.

A key step in our mathematical analysis of Hermite type subdivision schemes is that we make use of the strong convergence theory of refinement equations to convert a prescribed geometric condition on the subdivision scheme--namely, the subdivision scheme is of Hermite type--to an algebraic condition on the subdivision mask. The latter algebraic condition can then be used in a computational framework to construct specific schemes.

     

Basis conversions among univariate polynomial representations

In this Note we provide a family of conversion algorithms relating Bernstein polynomials, monomials and the classical families of orthogonal polynomials, such as Jacobi, Gegenbauer, Legendre, Chebyshev, Laguerre and Hermite polynomials. To cite this article: R. Barrio, J.M. Peña, C. R. Acad. Sci. Paris, Ser. I 339 (2004).     

Ternary semigroups

A ternary semigroup is a nonempty set together with a ternary multiplication which is associative. Analogous to the theory of semigroups, a regularity condition on a ternary semigroup is introduced and the properties of regular ternary semigroups are studied. Associated with a ternary semigroup, a semigroup called the semigroup cover is constructed and its properties are investigated.     

Detecting an induced net subdivision

A net is a graph consisting of a triangle C and three more vertices, each of degree one and with its neighbour in C, and all adjacent to different vertices of C. We give a polynomial-time algorithm to test whether an input graph has an induced subgraph which is a subdivision of a net. Unlike many similar questions, this does not seem to be solvable by an application of the “three-in-a-tree” subroutine.