非线性粘弹性方程的EQrot1非协调有限元分析

针对非线性粘弹性方程,在半离散和全离散格式下给出EQrot1非协调有限元逼近.由于该单元的相容误差(O(h2)阶)比插值误差(O(h)阶)高一阶,可得到在H1模意义下的O(h2)阶超逼近结果,并利用插值后处理技术导出整体超收敛.进而,基于该单元的渐近展开式,构造新的插值后处理算子和外推格式,给出O(h4)阶的外推结果.最后,运用与以往文献不同的方法得到全离散逼近格式的最优误差估计.     

电报方程的类Wilson非协调有限元分析

本文在矩形网格上讨论了半离散和全离散格式下电报方程的类Wilson非协调有限元逼近.利用该元在H1模意义下O(h2)阶的相容误差结果,平均值理论和关于时间t的导数转移技巧得到了超逼近性.进而,借助于插值后处理方法导出了超收敛结果.又由于该元在H1模意义下的相容误差可以达到O(h3)阶,构造了新的外推格式,给出了比传统误差估计高两阶的外推估计.最后,对于给出的全离散逼近格式得到了最优误差估计.     

非线性抛物积分微分方程的类Wilson非协调元分析

在半离散和全离散格式下讨论非线性抛物积分微分方程的类Wilson非协调有限元逼近.当问题的精确解u∈H3(Ω)/H4(Ω)时,利用该元的相容误差在能量模意义下可以达到O(h2)/O(h3)比其插值误差高一阶和二阶的特殊性质,再结合协调部分的高精度分析及插值后处理技术,并借助于双线性插值代替传统有限元分析中不可缺少的Ritz-Volterra投影导出了半离散格式下的O(h2)阶超逼近和超收敛结果.同时分别得到了向后Euler全离散格式下的超逼近性和Crank-Nicolson全离散格式下的最优误差估计.     

非线性Sine-Gordon方程Hermite型有限元新的超收敛分析及外推

在半离散格式下讨论了一类非线性Sine-Gordon方程的Hermite型矩形元逼近.利用该元的高精度分析和对时间t的导数转移技巧,得到了H1模意义下O(h2)阶的最优误差估计和O(h3)阶的超逼近性.进一步地,通过运用插值后处理方法,给出了超收敛结果.与此同时,借助于构造一个新的外推格式,导出了与线性情形相同的O(h4)阶外推解.     

黏弹性方程的Wilson元收敛性分析

对一类黏弹性方程利用Wilson元提出新的半离散和全离散逼近格式.基于单元的性质,通过定义新的双线性型,在不需要外推和插值后处理技术的前提下,分别得到了比传统的H~1-范数更大的模意义下相应的O(h~2)阶和O(h~2+τ~2)阶的误差分析结果,正好比通常的关于Wilson元的误差估计高出一阶.这里,h,τ表示空间剖分参数和时间步长.     

一类非线性四阶双曲方程扩展的混合元方法的超收敛分析

对一类非线性四阶双曲方程利用双线性元Q_(1)及Nedelec's元建立一个扩展的协调混合元逼近格式.首先证明了逼近解的存在唯一性.其次,基于上述两个单元的高精度结果,给出了插值和投影之间的误差估计,再利用对时间t的导数转移技巧和插值后处理技术,在半离散和全离散格式下分别导出了原始变量u和中间变量v=-△u在H~1模及中间变量q=▽u,σ=-▽(△u)在(L~2)~2模意义下单独利用插值和投影所无法得到的具有O(h~2)和O(h~2+τ~2)阶的超收敛结果.最后通过数值算例,表明逼近格式是行之有效的.这里,h和τ分别表示空间剖分参数及时间步长.     

非线性四阶双曲方程低阶混合元方法的超收敛分析

对一类非线性四阶双曲方程利用双线性元Q_(11)及Q_(01)×Q_(10)元给出了一个低阶混合元格式.基于上述两个单元的高精度结果,采用插值和投影相结合的方法,利用对时间t的导数转移技巧,借助插值后处理技术,在半离散格式下导出了原始变量u和中间变量u=-△u在H~1模意义下及流量p=-▽u在(L~2)~2模意义下具有O(h~2)阶的超逼近和超收敛结果.与此同时,在全离散格式下,证明了u和v在H~1模意义下及p在(L~2)~2模意义下单独利用插值或投影所无法得到的具有O(h~2+(△t)~2)阶的超逼近和超收敛结果.     

双曲积分微分方程类Wilson非协调元的超收敛和外推

将类Wilson非协调元方法应用于半离散格式下双曲积分微分方程的逼近.当问题的精确解u∈H3(Ω)/H4(Ω)时,利用该单元相容误差在能量范数意义下可达到O(h2)/O(h3)阶(比其插值误差高一阶/两阶)的特殊性质,并结合双线性元的高精度分析和插值后处理技巧,得到了与以往文献中双线性元完全相同的O(h2)阶的超逼近性质和整体超收敛结果.进而,通过构造一个新的外推格式导出了具有三阶精度的外推解.     

EFK方程一个新的低阶非协调混合有限元方法的高精度分析

对Extended Fisher-Kolmogorov(EFK)方程,利用EQ_1~(rot)元和零阶RaviartThomas(R-T)元建立了一个新的非协调混合元逼近格式.首先,证明了半离散格式逼近解的一个先验估计并证明了逼近解的存在唯一性.在半离散格式下,利用上述两种元的高精度分析结果以及这个先验估计,在不需要有限元解u_h属于L~∞的条件下,得到了原始变量u和中间变量v=-?u的H~1-模以及流量p=u的(L~2)~2-模意义下O(h~2)阶的超逼近性质.同时,借助插值后处理技术,证明了上述变量的具有O(h~2)阶的整体超收敛结果.其次,建立了一个新的线性化向后Euler全离散格式并证明了其逼近解的存在唯一性.另一方面,通过对相容误差和非线性项采取与传统误差分析不同的新的分裂技巧,分别导出了以往文献中尚未涉及的关于u和v在H~1-模以及p在(L~2)~2-模意义下具有O(h~2+τ)阶的超逼近性质,进一步地,借助插值后处理技术,得到了上述变量的整体超收敛结果.这里h和τ分别表示空间剖分参数和时间步长.最后,给出了一个数值算例,计算结果验证了理论分析的正确性.     

非线性Sine-Gordon方程的一个新非协调混合元格式

针对非线性sine-Gordon方程利用EQrot1和零阶Raviart-Thomas元建立一个自然满足Brezzi-Babuka条件的新非协调混合元逼近格式.基于EQrot1非协调元的两个特殊性质:(i)当精确解属于H3(Ω)时,其相容误差为O(h2)阶,比它的插值误差O(h)高一阶;(ii)插值算子与Riesz投影算子等价,再结合零阶Raviart-Thomas元的高精度分析结果和插值后处理技术,针对半离散逼近格式导出原始变量u和流量p分别在H1模和L2模意义下的超逼近性及超收敛结果.同时,对于提出的一个具有二阶精度全离散逼近格式,得到相应的最优误差估计.     

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的循环码的码词数.     

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.     

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.     

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.     

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

Ohne ZusammenfassungHieizu cme Tale     

Expansion in SLd(Z/qZ), q arbitrary

Let S be a fixed finite symmetric subset of SL _d (Z), and assume that it generates a Zariski-dense subgroup G. We show that the Cayley graphs of π _q (G) with respect to the generating set π _q (S) form a family of expanders, where π _q is the projection map Z→Z/q Z.     

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

     

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.     

Proof of the impossibility of the fermat equation Xp + Yp = Zp for special values of p and of the more general equation bXn + cYn = dZn

This paper continues the search to determine for what exponents n Fermat's Last Theorem is true. The main theorem and Corollary 1 consider the set of prime exponents p for which mp + 1 is prime for certain even integers m and prove the truth of FLT in Case 1 for such primes p. The remaining theorems prove the inequality of the more general Fermat equation bXⁿ + cYⁿ = dZⁿ.