Theory and Application of Characteristic Finite Element Domain Decomposition Procedures for Coupled System of Dynamics of Fluids in Porous Media

For a coupled system of multiplayer dynamics of fluids in porous media,the characteristic finiteelement domain decomposition procedures applicable to parallel arithmetic are put forward.Techniques suchas calculus of variations,domain decomposition,characteristic method,negative norm estimate,energy methodand the theory of prior estimates are adopted.Optimal order estimates in L~2 norm are derived for the error inthe approximate solution.     

一维问题的一种积分形式的流量重构算法

1引言我们考虑如下一维二阶椭圆边界值问题(-(β(x)p′)(x))′=f(x),x∈(a,b) p(a)=p(b)=0(1))其中β=β(x)是一恒正函数,且β∈H~1(a,b),f∈L~2(a,b)．事实上,在此条件下,我们可保证p∈H~2(a,b)(见[1],[2])．(1)之弱形式为：求p∈H_0~1(a,b)使得a(p,q)=(f,q),(?)q∈H_0~1(a,b),(2)其中a(p,q)=(?)_a~bβp′q′dx,(f,g)=(?)_a~bfqdx．给定(a,b)的一个分割α=x_0＜x_1＜…＜x_(n-1)＜x_n=b,令h=(?)(x_i-x_(i-1)),(?)_i表示通常相应于节点x_i的形状函数,即(?)_i是连续的分段线性函数且满足(?)_i(x_k)=δ_(ik),这里δ_(ik)=(?)i,k=0,1,…,n．又记V_h~0=span{(?)_1,(?)_2,…,(?)_(n-1)),取V_h~0作为p的逼近空间,则求解(1)的标准有限元格式为：求ph∈V_h~0使得     

AN IMPROVED SEARCH-EXTENTION METHOD FOR SOLVING SEMILINEAR PDES

This article will combine the finite element method, the interpolated coefftcient finite element method, the eigenfunction expansion method, and the search-extension method to obtain the multiple solutions for semilinear elliptic equations. This strategy not only grently reduces the expensive computation, but also is successfully implemented to obtain multiple solutions for a class of semilinear elliptic boundary value problems with non-odd nonlinearity on some convex or nonconvex domains. Numerical solutions illustrated by their graphics for visualization will show the efficiency of the approach.     

Fast computation of a rational point of a variety over a finite field

We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time-space complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system. This invariant, called the degree, is bounded by the Bézout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.

     

各向异性接合材料界面端部场数值分析

为了求解各向异性接合材料界面端部奇异性应力场,建立了一种新型杂交元模型.该模型的独特之处在于:基于有限元特征法得到的奇异性场数值特征解建立了一种新型界面端奇异单元.通过算例证明,新型杂交元模型能够利用较少的单元数获得较为精确的数值结果.当前模型应用范围广泛,能够用于复杂结构的界面端部场求解.     

Differential geometry of tensor product immersions

In this article we obtain the best possible estimates of the type number of tensor product immersions and investigate tensor product immersions with lowest possible type. Several classification theorems in this respect are then proved.     

Asymptotic properties of constrained Markov Decision Processes

We present in this paper several asymptotic properties of constrained Markov Decision Processes (MDPs) with a countable state space. We treat both the discounted and the expected average cost, with unbounded cost. We are interested in (1) the convergence of finite horizon MDPs to the infinite horizon MDP, (2) convergence of MDPs with a truncated state space to the problem with infinite state space, (3) convergence of MDPs as the discount factor goes to a limit. In all these cases we establish the convergence of optimal values and policies. Moreover, based on the optimal policy for the limiting problem, we construct policies which are almost optimal for the other (approximating) problems. Based on the convergence of MDPs with a truncated state space to the problem with infinite state space, we show that an optimal stationary policy exists such that the number of randomisations it uses is less or equal to the number of constraints plus one. We finally apply the results to a dynamic scheduling problem.This work was partially supported by the Chateaubriand fellowship from the French embassy in Israel and by the European Grant BRA-QMIPS of CEC DG XIII     

Curran猜想的解答

本文确定了能作为有限群自同构群的Ｐ－群的最佳下最，彻底解决了Ｃｕｒｒａｎ在１９８９年提出的关于此最佳下界的三个猜想。     

关于一个猜想的探讨

作者在文献[1]中证明了一个结果:有限群G如果满足|P(G),p|=1,则G为P~-可解群。本文将指出,这个论断的逆命题不成立。并且还指出,满足条件(|P(G)|,p)=1的有限群也不一定是p~-超可解群。