Vector subdivision schemes in (Lp(Rs))r(1 ≤ p ≤∞) spaces

The purpose of this paper is to investigate the refinement equations of the form ψ(x) = ∑α∈Zs a(α)ψ(Mx - α), x ∈ Rs,where the vector of functions ψ=(ψ1,…,ψr)T is in (Lp(Rs))r, 1≤p≤∞,a(α),α∈Zs,is a finitely supported sequence of r × r matrices called the refinement mask, and M is an s × s integer matrix suchthat lim n→∞ M-n = 0. In order to solve the refinement equation mentioned above, we start with a vectorof compactly supported functions ψ0 ∈ (Lp(Rs))r and use the iteration schemes fn := Qnaψ0,n = 1,2,…,where Qa is the linear operator defined on (Lp(Rs))r given by Qaψ:= ∑α∈Zs a(α)ψ(M·- α),ψ∈ (Lp(Rs))r. This iteration scheme is called a subdivision scheme or cascade algorithm. In this paper, we characterize the Lp-convergence of subdivision schemes in terms of the p-norm joint spectral radius of a finite collection of somelinear operators determined by the sequence a and the set B restricted to a certain invariant subspace, wherethe set B is a complete set of representatives of the distinct cosets of the quotient group Zs/MZs containing 0.     

Lp-Solutions of Vector Refinement Equations with General Dilation Matrix

The purpose of this paper is to investigate the solutions of refinement equations of the form ψ（x）∑α∈Z α（α）ψ（Mx-α）,x∈R, where the vector of functions ψ = （ψ1,..., ψr）^T is in （Lp（R^n））^r, 0 〈 p≤∞, α（α）, α ∈ Z^n, is a finitely supported sequence of r × r matrices called the refinement mask, and M is an s × s integer matrix such that limn→∞M^-n=0, In this article, we characterize the existence of an Lp=solution of the refinement equation for 0〈 p ≤∞, Our characterizations are based on the p-norm joint spectral radius.     

一类具有高阶奇点的竞争扩散系统的波前解

In this paper,the existence of travelling front solution for a class of competition-diffusion system with high-order singular pointwit=diwixx-wαiifi(w),x∈R,t>0,I=1,2 (Ⅰ)is studied,where di,αi>0 (I=1,2) and w=(w1(x,t),w2(x,t)).Under the certain assumptions on f,it is showed that if αi<1 for some I,then (Ⅰ) has no travelling front solution,if αi≥1 for I=1,2,then there is a c0,c*:c0≥c*>0,where c* is called the minimal wave speed of (Ⅰ),such that if c≥c0 or c=c*,then (Ⅰ) has a travelling front solution,if相似文献   

Vector subdivision schemes in (L_p(R~5))~r(1≤p≤∞) spaces

The purpose of this paper is to investigate the refinement equations of the formwhere the vector of functions = (1, … ,r)T is in (LP(R8))T,1 ≤ p ≤∞, α(α),α ∈ Z5, is a finitely supported sequence of r × r matrices called the refinement mask, and M is an s x a integer matrix such that limn→ ∞ M-n = 0. In order to solve the refinement equation mentioned above, we start with a vector of compactly supported functions (0 ∈ (LP(R8))r and use the iteration schemes fn := Qan0,n = 1,2,…, where Qa is the linear operator defined on (Lp(R8))r given byThis iteration scheme is called a subdivision scheme or cascade algorithm. In this paper, we characterize the Lp-convergence of subdivision schemes in terms of the p-norm joint spectral radius of a finite collection of some linear operators determined by the sequence a and the set B restricted to a certain invariant subspace, where the set B is a complete set of representatives of the distinct cosets of the quotient group Z8/MZ8 containing 0.     

Biorthogonal multiple wavelets generated by vector refinement equation

Biorthogonal multiple wavelets are generated from refinable function vectors by using the multiresolution analysis.In this paper we provide a general method for the construction of compactly supported biorthogonal multiple wavelets by refinable function vectors which are the solutions of vector refinement equations of the form (?)(x)=(?)a(α)(?)(Mx-α),x∈R~s, where the vector of functions(?)=((?)_1,...,(?)_r)~T is in(L_2(R~s))~r,a=:(a(α))_(α∈Z~s)is a finitely supported sequence of r×r matrices called the refinement mask,and M is an s×s integer matrix such that lim_(n→∞)M~(-n)=0.Our characterizations are in the general setting and the main results of this paper are the real extensions of some known results.     

A Note on Pseudo Ideals of Fields

Definition A subring A of a ring R is called a pseudo ideal, if for any r∈R and α∈A, r~2α∈A and αr~2∈A. The subring (R)~2={Σ±r_1~2…r_i~2|r_i∈R, t∈N} is called the square closed ring of R. Lemma The square closed ring of a division ring D is the intersection of all nontrivial pseudo ideals of D. Theorem Ⅰ If a simple ring R with a unit has a nontrivial pseudo ideal A containing an invertible element, R has characteristic p=2. In particular, the necessary condition for a division ring containing a nontrivial pseudo ideal is     

Solutions of multiple vector refinement equations with infinite mask

This paper is devoted to investigating the solutions of refinement equations of the form Ф（x）=∑α∈Z^s α（α）Ф（Mx-α）,x∈R^s,where the vector of functions Ф = （Ф1,… ,Фr）^T is in （L1（R^s））^r, α =（α（α））α∈Z^s is an infinitely supported sequence of r × r matrices called the refinement mask, and M is an s × s integer matrix such that lim n→∞ M^-n =0, with m = detM. Some properties about the solutions of refinement equations axe obtained.     

STOCHASTIC HEAT EQUATION WITH FRACTIONAL LAPLACIAN AND FRACTIONAL NOISE:EXISTENCE OF THE SOLUTION AND ANALYSIS OF ITS DENSITY

In this paper we study a fractional stochastic heat equation on R~d(d≥1) with additive noise ?/?t u(t,x) = Dα/δu(t,x) + b(u(t,x)) +W~H(t,x) where D α/δ is a nonlocal fractional differential operator and W~H is a Gaussian-colored noise. We show the existence and the uniqueness of the mild solution for this equation. In addition,in the case of space dimension d=1,we prove the existence of the density for this solution and we establish lower and upper Gaussian bounds for the density by Malliavin calculus.     

具有对称自同态的环及其扩张

Let R be a ring with an endomorphism α and an α-derivation δ. We introduce the notions of symmetric α-rings and weak symmetric α-rings which are generalizations of symmetric rings and weak symmetric rings, respectively, discuss the relations between symmetricα-rings and related rings and investigate their extensions. We prove that if R is a reduced ring and α(1) = 1, then R is a symmetric α-ring if and only if R[x]/(x n) is a symmetric ˉα-ring for any positive integer n. Moreover, it is proven that if R is a right Ore ring, α an automorphism of R and Q(R) the classical right quotient ring of R, then R is a symmetric α-ring if and only if Q(R) is a symmetric ˉα-ring. Among others we also show that if a ring R is weakly 2-primal and(α, δ)-compatible, then R is a weak symmetric α-ring if and only if the Ore extension R[x; α, δ] of R is a weak symmetric ˉα-ring.     

Drift perturbation of subordinate Brownian motions with Gaussian component

Let d ≥ 1 and Z be a subordinate Brownian motion on R~d with infinitesimal generator ? + ψ(?),where ψ is the Laplace exponent of a one-dimensional non-decreasing L′evy process(called subordinator). We establish the existence and uniqueness of fundamental solution(also called heat kernel) pb(t, x, y) for non-local operator L~b= ? + ψ(?) + b ?, where Rb is an Rd-valued function in Kato class K_(d,1). We show that p~b(t, x, y)is jointly continuous and derive its sharp two-sided estimates. The kernel pb(t, x, y) determines a conservative Feller process X. We further show that the law of X is the unique solution of the martingale problem for(L~b, C_c~∞(R~d)) and X is a weak solution of Xt = X0+ Zt + integral from n=0 to t(b(Xs)ds, t ≥ 0).Moreover, we prove that the above stochastic differential equation has a unique weak solution.     

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.     

具有多项式衰减面具的向量细分格式

具有多项式衰减面具的向量细分方程在刻画小波Riesz基和双正交小波等方面有着重要作用.本文主要研究这类方程解的性质.向量的细分方程具有形式：Ф=∑α∈Zsa（α）（2·-α）,其中Ф=（Ф1,...,Фr）T是定义在Rs上的向量函数,a：=（a（α））α∈Zs是一个具有多项式衰减的r×r矩阵序列称为面具.关于面具a定义一个作用在（Lp（Rs））r上的线性算子Qa,Qaf：=∑α∈Zsa（α）f（2·α）.迭代格式（Qanf）n=1,2,...称为向量细分格式或向量细分算法.本文证明如果具有多项式衰减面具的向量细分格式在（L2（Rs））r中收敛,那么其收敛的极限函数将自动具有多项式衰减.另外,给出了当迭代的初始函数满足一定的条件时的向量细分格式的收敛阶.     

Error bounds for a class of subdivision schemes based on the two-scale refinement equation

Subdivision schemes are iterative procedures for constructing curves and constitute fundamental tools in computer aided design. Starting with an initial control polygon, a subdivision scheme refines the values computed in the previous step according to some basic rules. The scheme is said to be convergent if there exists a limit curve. The computed values define a control polygon in each step. This paper is devoted to estimating error bounds between the limit curve and the control polygon defined after k subdivision stages. In particular, a stop criterion of convergence is obtained. The refinement rules considered in the paper are widely used in practice and are associated with the well known two-scale refinement equation including as particular examples the schemes based on Daubechies’ filters. Our results generalize the previous analysis presented by Mustafa et al. in [G. Mustafa, F. Chen, J. Deng, Estimating error bounds for binary subdivision curves/surfaces, J. Comput. Appl. Math. 193 (2006) 596-613] and [G. Mustafa and M.S. Hashmi Subdivision depth computation for n-ary subdivision curves/surfaces, Vis. Comput. 26 (6-8) (2010) 841-851].     

On refinable functions and subdivision with positive masks

We consider aspects of the analysis of refinement equations with positive mask coefficients. First we derive, explicitly in terms of the mask, estimates for the geometric convergence rate of both the cascade algorithm and the corresponding subdivision scheme, as well as the Hölder continuity exponent of the resulting refinable function. Moreover, we show that the subdivision scheme converges for a class of unbounded initial sequences. Finally, we present a regularity result containing sufficient conditions on the mask for the refinable function to possess continuous derivatives up to a given order.     

Normal Multiresolution Approximation of Curves

A multiresolution analysis of a curve is normal if each wavelet detail vector with respect to a certain subdivision scheme lies in the local normal direction. In this paper we study properties such as regularity, convergence, and stability of a normal multiresolution analysis. In particular, we show that these properties critically depend on the underlying subdivision scheme and that, in general, the convergence of normal multiresolution approximations equals the convergence of the underlying subdivision scheme.     

Exponentials Reproducing Subdivision Schemes

This paper is concerned with a family of nonstationary, interpolatory subdivision schemes that have the capability of reproducing functions in a finite-dimensional subspace of exponential polynomials. We give conditions for the existence and uniqueness of such schemes, and analyze their convergence and smoothness. It is shown that the refinement rules of an even-order exponentials reproducing scheme converge to the Dubuc—Deslauriers interpolatory scheme of the same order, and that both schemes have the same smoothness. Unlike the stationary case, the application of a nonstationary scheme requires the computation of a different rule for each refinement level. We show that the rules of an exponentials reproducing scheme can be efficiently derived by means of an auxiliary orthogonal scheme , using only linear operations. The orthogonal schemes are also very useful tools in fitting an appropriate space of exponential polynomials to a given data sequence.     

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.     

曲线的一类非线性多分辨率算法及其收敛性

在曲线的多分辨率分析基础上,构造了一种新的非线性三分多分辨率算法.并研究这个正则三分多分辨率算法的收敛性和稳定性,进一步,证明了小波参数的收敛性精密地依靠这个基本的多分辨率细分算法的收敛性.