A class of nonlinear four-point subdivision schemes

We consider four-point subdivision schemes of the form $$ (Sf)_{2i} = f_i,\qquad (Sf)_{2i+1} = \frac{f_i+f_{i+1}}{2} - \frac{1}{{8}}M\!\left(\strut \Delta^2f_{i-1}, \Delta^2f_i\right) $$ with any M that is originally defined as a positive-valued function for positive arguments and is extended to the whole of ?² by setting $M(x,y):=- M(\left|x\right|,\left|y\right|)$ if x?<?0, y?<?0 and M(x, y)?:?=?0 if xy????0. For these schemes, we study analytic properties, such as convexity preservation, convergence, smoothness of the limit function, stability and approximation order, in terms of simple and easily verifiable conditions on M. Fourth-order approximation on intervals of strict convexity is also investigated. All the results known for the most frequently used schemes, the PPH scheme and the power-p schemes, are included as special cases or improved, and extended to more general situations. The various statements are illustrated by two examples and tested by numerial experiments.     

Approximation order of interpolatory nonlinear subdivision schemes

Linear interpolatory subdivision schemes of C^r smoothness have approximation order at least r+1. The present paper extends this result to nonlinear univariate schemes which are in proximity with linear schemes in a certain specific sense. The results apply to nonlinear subdivision schemes in Lie groups and in surfaces which are obtained from linear subdivision schemes. We indicate how to extend the results to the multivariate case.     

Approximation order from stability for nonlinear subdivision schemes

This paper proves approximation order properties of various nonlinear subdivision schemes. Building on some recent results on the stability of nonlinear multiscale transformations, we are able to give very short and concise proofs. In particular we point out an interesting connection between stability properties and approximation order for nonlinear subdivision schemes.     

Analysis of a class of nonlinear subdivision schemes and associated multiresolution transforms

This paper is devoted to the convergence and stability analysis of a class of nonlinear subdivision schemes and associated multiresolution transforms. As soon as a nonlinear scheme can be written as a specific perturbation of a linear and convergent subdivision scheme, we show that if some contractivity properties are satisfied, then stability and convergence can be achieved. This approach is applied to various schemes, which give different new results. More precisely, we study uncentered Lagrange interpolatory linear schemes, WENO scheme (Liu et al., J Comput Phys 115:200–212, 1994), PPH and Power-P schemes (Amat and Liandrat, Appl Comput Harmon Anal 18(2):198–206, 2005; Serna and Marquina, J Comput Phys 194:632–658, 2004) and a nonlinear scheme using local spherical coordinates (Aspert et al., Comput Aided Geom Des 20:165–187, 2003). Finally, a stability proof is given for the multiresolution transform associated to a nonlinear scheme of Marinov et al. (2005).     

CHARACTERIZATION OF COVERGENT SUBDIVISION SCHEMES

Subdivision schemes provide important techniques for the fast generationof curves and surfaces.A recusive refinement of a given control polygonwill lead in the limit to a desired visually smooth object.These methodsplay also an important role in wavelet analysis.In this paper,we use arather simple way to characterize the convergence of subdivision schemesfor multivariate cases.The results will be used to investigate the regularityof the solutions for dilation equations.     

Scalar and Hermite subdivision schemes

A criterion of convergence for stationary nonuniform subdivision schemes is provided. For periodic subdivision schemes, this criterion is optimal and can be applied to Hermite subdivision schemes which are not necessarily interpolatory. For the Merrien family of Hermite subdivision schemes which involve two parameters, we are able to describe explicitly the values of the parameters for which the Hermite subdivision scheme is convergent.     

de Rham transforms for subdivision schemes

For any subdivision scheme, we define its de Rham transform, which generalizes the de Rham and Chaikin corner cutting. The main property of the de Rham transform is that it preserves a sum rule. This allows comparison of the Hölder regularity of a given subdivision scheme with that of its de Rham transform. A graphical comparison is made for three different families of subdivision schemes, the last one being the generalized four-point scheme.     

Regularity of multivariate vector subdivision schemes

In this paper we discuss methods for investigating the convergence of multivariate vector subdivision schemes and the regularity of the associated limit functions. Specifically, we consider difference vector subdivision schemes whose restricted contractivity determines the convergence of the original scheme and describes the connection between the regularity of the limit functions of the difference subdivision scheme and the original subdivision scheme.     

On polynomial symbols for subdivision schemes

Given a dilation matrix A :ℤ^d→ℤ^d, and G a complete set of coset representatives of 2π(A ^−Tℤ^d/ℤ^d), we consider polynomial solutions M to the equation ∑ _g∈G M(ξ+g)=1 with the constraints that M≥0 and M(0)=1. We prove that the full class of such functions can be generated using polynomial convolution kernels. Trigonometric polynomials of this type play an important role as symbols for interpolatory subdivision schemes. For isotropic dilation matrices, we use the method introduced to construct symbols for interpolatory subdivision schemes satisfying Strang–Fix conditions of arbitrary order. Research partially supported by the Danish Technical Science Foundation, Grant No. 9701481, and by the Danish SNF-PDE network.     

Smoothing analysis of multicolour pattern schemes

In this note we present an analysis of the smoothing properties of three- and four-colour patterns for two-dimensional line relaxation schemes.     

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.     

Multiresolution analyses originated from nonstationary subdivision schemes

We analyze the properties of a new class of totally positive refinable functions obtained from nonstationary subdivision schemes. We show that the corresponding system of the integer translates is linearly independent, satisfies a Whitney–Schoenberg condition, reproduces polynomials up to a certain degree and generates a multiresolution analysis. Finally, pre-wavelets and bases on the interval are constructed.     

Totally positive functions through nonstationary subdivision schemes

In this paper a new class of nonstationary subdivision schemes is proposed to construct functions having all the main properties of B-splines, namely compact support, central symmetry and total positivity. We show that the constructed nonstationary subdivision schemes are asympotically equivalent to the stationary subdivision scheme associated with a B-spline of suitable degree, but the resulting limit function has smaller support than the B-spline although keeping its regularity.     

Estimating error bounds for quaternary subdivision schemes

This paper deals with the error estimation techniques of quaternary subdivision schemes. The estimation is expressed in terms of initial control point sequences and constants. It is independent of subdivision process and parametrization therefore its evaluation is straightforward.     

Curve and surface construction using Hermite subdivision schemes

In this paper we present a very efficient Hermite subdivision scheme, based on rational functions, and outline its potential applications, with special emphasis on the construction of cubic-like B-splines — well suited for the design of constrained curves and surfaces.     

Convergence of subdivision schemes in L p spaces

Abstract. In this paper it is proved that Lp solutions of a refinement equation exist if and only ifthe corresponding subdivision scheme with suitable initial function converges in Lp without anyassumption on the stability of the solutions of the refinement equation. A characterization forconvergence of subdivision scheme is also given in terms of the refinement mask. Thus a com-plete answer to the relation between the existence of Lp solutions of the refinement equation andthe convergence of the corresponding subdivision schemes is given.     

Analysis of some bivariate non-linear interpolatory subdivision schemes

This paper is devoted to the convergence analysis of a class of bivariate subdivision schemes that can be defined as a specific perturbation of a linear subdivision scheme. We study successively the univariate and bivariate case and apply the analysis to the so called Powerp scheme (Serna and Marquina, J Comput Phys 194:632–658, 2004).     

A generalized Taylor factorization for Hermite subdivision schemes

In a recent paper, we investigated factorization properties of Hermite subdivision schemes by means of the so-called Taylor factorization. This decomposition is based on a spectral condition which is satisfied for example by all interpolatory Hermite schemes. Nevertheless, there exist examples of Hermite schemes, especially some based on cardinal splines, which fail the spectral condition. For these schemes (and others) we provide the concept of a generalized Taylor factorization and show how it can be used to obtain convergence criteria for the Hermite scheme by means of factorization and contractivity.     

A generalized Taylor factorization for Hermite subdivision schemes

In a recent paper, we investigated factorization properties of Hermite subdivision schemes by means of the so-called Taylor factorization. This decomposition is based on a spectral condition which is satisfied for example by all interpolatory Hermite schemes. Nevertheless, there exist examples of Hermite schemes, especially some based on cardinal splines, which fail the spectral condition. For these schemes (and others) we provide the concept of a generalized Taylor factorization and show how it can be used to obtain convergence criteria for the Hermite scheme by means of factorization and contractivity.