首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
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.
3.
Let T:D⊂X→XT:DXX be an iteration function in a complete metric space XX. In this paper we present some new general complete convergence theorems for the Picard iteration xn+1=Txnxn+1=Txn with order of convergence at least r≥1r1. Each of these theorems contains a priori and a posteriori error estimates as well as some other estimates. A central role in the new theory is played by the notions of a function of initial conditions   of TT and a convergence function   of TT. We study the convergence of the Picard iteration associated to TT with respect to a function of initial conditions E:D→XE:DX. The initial conditions in our convergence results utilize only information at the starting point x0x0. More precisely, the initial conditions are given in the form E(x0)∈JE(x0)J, where JJ is an interval on R+R+ containing 0. The new convergence theory is applied to the Newton iteration in Banach spaces. We establish three complete ωω-versions of the famous semilocal Newton–Kantorovich theorem as well as a complete version of the famous semilocal αα-theorem of Smale for analytic functions.  相似文献   

4.
In a rapidly growing population one expects that two individuals chosen at random from the nnth generation are unlikely to be closely related if nn is large. In this paper it is shown that for a broad class of rapidly growing populations this is not the case. For a Galton–Watson branching process with an offspring distribution {pj}{pj} such that p0=0p0=0 and ψ(x)=jpjI{jx}ψ(x)=jpjI{jx} is asymptotic to x−αL(x)xαL(x) as x→∞x where L(⋅)L() is slowly varying at ∞ and 0<α<10<α<1 (and hence the mean m=∑jpj=∞m=jpj=) it is shown that if XnXn is the generation number of the coalescence of the lines of descent backwards in time of two randomly chosen individuals from the nnth generation then n−XnnXn converges in distribution to a proper distribution supported by N={1,2,3,…}N={1,2,3,}. That is, in such a rapidly growing population coalescence occurs in the recent past rather than the remote past. We do show that if the offspring mean mm satisfies 1<m≡∑jpj<∞1<mjpj< and p0=0p0=0 then coalescence time XnXn does converge to a proper distribution as n→∞n, i.e., coalescence does take place in the remote past.  相似文献   

5.
Let KK be a nonempty closed convex subset of a Banach space EE, T:K→KT:KK a continuous pseudo-contractive mapping. Suppose that {αn}{αn} is a real sequence in [0,1][0,1] satisfying appropriate conditions; then for arbitrary x0∈Kx0K, the Mann type implicit iteration process {xn}{xn} given by xn=αnxn1+(1−αn)Txn,n≥0xn=αnxn1+(1αn)Txn,n0, strongly and weakly converges to a fixed point of TT, respectively.  相似文献   

6.
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.  相似文献   

7.
Let KK be a compact convex subset of a real Hilbert space HH; T:K→KT:KK a hemicontractive map. Let {αn}{αn} be a real sequence in [0,1] satisfying appropriate conditions; then for arbitrary x0∈Kx0K, the sequence {xn}{xn} defined iteratively by xn=αnxn1+(1−αn)Txnxn=αnxn1+(1αn)Txn, n≥1n1 converges strongly to a fixed point of TT.  相似文献   

8.
We study the problem (−Δ)su=λeu(Δ)su=λeu in a bounded domain Ω⊂RnΩRn, where λ   is a positive parameter. More precisely, we study the regularity of the extremal solution to this problem. Our main result yields the boundedness of the extremal solution in dimensions n≤7n7 for all s∈(0,1)s(0,1) whenever Ω   is, for every i=1,...,ni=1,...,n, convex in the xixi-direction and symmetric with respect to {xi=0}{xi=0}. The same holds if n=8n=8 and s?0.28206...s?0.28206..., or if n=9n=9 and s?0.63237...s?0.63237.... These results are new even in the unit ball Ω=B1Ω=B1.  相似文献   

9.
In this paper we present an extension of the removal lemma to integer linear systems over abelian groups. We prove that, if the kk-determinantal of an integer (k×m)(k×m) matrix AA is coprime with the order nn of a group GG and the number of solutions of the system Ax=bAx=b with x1X1,…,xmXmx1X1,,xmXm is o(nm−k)o(nmk), then we can eliminate o(n)o(n) elements in each set to remove all these solutions.  相似文献   

10.
We show that the equality m1(f(x))=m2(g(x))m1(f(x))=m2(g(x)) for xx in a neighborhood of a point aa remains valid for all xx provided that ff and gg are open holomorphic maps, f(a)=g(a)=0f(a)=g(a)=0 and m1,m2m1,m2 are Minkowski functionals of bounded balanced domains. Moreover, a polynomial relation between ff and gg is obtained.  相似文献   

11.
We consider a multidimensional diffusion XX with drift coefficient b(α,Xt)b(α,Xt) and diffusion coefficient ?σ(β,Xt)?σ(β,Xt). The diffusion sample path is discretely observed at times tk=kΔtk=kΔ for k=1…nk=1n on a fixed interval [0,T][0,T]. We study minimum contrast estimators derived from the Gaussian process approximating XX for small ??. We obtain consistent and asymptotically normal estimators of αα for fixed ΔΔ and ?→0?0 and of (α,β)(α,β) for Δ→0Δ0 and ?→0?0 without any condition linking ?? and ΔΔ. We compare the estimators obtained with various methods and for various magnitudes of ΔΔ and ?? based on simulation studies. Finally, we investigate the interest of using such methods in an epidemiological framework.  相似文献   

12.
Let kk be any field, GG be a finite group acting on the rational function field k(xg:g∈G)k(xg:gG) by h⋅xg=xhghxg=xhg for any h,g∈Gh,gG. Define k(G)=k(xg:g∈G)Gk(G)=k(xg:gG)G. Noether’s problem asks whether k(G)k(G) is rational (= purely transcendental) over kk. A weaker notion, retract rationality introduced by Saltman, is also very useful for the study of Noether’s problem. We prove that, if GG is a Frobenius group with abelian Frobenius kernel, then k(G)k(G) is retract kk-rational for any field kk satisfying some mild conditions. As an application, we show that, for any algebraic number field kk, for any Frobenius group GG with Frobenius complement isomorphic to SL2(F5)SL2(F5), there is a Galois extension field KK over kk whose Galois group is isomorphic to GG, i.e. the inverse Galois problem is valid for the pair (G,k)(G,k). The same result is true for any non-solvable Frobenius group if k(ζ8)k(ζ8) is a cyclic extension of kk.  相似文献   

13.
Let KK be a closed convex subset of a qq-uniformly smooth separable Banach space, T:K→KT:KK a strictly pseudocontractive mapping, and f:K→Kf:KK an LL-Lispschitzian strongly pseudocontractive mapping. For any t∈(0,1)t(0,1), let xtxt be the unique fixed point of tf+(1-t)Ttf+(1-t)T. We prove that if TT has a fixed point, then {xt}{xt} converges to a fixed point of TT as tt approaches to 0.  相似文献   

14.
It is shown that if a sequence of open nn-sets DkDk increases to an open nn-set DD then reflected stable processes in DkDk converge weakly to the reflected stable process in DD for every starting point xx in DD. The same result holds for censored αα-stable processes for every xx in DD if DD and DkDk satisfy the uniform Hardy inequality. Using the method in the proof of the above results, we also prove the weak convergence of reflected Brownian motions in unbounded domains.  相似文献   

15.
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.  相似文献   

16.
17.
18.
19.
20.
We consider the Mosco convergence of the sets of fixed points for one-parameter strongly continuous semigroups of nonexpansive mappings. One of our main results is the following: Let CC be a closed convex subset of a Hilbert space EE. Let {T(t):t≥0}{T(t):t0} be a strongly continuous semigroup of nonexpansive mappings on CC. The set of all fixed points of T(t)T(t) is denoted by F(T(t))F(T(t)) for each t≥0t0. Let ττ be a nonnegative real number and let {tn}{tn} be a sequence in RR satisfying τ+tn≥0τ+tn0 and tn≠0tn0 for n∈NnN, and limntn=0limntn=0. Then {F(T(τ+tn))}{F(T(τ+tn))} converges to ?t0F(T(t))?t0F(T(t)) in the sense of Mosco.  相似文献   

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

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