首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let CC be a closed convex subset of a real Hilbert space HH and assume that TT is an asymptotically κκ-strict pseudo-contraction on CC with a fixed point, for some 0≤κ<10κ<1. Given an initial guess x0∈Cx0C and given also a real sequence {αn}{αn} in (0, 1), the modified Mann’s algorithm generates a sequence {xn}{xn} via the formula: xn+1=αnxn+(1−αn)Tnxnxn+1=αnxn+(1αn)Tnxn, n≥0n0. It is proved that if the control sequence {αn}{αn} is chosen so that κ+δ<αn<1−δκ+δ<αn<1δ for some δ∈(0,1)δ(0,1), then {xn}{xn} converges weakly to a fixed point of TT. We also modify this iteration method by applying projections onto suitably constructed closed convex sets to get an algorithm which generates a strongly convergent sequence.  相似文献   

2.
This paper is concerned with the Cauchy problem for the fast diffusion equation ut−Δum=αup1utΔum=αup1 in RNRN (N≥1N1), where m∈(0,1)m(0,1), p1>1p1>1 and α>0α>0. The initial condition u0u0 is assumed to be continuous, nonnegative and bounded. Using a technique of subsolutions, we set up sufficient conditions on the initial value u0u0 so that u(t,x)u(t,x) blows up in finite time, and we show how to get estimates on the profile of u(t,x)u(t,x) for small enough values of t>0t>0.  相似文献   

3.
Bosek and Krawczyk exhibited an on-line algorithm for partitioning an on-line poset of width ww into w14lgww14lgw chains. They also observed that the problem of on-line chain partitioning of general posets of width ww could be reduced to First-Fit chain partitioning of 2w2+12w2+1-ladder-free posets of width ww, where an mm-ladder is the transitive closure of the union of two incomparable chains x1≤?≤xmx1?xm, y1≤?≤ymy1?ym and the set of comparabilities {x1y1,…,xmym}{x1y1,,xmym}. Here, we provide a subexponential upper bound (in terms of ww with mm fixed) for the performance of First-Fit chain partitioning on mm-ladder-free posets, as well as an exact quadratic bound when m=2m=2, and an upper bound linear in mm when w=2w=2. Using the Bosek–Krawczyk observation, this yields an on-line chain partitioning algorithm with a somewhat improved performance bound. More importantly, the algorithm and the proof of its performance bound are much simpler.  相似文献   

4.
In this paper, we consider the problem (Pε)(Pε) : Δ2u=un+4/n-4+εu,u>0Δ2u=un+4/n-4+εu,u>0 in Ω,u=Δu=0Ω,u=Δu=0 on ∂ΩΩ, where ΩΩ is a bounded and smooth domain in Rn,n>8Rn,n>8 and ε>0ε>0. We analyze the asymptotic behavior of solutions of (Pε)(Pε) which are minimizing for the Sobolev inequality as ε→0ε0 and we prove existence of solutions to (Pε)(Pε) which blow up and concentrate around a critical point of the Robin's function. Finally, we show that for εε small, (Pε)(Pε) has at least as many solutions as the Ljusternik–Schnirelman category of ΩΩ.  相似文献   

5.
It is proved that the cookie-cutter set in RR is structurally instable in C1C1 topology, that means for the invariant set EE of the IFS {fi}i{fi}i, we can always perturb {fi}i{fi}i arbitrarily small in C1C1 topology to provide an IFS {gi}i{gi}i with its invariant set FF, such that dimHE=dimHFdimHE=dimHF and E,FE,F are not Lipschitz equivalent.  相似文献   

6.
7.
We consider G=Γ×S1G=Γ×S1 with ΓΓ being a finite group, for which the complete Euler ring structure in U(G)U(G) is described. The multiplication tables for Γ=D6Γ=D6, S4S4 and A5A5 are provided in the Appendix. The equivariant degree for GG-orthogonal maps is constructed using the primary equivariant degree with one free parameter. We show that the GG-orthogonal degree extends the degree for GG-gradient maps (in the case of G=Γ×S1G=Γ×S1) introduced by G?ba in [K. G?ba, W. Krawcewicz, J. Wu, An equivariant degree with applications to symmetric bifurcation problems I: Construction of the degree, Bull. London. Math. Soc. 69 (1994) 377–398]. The computational results obtained are applied to a ΓΓ-symmetric autonomous Newtonian system for which we study the existence of 2π2π-periodic solutions. For some concrete cases, we present the symmetric classification of the solution set for the systems considered.  相似文献   

8.
9.
Let XX be a uniformly smooth Banach space, CC be a closed convex subset of XX, and AA an m-accretive operator with a zero. Consider the iterative method that generates the sequence {xn}{xn} by the algorithm
xn+1=αnf(xn)+(1−αn)Jrnxn,xn+1=αnf(xn)+(1αn)Jrnxn,
where αnαn and γnγn are two sequences satisfying certain conditions, JrJr denotes the resolvent (I+rA)−1(I+rA)1 for r>0r>0, and f:C→Cf:CC be a fixed contractive mapping. Then as n→∞n, the sequence {xn}{xn} strongly converges to a point in F(A)F(A). The results presented extends and improves the corresponding results of Hong-Kun Xu [Strong convergence of an iterative method for nonexpansive and accretive operators, J. Math. Anal. Appl. 314 (2006) 631–643].  相似文献   

10.
This paper is devoted to construct a family of fifth degree cubature formulae for nn-cube with symmetric measure and nn-dimensional spherically symmetrical region. The formula fornn-cube contains at most n2+5n+3n2+5n+3 points and for nn-dimensional spherically symmetrical region contains only n2+3n+3n2+3n+3 points. Moreover, the numbers can be reduced to n2+3n+1n2+3n+1 and n2+n+1n2+n+1 if n=7n=7 respectively, the latter of which is minimal.  相似文献   

11.
By a perturbation method and constructing comparison functions, we reveal how the inhomogeneous term hh affects the exact asymptotic behaviour of solutions near the boundary to the problem △u=b(x)g(u)+λh(x)u=b(x)g(u)+λh(x), u>0u>0 in ΩΩ, u|Ω=∞u|Ω=, where ΩΩ is a bounded domain with smooth boundary in RNRN, λ>0λ>0, g∈C1[0,∞)gC1[0,) is increasing on [0,∞)[0,), g(0)=0g(0)=0, gg is regularly varying at infinity with positive index ρρ, the weight bb, which is non-trivial and non-negative in ΩΩ, may be vanishing on the boundary, and the inhomogeneous term hh is non-negative in ΩΩ and may be singular on the boundary.  相似文献   

12.
13.
Based on the classical Hermite spline interpolant H2n1H2n1, which is the piecewise interpolation polynomial of class Cn−1Cn1 and degree 2n−12n1, a piecewise interpolation polynomial H2nH2n of degree 2n2n is given. The formulas for computing H2nH2n by H2n1H2n1 and computing H2n+1H2n+1 by H2nH2n are shown. Thus a simple recursive method for the construction of the piecewise interpolation polynomial set {Hj}{Hj} is presented. The piecewise interpolation polynomial H2nH2n satisfies the same interpolation conditions as the interpolant H2n1H2n1, and is an optimal approximation of the interpolant H2n+1H2n+1. Some interesting properties are also proved.  相似文献   

14.
15.
The dynamic behaviour of the one-dimensional family of maps f(x)=c2[(a−1)x+c1]−λ/(α−1)f(x)=c2[(a1)x+c1]λ/(α1) is examined, for representative values of the control parameters a,c1a,c1, c2c2 and λλ. The maps under consideration are of special interest, since they are solutions of the relaxed Newton method derivative being equal to a constant aa. The maps f(x)f(x) are also proved to be solutions of a non-linear differential equation with outstanding applications in the field of power electronics. The recurrent form of these maps, after excessive iterations, shows, in an xnxn versus λλ plot, an initial exponential decay followed by a bifurcation. The value of λλ at which this bifurcation takes place depends on the values of the parameters a,c1a,c1 and c2c2. This corresponds to a switch to an oscillatory behaviour with amplitudes of f(x)f(x) undergoing a period doubling. For values of aa higher than 1 and at higher values of λλ a reverse bifurcation occurs. The corresponding branches converge and a bleb is formed for values of the parameter c1c1 between 1 and 1.20. This behaviour is confirmed by calculating the corresponding Lyapunov exponents.  相似文献   

16.
We prove that if for a continuous map ff on a compact metric space XX, the chain recurrent set, R(f)R(f) has more than one chain component, then ff does not satisfy the asymptotic average shadowing property. We also show that if a continuous map ff on a compact metric space XX has the asymptotic average shadowing property and if AA is an attractor for ff, then AA is the single attractor for ff and we have A=R(f)A=R(f). We also study diffeomorphisms with asymptotic average shadowing property and prove that if MM is a compact manifold which is not finite with dimM=2dimM=2, then the C1C1 interior of the set of all C1C1 diffeomorphisms with the asymptotic average shadowing property is characterized by the set of ΩΩ-stable diffeomorphisms.  相似文献   

17.
The paper deals with the radially symmetric solutions of ut=Δu+um(x,t)vn(0,t)ut=Δu+um(x,t)vn(0,t), vt=Δv+up(0,t)vq(x,t)vt=Δv+up(0,t)vq(x,t), subject to null Dirichlet boundary conditions. For the blow-up classical solutions, we propose the critical exponents for non-simultaneous blow-up by determining the complete and optimal classification for all the non-negative exponents: (i) There exist initial data such that uu (vv) blows up alone if and only if m>p+1m>p+1 (q>n+1q>n+1), which means that any blow-up is simultaneous if and only if m≤p+1mp+1, q≤n+1qn+1. (ii) Any blow-up is uu (vv) blowing up with vv (uu) remaining bounded if and only if m>p+1m>p+1, q≤n+1qn+1 (m≤p+1mp+1, q>n+1q>n+1). (iii) Both non-simultaneous and simultaneous blow-up may occur if and only if m>p+1m>p+1, q>n+1q>n+1. Moreover, we consider the blow-up rate and set estimates which were not obtained in the previously known work for the same model.  相似文献   

18.
In this paper, we study first the problem of nonparametric estimation of the stationary density ff of a discrete-time Markov chain (Xi)(Xi). We consider a collection of projection estimators on finite dimensional linear spaces. We select an estimator among the collection by minimizing a penalized contrast. The same technique enables us to estimate the density gg of (Xi,Xi+1)(Xi,Xi+1) and so to provide an adaptive estimator of the transition density π=g/fπ=g/f. We give bounds in L2L2 norm for these estimators and we show that they are adaptive in the minimax sense over a large class of Besov spaces. Some examples and simulations are also provided.  相似文献   

19.
20.
We consider NN independent stochastic processes (Xj(t),t∈[0,T])(Xj(t),t[0,T]), j=1,…,Nj=1,,N, defined by a one-dimensional stochastic differential equation with coefficients depending on a random variable ?j?j and study the nonparametric estimation of the density of the random effect ?j?j in two kinds of mixed models. A multiplicative random effect and an additive random effect are successively considered. In each case, we build kernel and deconvolution estimators and study their L2L2-risk. Asymptotic properties are evaluated as NN tends to infinity for fixed TT or for T=T(N)T=T(N) tending to infinity with NN. For T(N)=N2T(N)=N2, adaptive estimators are built. Estimators are implemented on simulated data for several examples.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号