High parallelization efficiency in barotropic-mode computation of ocean models based on multi-grid boundary ghost area

In general, barotropic-mode computation requires the largest communication time in ocean models because of its iterative nature, when parallel computation is performed based on regional partitioning. In this study, reduction in the overhead time included in the communication in the parallel computation of the barotropic mode is considered to achieve a high parallelization efficiency of ocean models. We verify that the reduction in the communication frequency based on the multi-grid boundary ghost area reduces the total communication time. We find that this is because the sum of several kinds of overhead time for communication occupies a fairly large part of the total communication time. We discuss the trade-off between the decrease in communication time and the increase in computation time due to increased boundary area in such cases, leading to a determination of a suitable width of the multi-grid boundary that minimizes the total required time. We also discuss the efficiencies of the one- and two-dimensional partitioning of the model domain, when a multi-grid boundary is used. In general, two-dimensional partitioning is more efficient than one-dimensional for large partitioning numbers.     

Efficient GOCE satellite gravity field recovery based on least-squares using QR decomposition

We develop and apply an efficient strategy for Earth gravity field recovery from satellite gravity gradiometry data. Our approach is based upon the Paige-Saunders iterative least-squares method using QR decomposition (LSQR). We modify the original algorithm for space-geodetic applications: firstly, we investigate how convergence can be accelerated by means of both subspace and block-diagonal preconditioning. The efficiency of the latter dominates if the design matrix exhibits block-dominant structure. Secondly, we address Tikhonov-Phillips regularization in general. Thirdly, we demonstrate an effective implementation of the algorithm in a high-performance computing environment. In this context, an important issue is to avoid the twofold computation of the design matrix in each iteration. The computational platform is a 64-processor shared-memory supercomputer. The runtime results prove the successful parallelization of the LSQR solver. The numerical examples are chosen in view of the forthcoming satellite mission GOCE (Gravity field and steady-state Ocean Circulation Explorer). The closed-loop scenario covers 1 month of simulated data with 5 s sampling. We focus exclusively on the analysis of radial components of satellite accelerations and gravity gradients. Our extensions to the basic algorithm enable the method to be competitive with well-established inversion strategies in satellite geodesy, such as conjugate gradient methods or the brute-force approach. In its current development stage, the LSQR method appears ready to deal with real-data applications.     

Electrical aerosol spectrometer of Tartu University

The electrical aerosol spectrometer (EAS) of the parallel measuring principle at Tartu University is an efficient instrument for rapid measurement of the unstable size spectrum of aerosol particles. The measuring range from 10 nm to 10 μm is achieved by simultaneously using a pair of differential mobility analyzers with two different particle chargers. The particle spectrum is calculated and measurement errors are estimated in real time by using a least-squares method. Experimental calibration ensures reliability of measurement. The instrument is well suited for continuous monitoring of atmospheric aerosol.     

一种求气井二项式方程系数的新方法

针对开发早期气田缺乏产能试井资料的实际情况，由于无法用传统的压力降法计算产能方程，故而基于最优化算法，提出了一种利用稳定生产数据和井控储量求取气井产能方程系数的新方法。在只知道稳定生产数据情况下便可进行计算分析。该方法在气田进行了实际应用，并和实际资料以及传统试凑法计算的结果进行了比较，表明方法的计算结果较为可靠。     

生态地理建模中的多尺度问题

本文在分析生态地理建模内涵的基础上,讨论了生态地理建模中的尺度转换问题、跨尺度相互作用问题、空间尺度与时间尺度的关联问题和多尺度数据处理问题.由于生态地理问题的非线性、生态环境的异质性和随机事件,简单的线性尺度转换方法远不能满足生态地理建模的要求.为了从根本上解决生态地理建模中的时空尺度问题,除需要运用微分几何学和等级理论等经典方法外,还需要引入格点生成法和网格计算等现代理论和技术手段.     

一种在异构系统中实现负载平衡的方法

提出了在异构系统实现负载平衡的区域分解算法和实现负载平衡的计算方法，利用它的负反馈性质解决了异构系统处理机计算速度测量误差造成的负载测量不准问题，并对处理机速度变化，速度测量误差、处理机数量、网格点计算量的分布等因素的影响进行了计算，结果表明本方法具有很强的平衡负载能力和较强的适应性；根据计算结果提出了解决模式网格点计算量不易测量问题的解决方案，并用扩散方程和模拟物理过程进行试验，试验表明这种方法是可行的，平衡负载的效果十分显著。     

一种符合视觉规律的,基于地图数据的虚拟地景仿真

本文分析和解决了两个关键性问题，使计算机所生成的虚拟地景符合人的“越近看得越清”视觉规律，并通过实例对该方法的实现过程给予了详细的描述。     

计算机网络的分布式计算环境及分布式处理

本文对网络计算模式、分布式计算环境以及分布式处理机能作了分析和探讨。     

Fast space-domain evaluation of geodetic surface integrals

Geodetic surface integrals play an important role in the numerical solution of geodetic boundary-value problems. In many cases they can be evaluated using fast methods in the frequency domain (FFT). However, this is not possible in general, because the domain of integration may be non-trivial (as is the surface of the Earth), the kernel function may not be of convolution type, or the data distribution may be heterogeneous. Therefore, fast evaluation strategies are also required in the space domain. They are more difficult to design because only one property is left where a more or less fast evaluation strategy can be built upon: the potential type of the kernel function. Consequently, the idea is not to replace well-established frequency domain techniques, but to supplement them. Our approach to this problem goes in two directions: (1) we use advanced cubature methods where the integration nodes automatically densify in the vicinity of the evaluation points; (2) we use powerful computer hardware, namely MIMD computers with distributed memory. This enables us to evaluate geodetic surface integrals of any practical complexity in reasonable time and accuracy. This is shown in a numerical example. Received: 7 May 1996 / Accepted:17 March 1997     

τ-P域地震资料三维叠前深度偏移及其实用算法

本文提出了在τ-P域实现三维叠前深度偏移的计算方法，该方法把地震道集由时-空域变换到τ-P域，然后对共P数据体进行相移或相移加插值偏移，将偏移后的各共P数据体叠加得到叠前深度偏移结果．该算法能够实现陡倾地层的正确归位，降低偏移处理维数，减少计算机内存需求，易于并行处理，但是计算量和所花费的计算机时间仍然很大．为此我们又提出了针对目的层的分时（层）偏移方法，由于只考虑目的层，可节省大量的计算时间．文中以二维实际地震资料及三维数值模型资料的处理说明了上述方法的可行性与有效性．