首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We consider weak solutions to the nonlinear boundary value problem (r, (x, u(x)) u′(x))′ = (Fu)′(x) with r(0, u(0)) u′(0) = ku(0), r(L, u(L)) u′(L) = hu(L) and k, h are suitable elements of [0, ∞]. In addition to studying some new boundary conditions, we also relax the constraints on r(x, u) and (Fu)(x). r(x, u) > 0 may have a countable set of jump discontinuities in u and r(x, u)?1?Lq((0, L) × (0, p)). F is an operator from a suitable set of functions to a subset of Lp(0, L) which have nonnegative values. F includes, among others, examples of the form (Fu)(x) = (1 ? H(x ? x0)) u(x0), (Fu)(x) = ∫xLf(y, u(y)) dy where f(y, u) may have a countable set of jump discontinuities in u or F may be chosen so that (Fu)′(x) = ? g(x, u(x)) u′(x) ? q(x) u(x) ? f(x, u(x)) where q is a distributional derivative of an L2(0, L) function.  相似文献   

2.
Under fairly weak assumptions, the solutions of the system of Volterra equations x(t) = ∝0ta(t, s) x(s) ds + f(t), t > 0, can be written in the form x(t) = f(t) + ∝0tr(t, s) f(s) ds, t > 0, where r is the resolvent of a, i.e., the solution of the equation r(t, s) = a(t, s) + ∝0ta(t, v) r(v, s)dv, 0 < s < t. Conditions on a are given which imply that the resolvent operator f0tr(t, s) f(s) ds maps a weighted L1 space continuously into another weighted L1 space, and a weighted L space into another weighted L space. Our main theorem is used to study the asymptotic behavior of two differential delay equations.  相似文献   

3.
Let F1(x, y),…, F2h+1(x, y) be the representatives of equivalent classes of positive definite binary quadratic forms of discriminant ?q (q is a prime such that q ≡ 3 mod 4) with integer coefficients, then the number of integer solutions of Fi(x, y) = n (i = 1,…, 2h + 1) can be calculated for each natural number n using L-functions of imaginary quadratic field Q((?q)1/2).  相似文献   

4.
Suppose that Ω ? ∝ n is a compact domain with Lipschitz boundary ?Ω which is the closure of its interior Ω0. Consider functions ? i , τ i : Ω→ ∝ belonging to the space L q (Ω) for q ∈ (1, +∞] and a locally Holder mapping F: Ω × ∝ → ∝ such that F(·, 0) ≡ 0 on Ω. Consider two quasilinear inhomogeneous Dirichlet problems $$\left\{ {_{u = \tau _i \quad \quad \quad \quad \quad \quad \quad \;\;\,\operatorname{on} \;\partial \Omega ,}^{\Delta u_i = F(x,\;u_i ) + \varphi _i (x)\quad \operatorname{on} \;\Omega _0 ,} } \right.\quad \quad i = 1,\;2.$$ In this paper, we study the following problem: Under certain conditions on the function F generally not ensuring either the uniqueness or the existence of solutions in these problems, estimate the deviation of the solutions u i (assuming that they exist) from each other in the uniform metric, using additional information about the solutions u i . Here we assume that the solutions are continuous, although their continuity is a consequence of the constraints imposed on F, τi, ?i. For the additional information on the solutions u i , i = 1, 2 we take their values on the grid; in particular, we show that if their values are identical on some finite grid, then these functions coincide on Ω.  相似文献   

5.
Let i1i2i3≥1 be integers. An L(i1,i2,i3)-labelling of a graph G=(V,E) is a mapping ?:V→{0,1,2,…} such that |?(u)−?(v)|≥it for any u,vV with d(u,v)=t, t=1,2,3, where d(u,v) is the distance in G between u and v. The integer ?(v) is called the label assigned to v under ?, and the difference between the largest and the smallest labels is called the span of ?. The problem of finding the minimum span, λi1,i2,i3(G), over all L(i1,i2,i3)-labellings of G arose from channel assignment in cellular communication systems, and the related problem of finding the minimum number of labels used in an L(i1,i2,i3)-labelling was originated from recent studies on the scalability of optical networks. In this paper we study the L(i1,i2,i3)-labelling problem for hypercubes Qd (d≥3) and obtain upper and lower bounds on λi1,i2,i3(Qd) for any (i1,i2,i3).  相似文献   

6.
A natural class of appropriate viscosity matrices for strictly hyperbolic systems of conservation laws in one space dimension, u1 + f(u)x = 0, u?Rm, is studied. These matrices are admissible in the sense that small-amplitude shock wave solutions of the hyperbolic system are shown to be limits of smooth traveling wave solutions of the parabolic system ut + f(u)x = v(Dux)x as ifv → 0 if D is in this class. The class is determined by a linearized stability requirement: The Cauchy problem for the equation u1 + f′(u0) ux = vDuxx should be well posed in L2 uniformly in v as v → 0. Previous examples of inadmissible viscosity matrices are accounted for through violation of the stability criterion.  相似文献   

7.
We are concerned with Friedrichs's scheme for an initial value problem ut(t, x) = A(t, x)ux(t, x), u(0, x) = u0(x), where u0(x) belongs to L, not to L2. We show that Friedrichs's scheme is stable in the maximum norm ·L, provided that the system is regularly hyperbolic and that the eigenvalues di(t, x) (i = 1,2,..., N) of the N XN matrix A(t, x) satisfy the conditions 1±λdi(t, x)?0 (i = 1,2,..., N), where λ is a mesh ratio.  相似文献   

8.
A function f:V(G)→{0,1,2} is a Roman dominating function if every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=2. A function f:V(G)→{0,1,2} with the ordered partition (V0,V1,V2) of V(G), where Vi={vV(G)∣f(v)=i} for i=0,1,2, is a unique response Roman function if xV0 implies |N(x)∩V2|≤1 and xV1V2 implies that |N(x)∩V2|=0. A function f:V(G)→{0,1,2} is a unique response Roman dominating function if it is a unique response Roman function and a Roman dominating function. The unique response Roman domination number of G, denoted by uR(G), is the minimum weight of a unique response Roman dominating function. In this paper we study the unique response Roman domination number of graphs and present bounds for this parameter.  相似文献   

9.
Let P(x) = Σi=0naixi be a nonnegative integral polynomial. The polynomial P(x) is m-graphical, and a multi-graph G a realization of P(x), provided there exists a multi-graph G containing exactly P(1) points where ai of these points have degree i for 0≤in. For multigraphs G, H having polynomials P(x), Q(x) and number-theoretic partitions (degree sequences) π, ?, the usual product P(x)Q(x) is shown to be the polynomial of the Cartesian product G × H, thus inducing a natural product π? which extends that of juxtaposing integral multiple copies of ?. Skeletal results are given on synthesizing a multi-graph G via a natural Cartesian product G1 × … × Gk having the same polynomial (partition) as G. Other results include an elementary sufficient condition for arbitrary nonnegative integral polynomials to be graphical.  相似文献   

10.
For the system of root functions of an operator defined by the differential operation ?u″ + p(x)u′ + q(x)u, xG = (0, 1), with complex-valued singular coefficients, sufficient conditions for the Bessel property in the space L2(G) are obtained and a theorem on the unconditional basis property is proved. It is assumed that the functions p(x) and q(x) locally belong to the spaces L2 and W2?1, respectively, and may have singularities at the endpoints of G such that q(x) = qR(x) +qS(x) and the functions qS(x), p(x), q 2 S (x)w(x), p2(x)w(x), and qR(x)w(x) are integrable on the whole interval G, where w(x) = x(1 ? x).  相似文献   

11.
Given a graph G and integers p,q,d1 and d2, with p>q, d2>d1?1, an L(d1,d2;p,q)-labeling of G is a function f:V(G)→{0,1,2,…,n} such that |f(u)−f(v)|?p if dG(u,v)?d1 and |f(u)−f(v)|?q if dG(u,v)?d2. A k-L(d1,d2;p,q)-labeling is an L(d1,d2;p,q)-labeling f such that maxvV(G)f(v)?k. The L(d1,d2;p,q)-labeling number ofG, denoted by , is the smallest number k such that G has a k-L(d1,d2;p,q)-labeling. In this paper, we give upper bounds and lower bounds of the L(d1,d2;p,q)-labeling number for general graphs and some special graphs. We also discuss the L(d1,d2;p,q)-labeling number of G, when G is a path, a power of a path, or Cartesian product of two paths.  相似文献   

12.
To analyze the attainable order of m-stage implicit (collocation-based) Runge-Kutta methods for the delay differential equation (DDE) y′(t) = by(qt), 0 < q ≤ 1 with y(0) = 1, and the delay Volterra integral equation (DVIE) y(t) = 1 + $\tfrac{b}{q}\int {_0^{qt} }$ y(s) ds with proportional delay qt, 0 < q ≤ 1, our particular interest lies in the approximations (and their orders) at the first mesh point t = h for the collocation solution v(t) of the DDE and the iterated collocation solution u it(t) of the DVIE to the solution y(t). Recently, H. Brunner proposed the following open problem: “For m ≤ 3, do there exist collocation points c i = c i(q), i = 1, 2,..., m in [0,1] such that the rational approximant v(h)is the (m, m)-Padé approximant to y(h)? If these exist, then |v(h) ? y(h)| = O(h 2m+1) but what is the collocation polynomial M m(t; q) = K Π i=1 m (t ? c i) of v(th), t ∈ [0, 1]?” In this paper, we solve this question affirmatively, and give the related results between the collocation solution v(t) of the DDE and the iterated collocation solution u it(t) of the DVIE. We also answer to Brunner's second open question in the case that one collocation point is fixed at the right end point of the interval.  相似文献   

13.
Let c be a proper k-coloring of a connected graph G and Π=(C1,C2,…,Ck) be an ordered partition of V(G) into the resulting color classes. For a vertex v of G, the color code of v with respect to Π is defined to be the ordered k-tuple cΠ(v):=(d(v,C1),d(v,C2),…,d(v,Ck)), where d(v,Ci)=min{d(v,x)|xCi},1≤ik. If distinct vertices have distinct color codes, then c is called a locating coloring. The minimum number of colors needed in a locating coloring of G is the locating chromatic number of G, denoted by χL(G). In this paper, we study the locating chromatic number of Kneser graphs. First, among some other results, we show that χL(KG(n,2))=n−1 for all n≥5. Then, we prove that χL(KG(n,k))≤n−1, when nk2. Moreover, we present some bounds for the locating chromatic number of odd graphs.  相似文献   

14.
We consider the Sturm-Liouville operator L(y) = ?d 2 y/dx 2 + q(x)y in the space L 2[0, π], where the potential q(x) is a complex-valued distribution of the first order of singularity; i.e., q(x) = u′(x), uL 2[0, π]. (Here the derivative is understood in the sense of distributions.) We obtain asymptotic formulas for the eigenvalues and eigenfunctions of the operator in the case of the Neumann-Dirichlet conditions [y [1](0) = 0, y(π) = 0] and Neumann conditions [y [1](0) = 0, y [1](π) = 0] and refine similar formulas for all types of boundary conditions. The leading and second terms of asymptotics are found in closed form.  相似文献   

15.
In this paper, we study integral operators of the form Tαf(x)=∫Rn|x-A1y|-α1 ··· |x-Amy|-αmf(y)dy,where Ai are certain invertible matrices, αi 0, 1 ≤ i ≤ m, α1 + ··· + αm = n-α, 0 ≤α n. For 1/q = 1/p-α/n , we obtain the Lp (Rn, wp)-Lq(Rn, wq) boundedness for weights w in A(p, q) satisfying that there exists c 0 such that w(Aix) ≤ cw(x), a.e. x ∈ Rn , 1 ≤ i ≤ m.Moreover, we obtain theappropriate weighted BMO and weak type estimates for certain weights satisfying the above inequality. We also give a Coifman type estimate for these operators.  相似文献   

16.
This paper is devoted to a study of L~q-tracing of the fractional temperature field u(t, x)—the weak solution of the fractional heat equation(?_t +(-?_x)~α)u(t, x) = g(t, x) in L~p(R_+~(1+n)) subject to the initial temperature u(0, x) = f(x) in L~p(R~n).  相似文献   

17.
We consider a class of continuous non-linear systems defined by the ordinary differential equation x = f(x, t) + g(x, t)u, where u is an unknown input representing noise or disturbances. The object is to estimate states and parameters in these systems by means of a fixed number of discrete observations yi = h(x(ti), ti) + vi, 1 ? i ? m, where the vi represents unknown errors in the measurements yi. No statistical assumptions are made concerning the nature of the unknown input u or the unknown measurement errors vi. A weighted least squares criterion is defined as a measure of the optimal estimate. A result concerning the existence of solutions of the differential equation which minimize the criterion is presented. The necessary conditions for an optimal estimate, a set of Euler-Lagrange equations and multi-point discontinuous non-linear boundary conditions, are given. The multi-point problem is converted to an equivalent continuous two-point boundary value problem of larger dimension in the case in which the observations are assumed to be linear functions of the state. A pair of equivalent quasilinearization algorithms is defined for the two-point system and the multi-point system. Quadratic convergence for these algorithms is proved.  相似文献   

18.
In this paper, we consider the so-called p-system with linear damping on quadrant. We show that for a certain class of given large initial data (v0(x),u0(x)), the corresponding initial-boundary value problem admits a unique global smooth solution (v(x,t),u(x,t)) and such a solution tends time-asymptotically, at the Lp (2?p?∞) optimal decay rates, to the corresponding nonlinear diffusion wave which satisfies (1.9) provided the corresponding prescribed initial error function (V0(x),U0(x)) lies in (H3(R+)∩L1(R+))×(H2(R+)∩L1(R+)).  相似文献   

19.
We prove two-weight, weak type norm inequalities for potential operators and fractional integrals defined on spaces of homogeneous type. We show that the operators in question are bounded from Lp(v) to Lq,∞(u), 1<p?q<∞, provided the pair of weights (u,v) verifies a Muckenhoupt condition with a “power-bump” on the weight u.  相似文献   

20.
We examine the problem ϵ(p(x)u′) + (q(x)u)′ − r(x)u = f(x) for 0 < x < 1, p>0, q>0, r ⩾ 0; p, q, r and f in C2[0, 1], ϵ in (0, 1], u(0) and u(1) given. Existence of a unique solution u and bounds on u and its derivatives are obtained. Using finite elements on an equidistant mesh of width h we generate a tridiagonal difference scheme which is shown to be uniformly second order accurate for this problem (i.e., the nodal errors are bounded by Ch2, where C is independent of h and ϵ). With a natural choice of trial functions, uniform first order accuracy is obtained in the L(0, 1) norm. Using trial functions which interpolate linearly between the nodal values generated by the difference scheme gives uniform first order accuracy in the L1(0, 1) norm.  相似文献   

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

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