AbstractIn this paper, an algorithm has been introduced to produce ternary 2m-point (for any integer m ≥ 1) approximating non-stationary subdivision schemes which can generate the linear spaces spanned by {1; cos(α.); sin(α.)}. The theory of asymptotic equivalence is being used to analyze the convergence and smoothness of the schemes. The proposed algorithm can be consider as the non-stationary counter part of the 2-point and 4-point existing ternary stationary approximating schemes, for different values of m. Moreover, the proposed algorithm has the ability to reproduce or regenerate the conic sections, trigonometric polynomials and trigonometric splines.
ON INTERPOLATION BY ALMOST TRIGONOMETRIC SPLINES
