Search

Abstract: In this paper we investigate the convergence of subdivision schemes associated with masks being polynomially decay sequences. Two-scale vector refinement equations are the formwhere the vector of functions is in and is polynomially decay sequence of matrices called refinement mask. Associated with the mask a is a linear operator on given byBy using same methods in [B. Han, R. Q. Jia, Characterization of Riesz bases of wavelets generated from multiresolution analysis, manuscript]; [B. Han, Refinable functions and cascade algorithms in weighted spaces with infinitely supported masks, manuscript]; [R.Q. Jia, Q.T. Jiang, Z.W. Shen, Convergence of cascade algorithms associated with nonhomogeneous refinement equations, Proc. Amer. Math. Soc. 129 (2001) 415–427]; [R.Q. Jia, Convergence of vector subdivision schemes and construction of biorthogonal multiple wavelets, in: Advances in Wavelet, Hong Kong,1997, Springer, Singapore, 1998, pp. 199–227], a characterization of convergence of the sequences in the -norm is given, which extends the main results in [R.Q. Jia, S.D. Riemenschneider, D.X. Zhou, Vector subdivision schemes and multiple wavelets, Math. Comp. 67 (1998) 1533–1563] on convergence of the subdivision schemes associated with a finitely supported mask to the case in which mask a is polynomially decay sequence. As an application, we also obtain a characterization of smoothness of solutions of the refinement equation mentioned above for the case . [Copyright &y& Elsevier]

Abstract: Exclusion algorithms have been used recently to find all solutions of a system of nonlinear equations or to find the global minimum of a function over a compact domain. These algorithms are based on a minimization condition that can be applied to each cell in the domain. In this paper, we consider Lipschitz functions of order and give a new minimization condition for the exclusion algorithm. Furthermore, convergence and complexity results are presented for such algorithm. [Copyright &y& Elsevier]