排序方式: 共有14条查询结果,搜索用时 31 毫秒
1.
In this paper a uniqueness theorem for a skewperiodic boundary value problem is obtained. By using the optimal control method, we derive the best estimate for the integration mean ensuring that the results hold. 相似文献
2.
3.
W匕eonsider the existenee of single and multiple positive periodie solutions for the generalperiodie Logistie equation ,‘(t)=夕(t)!a(t)一f(t,夕(t一几(t)),…,夕(t一几,(t)))],t‘R,(E)wheref:Rx皿+’‘什矿15 eontinuous,a(t)〔C(皿,R+),瑞(亡)〔C(R,R),anda(t)=a(t+T),几二(t)=爪(t+T),饥=1,…,,z,f(t,。1,。2,…,。,,)=f(亡+T,。,,。2,…,。。),T>O· It 15 well known that many matliematieal eeologieal Logistie equations are related to tl、eequation(E),e.g.,(1)the single speeies periodie populatio,i ,,… 相似文献
4.
In this paper we investigate the nearly small twist mappings with intersection property. With a certain non-degenerate condition, we proved that the most of invariant tori of the original small twist mappings will survive afer small perturtations. The persisted invariant tori are close to the unperturbed ones when the perturbation are small. The orbits reduced by those mappings are quasi-periodic in the invariant tori with the frequences closing to the original ones. 相似文献
5.
6.
7.
8.
In this paper, we establish a the LaSalle's theorem for stochastic differential equation based on Li's work, and give a more general Lyapunov function which it is more easy to apply. Our work has partly generalized Mao's work. 相似文献
9.
In this paper we propose an optimal method for solving the linear bilevel programming problem with no upper-level constraint. The main idea of this method is that the initial point which is in the feasible region goes forward along the optimal direction firstly. When the iterative point reaches the boundary of the feasible region, it can continue to go forward along the suboptimal direction. The iteration is terminated until the iterative point cannot go forward along the suboptimal direction and effective direction, and the new iterative point is the solution of the lower-level programming. An algorithm which bases on the main idea above is presented and the solution obtained via this algorithm is proved to be optimal solution to the bilevel programming problem. This optimal method is effective for solving the linear bilevel programming problem. 相似文献
10.
In 1 966,Schirmer[1 ] proved the following interesting Brouwer type coincidencetheorem for the n dimensional closed unit disc Dn. Theorem1 Suppose that the continuous mapping f:Dn→ Dn maps the boundary Sn- 1essentially onto itself.Then for any continuous mapping g:Dn→Dn,the equationf(x) =g(x)has a solution in Dn. This result is closely related to Brouwer' s celebrated fixed point theorem. Someimportant generalizations and applications of it can be found in [2— 4 ] . In this not… 相似文献