矩阵方程AX＋YB＝D及AX＋XA＝D的最优解

本文考虑如下问题问题Ⅰ.给定A∈Rm×n,B∈Rt×p,D∈Rm×p,设L1={[X,y]X∈Rm×p,Y∈Rm×t,‖AX+YB-D‖=min},求[X,Y]∈L1,使得‖[X,Y]‖=(‖X‖2+‖Y‖2)1/2=min问题Ⅱ.给定A∈SRm×m,B∈Rm×m,(a)设S1={XX∈SPm×m,‖AX+XA-B‖=min}求     

有界闭集上酉矩阵的反问题

令S＝｛A∈Mm｜‖AX1－B1‖AX1－B1‖＝min，X1，B1∈Cm×p｝，其中Cm×p表示m×p阶复矩阵，Mm表示m×m阶酉矩阵，‖·‖表示Frobenius范数。本文考虑如下问题：问题Ⅰ：给定矩阵X2，B2∈Cm×n，求A∈S，使：f（A）＝‖AX2－B2‖＝min其解集记为S2。问题Ⅱ：给定矩阵，求满足：本文给出了解集SA的通式及逼近解的表示式和一些有关的结果，并给出了相应的数值算法。     

广义逆矩阵在酉不变范数下的极小性质

本文证明了,对每个酉不变范数‖·‖_(UI)当x=A~(1,3)B时,‖AX-B‖_(UI)达到最小值;反之,如果Y具有这一性质:对每个酉不变范数‖·‖_(UI)以及任意矩阵B,当X=YB时,‖AX-B‖_(UI)达到最小值,则Y∈A{1,3}.还证明了A~+B是矩阵方程AX=B在每个酉不变范数之下的最佳逼近解,同时得出了X=A~+DB~+是矩阵方程AXB=D在每个酉不变范数之下的逼近解的条件。     

线性矩阵方程的斜Hermit{P,k+1}Hamilton解

给定矩阵P∈C~(n×n)且P~*=-P=P~(k+1).考虑了矩阵方程AX=B存在斜Hermite{P,k+1}(斜)Hamilton解的充要条件,并给出了解的表达式.进一步,对于任意给定的矩阵∈C~(n×n),给出了使得Frobenius范数‖-‖取得最小值的最佳逼近解∈C~(n×n).当矩阵方程AX=B不相容时,给出了斜Hermite{P,k+1}(斜)Hamilton最小二乘解,在此条件下,给出了对于任意给定矩阵的最佳逼近解.最后给出一些数值实例.     

线性流形上亚半正定矩阵的一类反问题

本文考虑如下问题问题P给定X,B∈Rn×m,找A∈SE∩Rn×n≥0,使得AX=B,其中SE={A∈Rn×n| ‖Ay-Z ‖=min,y,Z∈Rn×p},Rn×n≥0={A∈Rn×n|yT Ay≥o,V y∈Rn},‖@‖是矩阵的Frobenius范数.文中讨论了问题P有解的充分必要条件,并在有解的情况下,给出了问题P的解的表示.     

矩阵方程的三对角中心对称最小二乘解

给出矩阵方程AX=B存在三对角中心对称解的充分必要条件,并且给出AX=B的特殊最小二乘解,即对任意给定A,B∈Rm×n,寻求三对角中心对称矩阵X(X∈Rn×n),使得‖AX-B‖最小.     

矩阵方程求解中SVD方法的讨论

分析了利用矩阵A(A∈Crm×n),B(B∈Ctm×n)的奇异值分解来求解矩阵方程AX=C(X∈Cm×n)与AXB=C(X∈Cn×m),讨论了有解的充分必要条件,并在有解时给出了解的一般形式.对于一般的无特殊规律矩阵方程,利用其奇异值分解来求解将会十分的方便.     

线性流形上一类双结构矩阵反问题的最小二乘解

设 J=[-0In I0n]In是n阶单位辛矩阵,若A∈C2n×2n满足AHA=I2n,AHJA=J,则称A为辛酉矩阵,所有2n阶辛酉阵的全体记为SUC2n×2n.令S={A∈SUC2n×2n|‖AY-Z‖=min,Y, Z∈C2n×p},本文考虑如下问题:问题Ⅰ给定X,B∈C2n×m,求A∈S使f(A)=‖AX-B‖=min.问题Ⅱ给定～A∈C22n×2n,求～A∈SE使得‖～A-～A‖=infA∈SE‖～A-A‖,其中SE是问题Ⅰ的解集合.本文给出了解集SE的通式及逼近解～A的表示式和一些有关的结果,并给出了相应的数值算法.     

矩阵方程AXAT+BYBT=C的对称最优解及最佳逼近

考虑以下问题:问题1:给定A∈Rm×n,B∈Rm×l,C∈Rm×m,L={(X,Y)|AXAT BYBT=C,X∈SRn×n,Y∈SRl×l}≠φ,找(X⌒,Y⌒)∈L,使得‖(X⌒,Y⌒)‖=(‖X‖2 ‖Y‖2)(1)/(2)=min.问题2:任意给定(X∧)∈Rn×n,(Y∧)∈Rl×l,找(X∧,Y∧)∈L,使得‖(X∧)-(X～)‖2 ‖(Y∧)-(Y～)‖2=min(X,Y)∈L(‖X-(X～)‖2 ‖Y-(Y～)‖2).讨论了矩阵方程AXAT BYBT=C有解的充要条件,得到了L的具体表达式,给出了问题1与问题2的唯一解证明与显式表示.     

一类约束矩阵方程的可解条件与最佳逼近问题

利用空间分解理论和矩阵的奇异值分解等方法,证明了矩阵方程AX+B Y=Z在矩阵集合Cnr×n(P,Q)×Cna×n(P,Q)中可解的充分必要条件,并得到通解的表达式.对于相关逼近问题,证明最佳逼近解的存在唯一性,得到解的显式表达式.最后,给出最佳逼近解的扰动分析.     

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.