首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 234 毫秒
1.
Let {p m (w)} be the sequence of Jacobi polynomials corresponding to the weightw(x)=(1–x)(1+x), 0, <1. denote=">x k (w)=cos m,k (w),k=1,...,m, the zeros ofp m (w). If +=0, then the estimates
  相似文献   

2.
LetJ n (z) be the Bessel function of the first kind and ordern, and letf(z) be an analytic function in|z|r (r>0); then it is known that the Bessel expansion
  相似文献   

3.
LetV n ={1, 2, ...,n} ande 1,e 2, ...,e N ,N= be a random permutation ofV n (2). LetE t={e 1,e 2, ...,e t} andG t=(V n ,E t ). If is a monotone graph property then the hitting time() for is defined by=()=min {t:G t }. Suppose now thatG starts to deteriorate i.e. loses edges in order ofage, e 1,e 2, .... We introduce the idea of thesurvival time =() defined by t = max {u:(V n, {e u,e u+1, ...,e T }) }. We study in particular the case where isk-connectivity. We show that
  相似文献   

4.
The computation ofL 1 smoothing splines on large data sets is often desirable, but computationally infeasible. A locally weighted, LAD smoothing spline based smoother is suggested, and preliminary results will be discussed. Specifically, one can seek smoothing splines in the spacesW m (D), with [0, 1] n D. We assume data of the formy i =f(t i )+ i ,i=1,..., N with {t i } i=1 N D, the i are errors withE( i )=0, andf is assumed to be inW m . An LAD smoothing spline is the solution,s , of the following optimization problem
  相似文献   

5.
LetF(W) be a Wiener functional defined byF(W)=I n(f) whereI n(f) denotes the multiple Wiener-Ito integral of ordern of the symmetricL 2([0, 1] n ) kernelf. We show that a necessary and sufficient condition for the existence of a continuous extension ofF, i.e. the existence of a function ø(·) from the continuous functions on [0, 1] which are zero at zero to which is continuous in the supremum norms and for which ø(W)=F(W) a.s, is that there exists a multimeasure (dt 1,...,dt n ) on [0, 1] n such thatf(t 1, ...,t n ) = ((t 1, 1]), ..., (t n , 1]) a.e. Lebesgue on [0, 1] n . Recall that a multimeasure (A 1,...,A n ) is for every fixedi and every fixedA i,...,Ai-1, Ai+1,...,An a signed measure inA i and there exists multimeasures which are not measures. It is, furthermore, shown that iff(t 1,t 2, ...,t n ) = ((t 1, 1], ..., (t n , 1]) then all the tracesf (k), off exist, eachf(k) induces ann–2k multimeasure denoted by (k), the following relation holds
  相似文献   

6.
7.
ANOTEONTHEBEHAVIOROFBLOW┐UPSOLUTIONSFORONE┐PHASESTEFANPROBLEMSZHUNINGAbstract.Inthispaper,thefolowingone-phaseStefanproblemis...  相似文献   

8.
Let (,G, U) be a continuous representation of a Lie groupG by bounded operatorsg U (g) on the Banach space and let (, ,dU) denote the representation of the Lie algebra obtained by differentiation. Ifa 1, ...,a d is a Lie algebra basis of ,A i =dU (a i ) and whenever =(i 1, ...,i k ) we reconsider the operators
  相似文献   

9.
LetK p(u1, ..., up) be the completep-partite graph whoseith vertex class hasu i vertices (lip). We show that the theorem of Erds and Stone can be extended as follows. There is an absolute constant >0 such that, for allr1, 0<1 and=">1/r, every graphG=G n of sufficiently large order |G|=n with at least
  相似文献   

10.
The following regularity of weak solutions of a class of elliptic equations of the form are investigated.  相似文献   

11.
LetM n denote the space ofn×n matrices. GivenX, ZM n define
  相似文献   

12.
For any positive real numbers A, B, and d satisfying the conditions , d>2, we construct a Gabor orthonormal basis for L2(ℝ), such that the generating function g∈L2(ℝ) satisfies the condition:∫|g(x)|2(1+|x| A )/log d (2+|x|)dx < ∞ and .  相似文献   

13.
Explicit, compactly supported solutions, {vi, ϕ} i=1 m , to the deconvolution (or Bezout) equation
((0.1))
are computed where ϕ is a given function in C c (Rd), and , i=1, ..., m for some set of positive numbers {ri} i=1 m such that ri/rj is poorly approximated by rationals whenever i ≠ j. The novelty of the solution technique is that it uses new results in the theory of sampling of bandlimited functions detailed in [13] to provide simple Fourier series representations for the solutions, {vi, ϕ} i=1 m , which can be easily implemented numerically. Several examples illustrating the use of sampling for solutions to variants of (0.1) are given, as well as some numerical simulations. Acknowledgements and Notes. The author gratefully acknowledges the support of the National Science Foundation, DMS-9500909, and Prof. K.J.R. Liu at the Institute for Systems Research, University of Maryland, College Park, MD, 20742.  相似文献   

14.
We characterize the composition operators mapping Blochs boundedly into the weighted Bergman spaces of logarithmic weight. For 0 < p < ∞, 1 < α < ∞, let Ap, log α denote the space of holomorphic functions F in the unit disc D for which
and let Ap, log ασ denote the class of holomorphic self maps f of D for which
Then for the Bloch pullback operator Cf, the following are equivalent:
(1)  Cf maps Bloch space boundedly into A2p, log α
(2) 
(3)  .
This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD, Basic Research Promotion Fund) (KRF-2007-313-C00026).  相似文献   

15.
We prove that given a point outside a given latticeL then there is a dual vector which gives a fairly good estimate for how far from the lattice the vector is. To be more precise, there is a set of translated hyperplanesH i, such thatL iHi andd( iHi)(6n 2+1)–1 d( ,L).Supported by an IBM fellowship.  相似文献   

16.
Let Δ(x) denote the error term in the Dirichlet divisor problem, and E(T) the error term in the asymptotic formula for the mean square of . If with , then we obtain
. We also show how our method of proof yields the bound
, where T 1/5+εGT, T<t 1<...<t R ≤2T, t r +1t r ≥5G (r=1, ..., R−1).  相似文献   

17.
Abstract   Let Λ = {λ k } be an infinite increasing sequence of positive integers with λ k →∞. Let X = {X(t), t ∈? R N } be a multi-parameter fractional Brownian motion of index α(0 < α < 1) in R d . Subject to certain hypotheses, we prove that if N < αd, then there exist positive finite constants K 1 and K 2 such that, with unit probability,
if and only if there exists γ > 0 such that
where ϕ(s) = s N/α (log log 1/s) N/(2α), ϕ-p Λ(E) is the Packing-type measure of E,X([0, 1]) N is the image and GrX([0, 1] N ) = {(t,X(t)); ? [0, 1] N } is the graph of X, respectively. We also establish liminf type laws of the iterated logarithm for the sojourn measure of X. Supported by the National Natural Science Foundation of China (No.10471148), Sci-tech Innovation Item for Excellent Young and Middle-Aged University Teachers and Major Item of Educational Department of Hubei (No.2003A005)  相似文献   

18.
Analysis of FETI methods for multiscale PDEs   总被引:2,自引:0,他引:2  
In this paper, we study a variant of the finite element tearing and interconnecting (FETI) method which is suitable for elliptic PDEs with highly heterogeneous (multiscale) coefficients α(x); in particular, coefficients with strong variation within subdomains and/or jumps that are not aligned with the subdomain interfaces. Using energy minimisation and cut-off arguments we can show rigorously that for an arbitrary (positive) coefficient function the condition number of the preconditioned FETI system can be bounded by C(α) (1 + log(H/h))2 where H is the subdomain diameter and h is the mesh size, and where the function C(α) depends only on the coefficient variation in the vicinity of subdomain interfaces. In particular, if varies only mildly in a layer Ω i,η of width η near the boundary of each of the subdomains Ω i , then , independent of the variation of α in the remainder Ω i \Ω i,η of each subdomain and independent of any jumps of α across subdomain interfaces. The quadratic dependence of C(α) on H/η can be relaxed to a linear dependence under stronger assumptions on the behaviour of α in the interior of the subdomains. Our theoretical findings are confirmed in numerical tests. C. Pechstein was supported by the Austrian Science Funds (FWF) under grant F1306.  相似文献   

19.
Letn, s 1,s 2, ... ands n be positive integers. Assume is an integer for eachi}. For , , and , denotes p (a)={j|1jn,a j p}, , and . is called anI t p -intersecting family if, for any a,b ,a i b i =min(a i ,b i )p for at leastt i's. is called a greedyI t P -intersecting family if is anI t p -intersecting family andW p (A)W p (B+A c ) for anyAS p ( ) and any with |B|=t–1.In this paper, we obtain a sharp upper bound of | | for greedyI t p -intersecting families in for the case 2ps i (1in) ands 1>s 2>...>s n .This project is partially supported by the National Natural Science Foundation of China (No.19401008) and by Postdoctoral Science Foundation of China.  相似文献   

20.
In this paper, the existence of travelling front solution for a class of competition-diffusion system with high-order singular point
(I)
is studied, where d i,ai>0 (i=1,2) and w=(w 1(x,t),w 2(x,t)). Under the certain assumptions on f, it is showed that if a i<1 for some i, then (1) has no travelling front solution, if a i≥1 for i=1,2, then there is a c 0,c*>0, where c* is called the minimal wave speed of (I), such that if cc 0 or c=c*, then (I) has a travelling front solution, if c<c*, then (I) has no travelling front solution by using the shooting method in combination with a compactness argument. Project supported by both the National (49772161) and Henan Province (984050300) Natural Science Foundations of China.  相似文献   

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

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