On the regularity of de Rham curves

De?Rham curves are obtained from a?polygonal arc by passing to the limit in repeatedly cutting off the corners: at each step, the segments of the arc are divided into three pieces in the ratio , where is a?given parameter. We find explicitly the sharp exponent of regularity of such a?curve for any?. Regularity is understood in the natural parametrization using the arclength as a?parameter. We also obtain a?formula for the local regularity of a?de?Rham curve at each point and describe the sets of points with given local regularity. In particular, we characterize the sets of points with the largest and the smallest local regularity. The average regularity, which is attained almost everywhere in the Lebesgue measure, is computed in terms of the Lyapunov exponent of certain linear operators. We obtain an integral formula for the average regularity and derive upper and lower bounds.

[1]  Michael F. Barnsley,et al.  Fractals everywhere , 1988 .

[2]  Chen Yushu,et al.  The matric algorithm of Lyapunov exponent for the experimental data obtained in dynamic analysis , 1999 .

[3]  Bin Han,et al.  Analysis and Construction of Optimal Multivariate Biorthogonal Wavelets with Compact Support , 1999, SIAM J. Math. Anal..

[4]  L. Villemoes.  Wavelet analysis of refinement equations , 1994 .

[5]  G. Gripenberg.  COMPUTING THE JOINT SPECTRAL RADIUS , 1996 .

[6]  J. Tsitsiklis,et al.  The boundedness of all products of a pair of matrices is undecidable , 2000 .

[7]  Gilles Deslauriers,et al.  Symmetric Iterative Interpolation Processes , 1989 .

[8]  Gerald Farin,et al.  Curves and surfaces for computer aided geometric design , 1990 .

[9]  John A. Gregory,et al.  Nonuniform corner cutting , 1996, Comput. Aided Geom. Des..

[10]  Claude Brezinski,et al.  Extrapolation methods - theory and practice , 1993, Studies in computational mathematics.

[11]  S. Dubuc,et al.  The Length of the de Rham Curve , 1998 .

[12]  Lyle Noakes,et al.  Nonlinear corner‐cutting , 1998, Adv. Comput. Math..

[13]  Vladimir Yu. Protasov.  Refinement equations with nonnegative coefficients , 2000 .

[14]  Martin Schäfer,et al.  A geometric look at corner cutting , 1997, Comput. Aided Geom. Des..

[15]  K. Ravishankar.  Power law scaling of the top Lyapunov exponent of a Product of Random Matrices , 1989 .

[16]  I. Daubechies,et al.  Two-scale difference equations II. local regularity, infinite products of matrices and fractals , 1992 .

[17]  C. Micchelli,et al.  Uniform refinement of curves , 1989 .

[18]  O. Rioul.  Simple regularity criteria for subdivision schemes , 1992 .

[19]  I. Daubechies,et al.  Two-scale difference equations I: existence and global regularity of solutions , 1991 .

[20]  D. Colella,et al.  Characterizations of Scaling Functions: Continuous Solutions , 1994 .

[21]  G. Rota,et al.  A note on the joint spectral radius , 1960 .

[22]  Juan Manuel Peña,et al.  Error analysis of corner cutting algorithms , 2004, Numerical Algorithms.

[23]  V. Protasov.  The generalized joint spectral radius. A geometric approach , 1997 .

[24]  John N. Tsitsiklis,et al.  Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard , 2000, IEEE Trans. Autom. Control..

[25]  Nira Dyn,et al.  Analysis of uniform binary subdivision schemes for curve design , 1991 .

[26]  George Merrill Chaikin,et al.  An algorithm for high-speed curve generation , 1974, Comput. Graph. Image Process..

[27]  C. Micchelli,et al.  Stationary Subdivision , 1991 .

[28]  V. Protasov.  Asymptotic behaviour of the partition function , 2000 .

[30]  Wei Lin,et al.  The -norm joint spectral radius and its applications in wavelet analysis , 2002 .

[31]  Vincent D. Blondel,et al.  An Elementary Counterexample to the Finiteness Conjecture , 2002, SIAM J. Matrix Anal. Appl..

[32]  Martin Vetterli,et al.  Wavelets and filter banks: theory and design , 1992, IEEE Trans. Signal Process..