二维线性常系数Schrdinger方程的两个ADI格式

在量子力学、等离子物理等许多学科中,均有大量的Schrdinger型方程,其数值求解具有重要的物理意义。本文提出了数值求解二维线性常系数Schrdinger方程的两个ADI格式(P—R格式和M—F格式),通过Von-Neumann方法判断出这两个格式均是无条件稳定的。运用Taylor展开,得出这两个格式在点处的截断误差分别为O(k2+h2)和O(k2+h4)。数值实验中,固定h,变动k,画出每次的误差曲线,验证了该格式的无条件稳定性;数值实验还表明,用这两个交替方向隐格式计算比用通常的C-N格式所消耗的CPU时间大大减少,因而该格式具有一定的实际意义。     

一种求解一维对流扩散方程的高精度紧致隐式差分格式

提出了数值求解一维非定常对流扩散方程的一种两层四阶紧致隐式差分格式,其截断误差为O（τ^2＋h^4）.采用von Neumann方法证明了格式是无条件稳定的,并且由于每一时间层上只用到了3个网格点,所以可直接采用追赶法求解差分方程.数值实验结果验证了该方法的精确性和可靠性.     

求解扩散方程的一种高精度隐式差分方法

利用一阶微商和二阶微商的四阶紧致差分逼近公式,推导出了数值求解一维扩散方程的两种新的高精度隐式紧致差分格式,其截断误差分别为O(τ^2 h^4)和O(τ^4 h^4)．通过Fourier分析方法证明了格式O(τ^2 h^4)是无条件稳定的,而格式O(r^4 h^4)是无条件不稳定的．并且由于每一时间层上只用到了3个网格点,所以差分方程可采用追赶法直接进行求解．     

求解二维扩散方程的加权平均隐式多重网格方法

提出了数值求解二维扩散方程两种精度分别为O(τ^2 h^2)和O(τ^2 h^4)的无条件稳定的加权平均隐格式，并采用多重网格方法进行求解，从而克服了传统迭代法在求解隐格式时收敛速度慢的缺陷，提高了求解效率．数值实验验证了该方法的精确性和可靠性．     

三维波动方程的隐式多重网格方法

提出了数值求解三维波动方程的两种精度分别为O(τ^2 h^2)和O(τ h^4)的三层紧致隐格式,利用Fourier分析方法证明了格式均是无条件稳定的．并在此基础上提出了求解该问题的多重网格算法,从而克服了传统迭代法在求解隐格式时收敛速度慢的缺陷,大大加快了迭代收敛速度,提高了求解效率．数值实验结果验证了方法的精确性和可靠性．     

求解波动方程的高精度紧致隐式差分方法

基于二阶微商的二阶中心差商和四阶紧致差商逼近公式及其加权平均思想，推导出了数值求解一维波动方程的2种精度分别为O（x^2＋h^4）和O（x^4＋h^4）的三层隐式紧致差分格式，以夏与之相匹配的第一个时间步的同阶离散格式，并采用Fourier方法分析了格式的稳定性．由于每一时间层上最多只用到了3个网格点，所以可采用追赶法直接求解差分方程．数值实验结果验证了所得方法的精确性和可靠性．     

求解热传导方程的Crank-Nicolson方法

给出了数值求解热传导方程的一种Crank-Nicolson格式,其截断误差为O（τ^2＋h^2）,并且分析了该差分格式的稳定性.在最后的数值例子中,验证了该格式求解出的数值解可以很好的逼近精确解,以及当空间步长和时间步长同时缩小1/2倍时,最大误差约缩小为原来的1/4.     

非球谐环形振子势的Schrdinger方程的解析解

量子力学中除了无限深势阱、一维线性谐振子、库仑势和三维各向同性谐振子势外，绝大部分Schrodinger方程是没有精确解的，这给具体问题的深入研究带来了很大的障碍。本文从求解Schrodinger方程的NU Method方法出发，求解了非球谐环形振子势V（r，θ）=μω^2r^2／2＋h^2α／（2μr^2）＋h^2βcosθ／（2μr^2sinθ）的本征方程的角向方程，获得解析解，将求解的过程大大简化；同时用特殊函数的方法求解了非球谐环形振子势的Schodinger方程的径向方程，借以拓宽对Schrodinger方程求解方法的研究。     

一类拟线性神经传播方程的紧LOD差分格式

通过引入变量将方程从形式上降阶,提出了求解一类拟线性神经传播方程的紧局部一维（LOD）差分格式,并应用能量方法给出了格式的误差估计,得到该格式在L^2模下具有O（Δt^2＋h^4）的精度．最后通过数值例子验证了算法的有效性．     

色散方程的两个隐式差分格式

给出了色散方程的两个隐式差分格式,其截断误差均为0（τ＋h^2）,其中一个格式是无条件稳定的．     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.