OPTIMAL BIRKHOFF INTERPOLATION AND BIRKHOFF NUMBERS IN SOME FUNCTION SPACES

This paper investigates the optimal Birkhoff interpolation and Birkhoff numbers of some function spaces in space L_∞[-1,1] and weighted spaces L_p,ω[-1,1],1≤p<∞,with w being a continuous integrable weight function in(-1,1).We proved that the Lagrange interpolation algorithms based on the zeros of some polynomials are optimal.We also show that the Lagrange interpolation algorithms based on the zeros of some polynomials are optimal when the function values of the two endpoin...     

关于有限域中原根分布的注记

Let f₁(x) , …,f_r(x) denote quadratfree polynomials over GF(q) that are relatively prime in pairs and of degree≥1. We have proved that if q≥(k-1)²(2^rω(q-1)-1)², then all the f_i(ξ) are primitive roots of GF(q) for some ξ∈GF(q), where k =degf₁+…+degf_r . With extending the results obtained by Wang Juping, Sun Qi and Han Wenbao respectively, we have also given a quantitative analysis of Carlitz's result.     

ON LAGRANGE INTERPOLATION FOR |X|~α (0 < α < 1)

We study the optimal order of approximation for |x|α (0 < α < 1) by Lagrange interpolation polynomials based on Chebyshev nodes of the first kind. It is proved that the Jackson order of approximation is attained.     

一个无限可微函数类的最优埃尔米特插值CSCD

This paper investigates the optimal Hermite interpolation of a class F_(∞) of infinitely differentiable functions on[-1,1]in L_(∞)[-1,1]and weighted spaces L_(p,w)[-1,1],1≤p∞[-1,1]and L_(p,w)[-1,1],1≤p<∞ with w a continuous integrable weight function in(-1,1).We proved that the Lagrange interpolation polynomials based on the ze-ros of polynomials with the leading cofficient 1 of the least deviation from zero in L_(∞)[-1,1]and L_(p,w)[-1,1],1≤p<∞are optimal for 1≤p≤∞.We also give the optimal Hermite interpolation nodes when we ask the endpoints to be included in the nodes.     

非周期函数类WrHω的宽度估计

In this paper, we obtain the strong assymptotic values of n-width d_n(W^rH^ω, C)and d_n(W^rH^ω, L) for non-periodic function class W^rH^ω, wheve ω is a concave modulus of continuity.     

ON LAGRANGE INTERPOLATION FOR |X|~α (0 &lt; α &lt; 1)

We study the optimal order of approximation for |x|α (0 &lt; α &lt; 1) by Lagrange interpolation polynomials based on Chebyshev nodes of the first kind. It is proved that the Jackson order of approximation is attained.     

Heisenberg群上一类左不变LPDO的局部基本解及局部可解性

In this paper it is proved that local fundamental solution exists in some space W^m(H_n) (m∈Z), if the left invariant differential operator on the Heisenberg group H_n satisfies certain condition. The main results are:l.Let L be a left invariant differential operator on H_n. If there exist R≥0, r,s∈R and operators {B_λ|λ∈Γ_R} ∈V^s(Γ_R, M^r) such that, for almost all λ∈Γ_R, B_λ is the right inverse of Ⅱ_λ(L), then there exists E∈W^m(H_n) (when m≥0 or m even) or E∈W^m-1(H_n) (when m<0 and odd) such that LE =δ(near the origie) Where m=min([r],-[2s]-n-2); 2. Let L(W,T) be of the form (3.1). If there exist R≥0 and r,s∈R such that when |λ|≥R,(?) and C_λ≥ C|λ|^x(C>0), then the same conclusion as above holds with m=min(-[2r]-n-2,[-2s]-n-2).     

THE DIVERGENCE OF LAGRANGE INTERPOLATION IN EQUIDISTANT NODES

It is a classical result of Bernstein that the sequence of Lagrange interpolation polynomials to [x] at equally spaced nodes in [- 1,1 ] diverges everywhere, except at zero and the end-points. In this paper we show that the sequence of Lagrange interpolation polynomials corresponding to the functions which possess better smoothness on equidistant nodes in [- 1,1 ] still diverges every where in the interval except at zero and the end-points.     

Lagrange插值逼近导数的平均收敛

<正>We consider the rate of mean convergence of derivatives by Lagrange interpolation operators L_n(f,x) based on the zeros of Chebyshev polynomials of the first kind.A sharp estimate of the derivative of L_n(f,x)—f(x) in terms of the error of best approximation by polynomials of degree n is derived.     

关于M/G/l随机服务系统中L.Takacs引理的证明

L. Takacs' Lemma (ef [1] PP47-48) is a very important tool for the investigation of the transient behavior of the M/G/1 System. But the original proof contains a gap when γ(s, w) is expanded into Lagrange series by means of Lagrange theorem as given in the appendix of [1]. This is due to the fact that φ(s)=∫₀^∞e^-sxdH(x), the Laplace transform of the service time distribution , may not be analytic at s=0. An example of such a distrbution function H(x) is gives and a specific Lagrange theorem is proved By using this specific theorem, the gap in the original proof of Takacs′ Lemms is eliminated.     

Some results for the queues Mx/M/c and GIx/ G/c

We develop for the queue M^x/M/c an upper bound for the mean queue length and lower bounds for the delay probabilities (that of an arrival group and that of an arbitrary customer in the arrival group). An approximate formula is also developed for the general bulk-arrival queue GI^x/G/c. Preliminary numerical studies have indicated excellent performance of the results.     

关于环Fpm+uFpm+u2Fpm上循环码的注记

本文研究了环F_p^m+uF_p^m+u²F_p^m上长度为p^s的循环码分类.通过建立环F_p^m+uF_p^m+u²F_p^m到环F_p^m+uF_p^m的同态,给出了环F_p^m+uF_p^m+u²F_p^m上长度为p^s的循环码的新分类方法.应用这种方法,得到了环F_p^m+uF_p^m+u²F_p^m长度为p^s的循环码的码词数.     

Une question sur les équations xm ? ym = Rzn (A Question on the Equations xm ? ym = Rzn)

Let m and n be integers at least two and R be a nonzero natural number. In this paper, we study the problem of the determination of the proper solutions of the Diophantine equation x ^m – y ^m equals; Rz ⁿ . We raise a question concerning the existence of any proper nontrivial solution of this equation, in case some precise conditions are satisfied by the triple (m, n, R). We prove some results about it.     

Large-time asymptotics for the Gt/Mt/st+GIt many-server fluid queue with abandonment

We previously introduced and analyzed the G _t /M _t /s _t +GI _t many-server fluid queue with time-varying parameters, intended as an approximation for the corresponding stochastic queueing model when there are many servers and the system experiences periods of overload. In this paper, we establish an asymptotic loss of memory (ALOM) property for that fluid model, i.e., we show that there is asymptotic independence from the initial conditions as time t evolves, under regularity conditions. We show that the difference in the performance functions dissipates over time exponentially fast, again under the regularity conditions. We apply ALOM to show that the stationary G/M/s+GI fluid queue converges to steady state and the periodic G _t /M _t /s _t +GI _t fluid queue converges to a periodic steady state as time evolves, for all finite initial conditions.     

M/G/1/MLPS compared to M/G/1/PS

Multilevel processor sharing scheduling disciplines have recently been resurrected in papers that focus on the differentiation between short and long TCP flows in the Internet. We prove that, for M/G/1 queues, such disciplines are better than the processor sharing discipline with respect to the mean delay whenever the hazard rate of the service time distribution is decreasing.     

Solving Ck/Cm/1/N queues by using characteristic roots in matrix analytic methods

In this paper, we study a C_k/C_m/1/N open queueing system with finite capacity. We investigate the property which shows that a product of the Laplace Stieltjes Transforms of interarrival and service times distributions satisfies an equation of a simple form. According to this equation, we present that the stationary probabilities on the unboundary states can be written as a linear combination of vector product-forms. Each component of these products is expressed in terms of roots of an associated characteristic polynomial. As a result, we carry out an algorithm for solving stationary probabilities in C_k/C_m/1/N systems, which is independent of N, hence greatly reducing the computational complexity.     

The least squares problem of the matrix equation A1X1B1^T ＋ A2X2B2^T = T

The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2B2^T - T｜｜F can also be regarded as the constrained LS problem minx=diag（x1,x2） ｜｜AXB^T -T｜｜F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ｜｜A1X1B1^T＋A2X2B2^T -T｜｜F is equivalent to min x=diag（x1 ,x2） ｜｜AXB^T - T｜｜F whose solutions are included in the solution set of unconstrained problem minx ｜｜AXB^T - T｜｜F. So the general solutions of min x1,x2 ｜｜A1X1B^T ＋ A2X2B2^T -T｜｜F are reconstructed by selecting the parameter matrix in that of minx ｜｜AXB^T - T｜｜F.     

On the asymptotic behavior of xn+1=anxn/xn−1

We investigate the asymptotic behavior of solutions of a separable difference equation of the form

     

Some remarks on the Schr?dinger equation with a potential in LrtLsx

We study the dispersive properties of the linear Schr?dinger equation with a time-dependent potential V(t,x). We show that an appropriate integrability condition in space and time on V, i.e. the boundedness of a suitable L^r_tL^s_x norm, is sufficient to prove the full set of Strichartz estimates. We also construct several counterexamples which show that our assumptions are optimal, both for local and for global Strichartz estimates, in the class of large unsigned potentials V ∈L^r_tL^s_x. Support. The authors are partially supported by the Research Training Network (RTN) HYKE and by grant HPRN-CT-2002-00282 from the European Union. The third author is supported also by INDAM     

Ueber das volle Formensystem der tern?ren biquadratischen Formf=x13x2+x23x3+x33x1

Ohne ZusammenfassungHieizu cme Tale