首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 312 毫秒
1.
2.
Consider in a real Hilbert space H the Cauchy problem (P0P0): u(t)+Au(t)+Bu(t)=f(t)u(t)+Au(t)+Bu(t)=f(t), 0≤t≤T0tT; u(0)=u0u(0)=u0, where −A   is the infinitesimal generator of a C0C0-semigroup of contractions, B is a nonlinear monotone operator, and f is a given H-valued function. Inspired by the excellent book on singular perturbations by J.L. Lions, we associate with problem (P0P0) the following regularization (PεPε): −εu(t)+u(t)+Au(t)+Bu(t)=f(t)εu(t)+u(t)+Au(t)+Bu(t)=f(t), 0≤t≤T0tT; u(0)=u0u(0)=u0, u(T)=uTu(T)=uT, where ε>0ε>0 is a small parameter. We investigate existence, uniqueness and higher regularity for problem (PεPε). Then we establish asymptotic expansions of order zero, and of order one, for the solution of (PεPε). Problem (PεPε) turns out to be regularly perturbed of order zero, and singularly perturbed of order one, with respect to the norm of C([0,T];H)C([0,T];H). However, the boundary layer of order one is not visible through the norm of L2(0,T;H)L2(0,T;H).  相似文献   

3.
4.
Let S be an n-by-n   cyclic weighted shift matrix, and FS(t,x,y)=det(tI+xℜ(S)+yℑ(S))FS(t,x,y)=det(tI+x(S)+y(S)) be a ternary form associated with S  . We investigate the number of singular points of the curve FS(t,x,y)=0FS(t,x,y)=0, and show that the number of singular points of FS(t,x,y)=0FS(t,x,y)=0 associated with a cyclic weighted shift matrix whose weights are neither 1-periodic nor 2-periodic is less than or equal to n(n−3)/2n(n3)/2. Furthermore, we verify the upper bound n(n−3)/2n(n3)/2 is sharp for 4?n?74?n?7.  相似文献   

5.
Bárat and the present author conjectured that, for each tree T  , there exists a natural number kTkT such that the following holds: If G   is a kTkT-edge-connected graph such that |E(T)||E(T)| divides |E(G)||E(G)|, then G has a T-decomposition, that is, a decomposition of the edge set into trees each of which is isomorphic to T  . The conjecture has been verified for infinitely many paths and for each star. In this paper we verify the conjecture for an infinite family of trees that are neither paths nor stars, namely all the bistars S(k,k+1)S(k,k+1).  相似文献   

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

7.
Given n   independent standard normal random variables, it is well known that their maxima MnMn can be normalized such that their distribution converges to the Gumbel law. In a remarkable study, Hall proved that the Kolmogorov distance dndn between the normalized MnMn and its associated limit distribution is less than 3/log?n3/log?n. In the present study, we propose a different set of norming constants that allow this upper bound to be decreased with dn≤C(m)/log?ndnC(m)/log?n for n≥m≥5nm5. Furthermore, the function C(m)C(m) is computed explicitly, which satisfies C(m)≤1C(m)1 and limm?C(m)=1/3limm?C(m)=1/3. As a consequence, some new and effective norming constants are provided using the asymptotic expansion of a Lambert W type function.  相似文献   

8.
9.
Let K   be an algebraically closed field of characteristic 0 and let Mn(K)Mn(K), n?3n?3, be the matrix ring over K  . We will show that the image of any multilinear polynomial in four variables evaluated on Mn(K)Mn(K) contains all matrices of trace 0.  相似文献   

10.
For almost all x>1x>1, (xn)(xn)(n=1,2,…)(n=1,2,) is equidistributed modulo 1, a classical result. What can be said on the exceptional set? It has Hausdorff dimension one. Much more: given an (bn)(bn) in [0,1[[0,1[ and ε>0ε>0, the x  -set such that |xn−bn|<ε|xnbn|<ε modulo 1 for n   large enough has dimension 1. However, its intersection with an interval [1,X][1,X] has a dimension <1, depending on ε and X. Some results are given and a question is proposed.  相似文献   

11.
A graph G   with no isolated vertex is total domination vertex critical if for any vertex vv of G   that is not adjacent to a vertex of degree one, the total domination number of G-vG-v is less than the total domination number of G  . We call these graphs γtγt-critical. If such a graph G has total domination number k, we call it k  -γtγt-critical. We verify an open problem of k  -γtγt-critical graphs and obtain some results on the characterization of total domination critical graphs of order n=Δ(G)(γt(G)-1)+1n=Δ(G)(γt(G)-1)+1.  相似文献   

12.
It is well-known that an RnRn-valued random vector (X1,X2,?,Xn)(X1,X2,?,Xn) is comonotonic if and only if (X1,X2,?,Xn)(X1,X2,?,Xn) and (Q1(U),Q2(U),?,Qn(U))(Q1(U),Q2(U),?,Qn(U)) coincide in distribution, for any random variable U   uniformly distributed on the unit interval (0,1)(0,1), where Qk(⋅)Qk() are the quantile functions of XkXk, k=1,2,?,nk=1,2,?,n. It is natural to ask whether (X1,X2,?,Xn)(X1,X2,?,Xn) and (Q1(U),Q2(U),?,Qn(U))(Q1(U),Q2(U),?,Qn(U)) can coincide almost surely for some special U. In this paper, we give a positive answer to this question by construction. We then apply this result to a general behavioral investment model with a law-invariant preference measure and develop a universal framework to link the problem to its quantile formulation. We show that any optimal investment output should be anti-comonotonic with the market pricing kernel. Unlike previous studies, our approach avoids making the assumption that the pricing kernel is atomless, and consequently, we overcome one of the major difficulties encountered when one considers behavioral economic equilibrium models in which the pricing kernel is a yet-to-be-determined unknown random variable. The method is applicable to general models such as risk sharing model.  相似文献   

13.
14.
15.
16.
17.
Assume that the problem P0P0 is not solvable in polynomial time. Let T   be a first-order theory containing a sufficiently rich part of true arithmetic. We characterize T∪{ConT}T{ConT} as the minimal extension of T   proving for some algorithm that it decides P0P0 as fast as any algorithm BB with the property that T   proves that BB decides P0P0. Here, ConTConT claims the consistency of T. As a byproduct, we obtain a version of Gödel?s Second Incompleteness Theorem. Moreover, we characterize problems with an optimal algorithm in terms of arithmetical theories.  相似文献   

18.
We construct an explicit representation of viscosity solutions of the Cauchy problem for the Hamilton–Jacobi equation (H,σ)(H,σ) on a given domain Ω=(0,T)×RnΩ=(0,T)×Rn. It is known that, if the Hamiltonian H=H(t,p)H=H(t,p) is not a convex (or concave) function in p  , or H(⋅,p)H(,p) may change its sign on (0,T)(0,T), then the Hopf-type formula does not define a viscosity solution on Ω  . Under some assumptions for H(t,p)H(t,p) on the subdomains (ti,ti+1)×Rn⊂Ω(ti,ti+1)×RnΩ, we are able to arrange “partial solutions” given by the Hopf-type formula to get a viscosity solution on Ω. Then we study the semiconvexity of the solution as well as its relations to characteristics.  相似文献   

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

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