首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
In this paper, we study the initial boundary value problem for a class of parabolic or pseudo-parabolic equations:
ut?aΔut?Δu+bu=k(t)|u|p?2u,(x,t)Ω×(0,T),
where a0, b>??1 with ?1 being the principal eigenvalue for ?Δ on H01(Ω) and k(t)>0. By using the potential well method, Levine’s concavity method and some differential inequality techniques, we obtain the finite time blow-up results provided that the initial energy satisfies three conditions: (i) J(u0;0)<0; (ii) J(u0;0)d(), where d() is a nonnegative constant; (iii) 0<J(u0;0)Cρ(0), where ρ(0) involves the L2-norm or H01-norm of the initial data. We also establish the lower and upper bounds for the blow-up time. In particular, we obtain the existence of certain solutions blowing up in finite time with initial data at the Nehari manifold or at arbitrary energy level.  相似文献   

2.
This paper aims at providing an alternative approach to study global dynamic properties for a two-species chemotaxis model, with the main novelty being that both populations mutually compete with the other on account of the Lotka–Volterra dynamics. More precisely, we consider the following Neumann initial–boundary value problem
ut=d1Δu?χ1??(u?w)+μ1u(1?u?a1v),xΩ,t>0,vt=d2Δv?χ2??(v?w)+μ2v(1?a2u?v),xΩ,t>0,0=d3Δw?w+u+v,xΩ,t>0,
in a bounded domain Ω?Rn,n1, with smooth boundary, where d1,d2,d3,χ1,χ2,μ1,μ2,a1,a2 are positive constants.When a1(0,1) and a2(0,1), it is shown that under some explicit largeness assumptions on the logistic growth coefficients μ1 and μ2, the corresponding Neumann initial–boundary value problem possesses a unique global bounded solution which moreover approaches a unique positive homogeneous steady state (u1,v1,w1) of above system in the large time limit. The respective decay rate of this convergence is shown to be exponential.When a11 and a2(0,1), if μ2 is suitable large, for all sufficiently regular nonnegative initial data u0 and v0 with u0?0 and v0?0, the globally bounded solution of above system will stabilize toward (0,1,1) as t in algebraic.  相似文献   

3.
The number of states in a deterministic finite automaton (DFA) recognizing the language Lk, where L is regular language recognized by an n-state DFA, and k?2 is a constant, is shown to be at most n2(k?1)n and at least (n?k)2(k?1)(n?k) in the worst case, for every n>k and for every alphabet of at least six letters. Thus, the state complexity of Lk is Θ(n2(k?1)n). In the case k=3 the corresponding state complexity function for L3 is determined as 6n?384n?(n?1)2n?n with the lower bound witnessed by automata over a four-letter alphabet. The nondeterministic state complexity of Lk is demonstrated to be nk. This bound is shown to be tight over a two-letter alphabet.  相似文献   

4.
5.
6.
Let A+BXC and A+BX+YC be two linear matrix expressions, and denote by {A+BXC} and {A+BX+YC} the collections of the two matrix expressions when X and Y run over the corresponding matrix spaces. In this paper, we study relationships between the two matrix sets {A1+B1X1C1} and {A2+B2X2C2}, as well as the two sets {A1+B1X1+Y1C1} and {A2+B2X2+Y2C2}, by using some rank formulas for matrices. In particular, we give necessary and sufficient conditions for the two matrix set inclusions {A1+B1X1C1}?{A2+B2X2C2} and {A1+B1X1+Y1C1}?{A2+B2X2+Y2C2} to hold. We also use the results obtained to characterize relations of solutions of some linear matrix equations.  相似文献   

7.
8.
9.
10.
In this paper, we study the nonlocal nonlinear evolution equation
CD0|tαu(t,x)?(J1|u|?|u|)(t,x)+CD0|tβu(t,x)=|u(t,x)|p,t>0,xRd,
where 1<α<2, 0<β<1, p>1, J:RdR+, 1 is the convolution product in Rd, and CD0|tq, q{α,β}, is the Caputo left-sided fractional derivative of order q with respect to the time t. We prove that the problem admits no global weak solution other than the trivial one with suitable initial data when 1<p<1+2βdβ+2(1?β). Next, we deal with the system
CD0|tαu(t,x)?(J1|u|?|u|)(t,x)+CD0|tβu(t,x)=|v(t,x)|p,t>0,xRd,CD0|tαv(t,x)?(J1|v|?|v|)(t,x)+CD0|tβv(t,x)=|u(t,x)|q,t>0,xRd,
where 1<α<2, 0<β<1, p>1, and q>1. We prove that the system admitsnon global weak solution other than the trivial one with suitable initial data when 1<pq<1+2βdβ+2(1?β)max{p+1,q+1}. Our approach is based on the test function method.  相似文献   

11.
We prove for three-dimensional domains the existence of local strong solutions to systems of nonlinear partial differential equations with p()-structure, pp()p0, and Dirichlet boundary conditions for p>95 without restriction on the upper bound p0. In particular this result is applicable to the motion of electrorheological fluids.  相似文献   

12.
13.
14.
15.
16.
In this paper, we investigate the star graph Sn with faulty vertices and/or edges from the graph theoretic point of view. We show that between every pair of vertices with different colors in a bicoloring of Sn, n4, there is a fault-free path of length at least n!-2fv-1, and there is a path of length at least n!-2fv-2 joining a pair of vertices with the same color, when the number of faulty elements is n-3 or less. Here, fv is the number of faulty vertices. Sn, n4, with at most n-2 faulty elements has a fault-free cycle of length at least n!-2fv unless the number of faulty elements are n-2 and all the faulty elements are edges incident to a common vertex. It is also shown that Sn, n4, is strongly hamiltonian-laceable if the number of faulty elements is n-3 or less and the number of faulty vertices is one or less.  相似文献   

17.
18.
A well-known lemma of Suslin says that for a commutative ring A if (v1(X),,vn(X))(A[X])n is unimodular where v1 is monic and n3, then there exist γ1,,γEn1(A[X]) such that the ideal generated by Res(v1,e1.γ1t(v2,,vn)),,Res(v1,e1.γt(v2,,vn)) equals A. This lemma played a central role in the resolution of Serre’s Conjecture. In the case where A contains a set E of cardinality greater than degv1+1 such that yy is invertible for each yy in E, we prove that the γi can simply correspond to the elementary operations L1L1+yij=2n1uj+1Lj, 1i=degv1+1, where u1v1++unvn=1. These efficient elementary operations enable us to give new and simple algorithms for reducing unimodular rows with entries in K[X1,,Xk] to t(1,0,,0) using elementary operations in the case where K is an infinite field. Another feature of this paper is that it shows that the concrete local–global principles can produce competitive complexity bounds.  相似文献   

19.
20.
We consider the existence of ground state solutions for the Kirchhoff type problem
?(a+bRN|?u|2dx)u+V(x)u=|u|p?2u,xRN,uH1(RN),
where a,b>0, N=1,2,3 and 2<p<21. Here we are interested in the case that 2<p4 since the existence of ground state for 4<p21 is easily obtained by a standard variational argument. Our method is based on a Pohoz?aev type identity.  相似文献   

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

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