数值级数法求解时滞抛物型方程

利用数值级数法求解时滞抛物型方程,特点是对方程离散后(半离散)将数值解用级数的形式表示.通过对离散后方程(半差分格式)收敛性、稳定性的分析可以看出该格式收敛且稳定.数值算例表明该方法还有很高的精度.     

求解变系数对流扩散方程的数值级数法

利用数值级数法对微分方程进行半离散,在离散后的网格点处用无穷级数表示数值解.利用无穷级数以及定积分的梯形积分近似公式可以得到显示的差分格式,并证明差分格式是收敛和稳定的.通过数值算例验证只需取级数前6项就可以达到很高的精度,因此该方法是有效的.     

求解扩散方程的高精度显式紧致差分格式

首先针对一维扩散方程,空间方向采用二阶导数的四阶紧致差分公式进行离散,时间方向采用泰勒级数展开的方法进行离散,推导出了一种高精度显式紧致差分格式;然后通过Fourier分析方法给出了格式的稳定性条件为λ≤1/2(λ为网格比);最后通过数值实验验证了格式的精确性和可靠性.     

对流方程的六阶中心差分格式

有限差分方法是微分方程数值解法中发展最早、理论最完善、应用最广泛的计算方法之一．利用待定系数法构造了对流方程的中心有限差分格式,利用Taylor级数展开推导出了该差分格式的修正偏微分方程（MPDE）,采用数值余项效应分析方法从空间离散方面改进了该格式．利用高阶TVD Runge-Kutta方法从时间离散方面改进了该格式．利用Richardson外推方法在不增加计算复杂度的前提下改革了原格式．数值实验表明本文讨论的3种方法在差分格式改进和优化中的有效性．本文讨论的方法也可以用于其他偏微分方程有限差分方法的构造中．     

对称正则长波方程的两层差分方法

提出对称正则长波方程的一种时间和空间均二阶精度的两层有限差分格式.利用离散能量法证明了差分格式的收敛性.通过数值实验,分析格式的守恒性,对比精确解和差分格式数值解,验证了该算法的可行性和有效性.     

求解一类非线性偏微分方程的高精度紧致差分方法

针对一类非线性偏微分方程,提出了一种新的高精度紧致差分方法.首先对内部网格节点处的空间一阶和二阶导数项采用四阶精度的Padé紧致差分格式进行离散,然后对时间导数项采用泰勒级数展开并使用截断误差余项修正法进行离散,最终得到了求解该非线性方程的一种三层隐式高精度紧致差分格式,其截断误差为O(τ2+τh2+h4),即当τ=O(h2)时,该格式在空间上具有四阶精度.最后通过对广义Burgers-Fisher方程和广义Burgers-Huxley方程的数值求解,验证了本文方法的精确性和可靠性.     

Helmholtz方程的三维紧差分格式及快速求解算法

本文从差分角度对三维helmholtz方程进行离散,得到相应的紧差分格式,并通过数值实验表明,快速算法对该格式具有良好的适用性．     

数值求解一维波动方程的四阶紧致差分方法

针对一维波动方程提出了一种有限差分方法.首先,采用泰勒级数展开公式和原方程代入的方法推导出了第一个时间层未知函数值的四阶紧致差分格式.然后,用四阶紧致差分公式近似空间导数项,采用中心差分格式截断误差余项修正的方法处理时间导数项,推导出了第二个时间层以后未知函数的四阶紧致差分格式.该方法时间和空间具有整体四阶精度.利用Fourier方法分析了所提格式的稳定性.由于本文格式在未知时间层仅涉及3个网格点,因此可采用追赶法求解离散化后所得到的线性方程组.最后,用数值算例验证了本文格式的精确性和稳定性.     

泊松方程非等间距有限差分的数值求解方法

采用3阶精度中心差分格式对Dirichlet边界条件下的二维泊松方程进行离散,近边界网格点处采用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.     

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).     

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.     

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.