一类复Schrdinger方程和实Klein-Gordon方程耦合方程组解的整体存在性

本文主要对下面一类复非线性Schrodinger方程和实非线性Klein-Gordon方程的耦合方程组(1)研究其解的整体存在性和渐近性态,这里f,g满足|f(λ)|,|g(λ)|=O(|λ|~(α 1)) 在λ=0附近(2)其中λ=(λ_0,λ_1……λ_(n 1),λ_(n 2)),α是≥1的整数。我们在适当的光滑性的假定下,证明了当n>2α 2/α~2时,问题(1)对“小”初值存在唯一的整体光滑解u,v,且当t→ ∞时,u,v具有衰减性质||u(t)||_L~(2α 2)=O(t~(-απ/2α 2),||v(t)||_L~(2α 2)=O(t~(-απ/2α 2)。     

直射线CT技术的局限性

分析了利用弯曲路径旅行时进行直射线反演的若干结果,对直射线CT技术的局限性进行了讨论.研究认为,对所讨论的区域而言,若介质速率的相对变化较大时,运用反演的结果不能很好地确定区域的内部结构;而当介质速率的相对变化较小时,对5m左右的薄层,它亦只能确定速度异常区的存在,而不能很好地确定其速度异常的数值.     

用有限元迭代法分析有滚柱支架的架空热力管道系统

当架空热力管道系统中有滚柱支架时,热胀的管道与支架问的横向和轴向位移的摩擦系数不同,导致摩擦接触面处于正交各向异性摩擦接触状态.本文提出了处理这种摩擦接触情况的基本思想和分析方法,用有限元迭代法分析计算了有滚柱支架的架空热力管道系统的位移和应力.计算结果表明,影响管线变形的主要因素是沿管道横向的摩擦力.设置滚柱支架使管线在支架处的横向位移为滚动,可以减小摩擦对位移的影响.     

On a Theorem of Dubins and Freedman

Under a notion of splitting the existence of a unique invariant probability, and a geometric rate of convergence to it in an appropriate metric, are established for Markov processes on a general state space S generated by iterations of i.i.d. maps on S. As corollaries we derive extensions of earlier results of Dubins and Freedman;⁽¹⁷⁾ Yahav;⁽³⁰⁾ and Bhattacharya and Lee⁽⁶⁾ for monotone maps. The general theorem applies in other contexts as well. It is also shown that the Dubins–Freedman result on the necessity of splitting in the case of increasing maps does not hold for decreasing maps, although the sufficiency part holds for both. In addition, the asymptotic stationarity of the process generated by i.i.d. nondecreasing maps is established without the requirement of continuity. Finally, the theory is applied to the random iteration of two (nonmonotone) quadratic maps each with two repelling fixed points and an attractive period-two orbit.     

具有可变几何喷嘴的增压器轴流涡轮热力计算方法

本文提出具有可变几何喷嘴的增压器轴流涡轮热力计算方法。引入三个脉冲系数将脉冲涡轮按等压涡轮计算。给定通流部分尺寸,利用可变几何喷嘴来满足所驱动压气机和涡轮的配合。考虑各部实际损失,采用吴仲华燃气热力性质表迭代计算求出反动度、喷嘴出气角和喉口面积。可给定废气初温时迭代所需的初压或给定初压时迭代所需的初温,并算出涡轮当量通流面积。计算结果表明迭代计算是收敛的,算出的喷嘴喉口面积与实际相符。     

The parallel calculation of the ground-state correlation energy of Helium atom

When we use Modified Configuration Interaction method (MCI) to calculate the correlation energy of double-electron systems, for obtaining the higher precision, we always need huge calculations. In order to handle this problem, which will cost much CPU time and memory room if only using a single computer to do it, we now adopt the parallel multisection recurrence algorithm. Thus we can use several CPUs to get the ground-state energy of a Helium atom at the same time. Supported by Opening Foundation of Laboratory of Wavy Spectrum and Atomic and Molecular Physics, Wuhan Institute of Physics, Chinese Academy of Sciences Liu Lianjun: born in 1946, Associate professor     

ITERATION OF FIXED POINTS ON HYPERSPACES

ＩＴＥＲＡＴＩＯＮＯＦＦＩＸＥＤＰＯＩＮＴＳＯＮＨＹＰＥＲＳＰＡＣＥＳＨＵＴＨＡＫＹＩＮ＊ＨＵＡＮＧＪＵＩＣＨＩ＊ＭａｎｕｓｃｒｉｐｔｒｅｃｅｉｖｅｄＯｃｔｏｂｅｒ２２，１９９６．＊Ｄｅｐａｒｔｍｅｎｔｏｆｍａｔｈｅｍａｔｉｃｓ，ＴａｍｋａｎｇＵｎｉ...     

A domain decomposition method for linear exterior boundary value problems

In this paper, we present a domain decomposition method, based on the general theory of Steklov-Poincaré operators, for a class of linear exterior boundary value problems arising in potential theory and heat conductivity. We first use a Dirichlet-to-Neumann mapping, derived from boundary integral equation methods, to transform the exterior problem into an equivalent mixed boundary value problem on a bounded domain. This domain is decomposed into a finite number of annular subregions, and the Dirichlet data on the interfaces is introduced as the unknown of the associated Steklov-Poincaré problem. This problem is solved with the Richardson method by introducing a Dirichlet-Robin-type preconditioner, which yields an iteration-by-subdomains algorithm well suited for parallel computations. The corresponding analysis for the finite element approximations and some numerical experiments are also provided.     

An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation AXB=C

An iteration method is constructed to solve the linear matrix equation AXB=C over symmetric X. By this iteration method, the solvability of the equation AXB=C over symmetric X can be determined automatically, when the equation AXB=C is consistent over symmetric X, its solution can be obtained within finite iteration steps, and its least-norm symmetric solution can be obtained by choosing a special kind of initial iteration matrix, furthermore, its optimal approximation solution to a given matrix can be derived by finding the least-norm symmetric solution of a new matrix equation . Finally, numerical examples are given for finding the symmetric solution and the optimal approximation symmetric solution of the matrix equation AXB=C.