共查询到20条相似文献,搜索用时 31 毫秒
1.
Let C be a closed convex subset of a real Hilbert space H and assume that T is an asymptotically κ-strict pseudo-contraction on C with a fixed point, for some 0≤κ<1. Given an initial guess x0∈C and given also a real sequence {αn} in (0, 1), the modified Mann’s algorithm generates a sequence {xn} via the formula: xn+1=αnxn+(1−αn)Tnxn, n≥0. It is proved that if the control sequence {αn} is chosen so that κ+δ<αn<1−δ for some δ∈(0,1), then {xn} converges weakly to a fixed point of T. 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.
Paul-Emile Maing 《Nonlinear Analysis: Theory, Methods & Applications》2008,68(12):3913-3922
This paper is concerned with the Cauchy problem for the fast diffusion equation ut−Δum=αup1 in RN (N≥1), where m∈(0,1), p1>1 and α>0. The initial condition u0 is assumed to be continuous, nonnegative and bounded. Using a technique of subsolutions, we set up sufficient conditions on the initial value u0 so that u(t,x) blows up in finite time, and we show how to get estimates on the profile of u(t,x) for small enough values of t>0. 相似文献
3.
Bosek and Krawczyk exhibited an on-line algorithm for partitioning an on-line poset of width w into w14lgw chains. They also observed that the problem of on-line chain partitioning of general posets of width w could be reduced to First-Fit chain partitioning of 2w2+1-ladder-free posets of width w, where an m-ladder is the transitive closure of the union of two incomparable chains x1≤?≤xm, y1≤?≤ym and the set of comparabilities {x1≤y1,…,xm≤ym}. Here, we provide a subexponential upper bound (in terms of w with m fixed) for the performance of First-Fit chain partitioning on m-ladder-free posets, as well as an exact quadratic bound when m=2, and an upper bound linear in m when w=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ε) : Δ2u=un+4/n-4+εu,u>0 in Ω,u=Δu=0 on ∂Ω, where Ω is a bounded and smooth domain in Rn,n>8 and ε>0. We analyze the asymptotic behavior of solutions of (Pε) which are minimizing for the Sobolev inequality as ε→0 and we prove existence of solutions to (Pε) which blow up and concentrate around a critical point of the Robin's function. Finally, we show that for ε small, (Pε) has at least as many solutions as the Ljusternik–Schnirelman category of Ω. 相似文献
5.
It is proved that the cookie-cutter set in R is structurally instable in C1 topology, that means for the invariant set E of the IFS {fi}i, we can always perturb {fi}i arbitrarily small in C1 topology to provide an IFS {gi}i with its invariant set F, such that dimHE=dimHF and E,F are not Lipschitz equivalent. 相似文献
6.
7.
We consider G=Γ×S1 with Γ being a finite group, for which the complete Euler ring structure in U(G) is described. The multiplication tables for Γ=D6, S4 and A5 are provided in the Appendix. The equivariant degree for G-orthogonal maps is constructed using the primary equivariant degree with one free parameter. We show that the G-orthogonal degree extends the degree for G-gradient maps (in the case of G=Γ×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π-periodic solutions. For some concrete cases, we present the symmetric classification of the solution set for the systems considered. 相似文献
8.
9.
Let X be a uniformly smooth Banach space, C be a closed convex subset of X, and A an m-accretive operator with a zero. Consider the iterative method that generates the sequence {xn} by the algorithm
where αn and γn are two sequences satisfying certain conditions, Jr denotes the resolvent (I+rA)−1 for r>0, and f:C→C be a fixed contractive mapping. Then as n→∞, the sequence {xn} strongly converges to a point in 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]. 相似文献
xn+1=αnf(xn)+(1−αn)Jrnxn,
10.
This paper is devoted to construct a family of fifth degree cubature formulae for n-cube with symmetric measure and n-dimensional spherically symmetrical region. The formula forn-cube contains at most n2+5n+3 points and for n-dimensional spherically symmetrical region contains only n2+3n+3 points. Moreover, the numbers can be reduced to n2+3n+1 and n2+n+1 if n=7 respectively, the latter of which is minimal. 相似文献
11.
By a perturbation method and constructing comparison functions, we reveal how the inhomogeneous term h affects the exact asymptotic behaviour of solutions near the boundary to the problem △u=b(x)g(u)+λh(x), u>0 in Ω, u|∂Ω=∞, where Ω is a bounded domain with smooth boundary in RN, λ>0, g∈C1[0,∞) is increasing on [0,∞), g(0)=0, g′ is regularly varying at infinity with positive index ρ, the weight b, which is non-trivial and non-negative in Ω, may be vanishing on the boundary, and the inhomogeneous term h is non-negative in Ω and may be singular on the boundary. 相似文献
12.
13.
Based on the classical Hermite spline interpolant H2n−1, which is the piecewise interpolation polynomial of class Cn−1 and degree 2n−1, a piecewise interpolation polynomial H2n of degree 2n is given. The formulas for computing H2n by H2n−1 and computing H2n+1 by H2n are shown. Thus a simple recursive method for the construction of the piecewise interpolation polynomial set {Hj} is presented. The piecewise interpolation polynomial H2n satisfies the same interpolation conditions as the interpolant H2n−1, and is an optimal approximation of the interpolant H2n+1. Some interesting properties are also proved. 相似文献
14.
15.
Mehmet Özer Yasar Polatoglu Gürsel Hacibekiroglou Antonios Valaristos Amalia N. Miliou Antonios N. Anagnostopoulos Antanas Čenys 《Nonlinear Analysis: Theory, Methods & Applications》2008
The dynamic behaviour of the one-dimensional family of maps f(x)=c2[(a−1)x+c1]−λ/(α−1) is examined, for representative values of the control parameters a,c1, c2 and λ. The maps under consideration are of special interest, since they are solutions of the relaxed Newton method derivative being equal to a constant a. The maps 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 xn 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,c1 and c2. This corresponds to a switch to an oscillatory behaviour with amplitudes of f(x) undergoing a period doubling. For values of a 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 c1 between 1 and 1.20. This behaviour is confirmed by calculating the corresponding Lyapunov exponents. 相似文献
16.
We prove that if for a continuous map f on a compact metric space X, the chain recurrent set, R(f) has more than one chain component, then f does not satisfy the asymptotic average shadowing property. We also show that if a continuous map f on a compact metric space X has the asymptotic average shadowing property and if A is an attractor for f, then A is the single attractor for f and we have A=R(f). We also study diffeomorphisms with asymptotic average shadowing property and prove that if M is a compact manifold which is not finite with dimM=2, then the C1 interior of the set of all C1 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), 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 u (v) blows up alone if and only if m>p+1 (q>n+1), which means that any blow-up is simultaneous if and only if m≤p+1, q≤n+1. (ii) Any blow-up is u (v) blowing up with v (u) remaining bounded if and only if m>p+1, q≤n+1 (m≤p+1, q>n+1). (iii) Both non-simultaneous and simultaneous blow-up may occur if and only if m>p+1, q>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 f of a discrete-time Markov chain (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 g of (Xi,Xi+1) and so to provide an adaptive estimator of the transition density π=g/f. We give bounds in L2 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 N independent stochastic processes (Xj(t),t∈[0,T]), j=1,…,N, defined by a one-dimensional stochastic differential equation with coefficients depending on a random variable ?j and study the nonparametric estimation of the density of the random effect ?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 L2-risk. Asymptotic properties are evaluated as N tends to infinity for fixed T or for T=T(N) tending to infinity with N. For T(N)=N2, adaptive estimators are built. Estimators are implemented on simulated data for several examples. 相似文献