2000 character limit reached
Convergence of univariate non-stationary subdivision schemes via asymptotical similarity
Published 10 Oct 2014 in math.NA | (1410.2729v1)
Abstract: A new equivalence notion between non-stationary subdivision schemes, termed asymptotical similarity, which is weaker than asymptotical equivalence, is introduced and studied. It is known that asymptotical equivalence between a non-stationary subdivision scheme and a convergent stationary scheme guarantees the convergence of the non-stationary scheme. We show that for non-stationary schemes reproducing constants, the condition of asymptotical equivalence can be relaxed to asymptotical similarity. This result applies to a wide class of non-stationary schemes of importance in theory and applications.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.