并行组合模拟退火算法在边坡稳定分析中的应用

采用自适应有限元法分析边坡的应力场,然后应用并行组合模拟退火算法建立基于应力场的边坡任意形状临界滑动面的全局搜索方法。该方法适用于任意几何形状,不同岩土材料分层以及多种荷载作用的复杂边坡。并行组合模拟退火算法是将模拟退火算法和遗传算法相结合的优化算法,它可以从多个初始点开始并行寻优,能以较快的速度找到全局最优解。通过工程实例分析,证明这种基于自适应有限元分析和并行组合模拟退火算法搜索边坡临界滑动面的方法可行、高效。     

Parallel viewshed analysis on a PC cluster system using triple-based irregular partition scheme

Using digital elevation models (DEMs), viewshed analysis algorithms determine the visibility of each point on the terrain at a given location in space. As a data-parallel algorithm, real-time viewshed analysis from grid DEM poses a practical challenge to personal computer (PC) users, particularly when dealing with higher resolution and accuracy of large terrain data. Therefore, this paper presents a universal domain decomposition algorithm based on an equal-area strategy for the parallel viewshed analysis on a PC cluster system. The approach uses a scan-line filling method for data partitioning of the irregular bounding polygon of the terrain. The terrain data are divided into sectors of the same area that are connected by the viewpoint and the region vertices, ignoring the null value (or NODATA) points. Furthermore, each sector is assigned to one processor and is organized in the form of triples composed of location and elevation at one point. An index of triples is built to store all of the locations of terminal vertices row-by-row and thus the random access of any point is achieved by using the offsets in each row. Two commonly applied viewshed algorithms, namely, “reference plane” and “Xdraw” algorithms are employed to verify the performance. In addition, two experiments focus on evaluating the efficiency performance and comparing traditional implementation, respectively. Experimental results demonstrate a significant performance improvement compared with the sequential computing method. The memory usage gradually decreases as the number of processors increases. Based on the equal-area decomposition, partitions in terms of sectors can guarantee a suitable load balance. Additional benefits of the proposed solution also include high storage efficiency and program portability.     

基于CUDA的地震相干体并行算法

相干体技术在地震勘探资料解释方面得到了广泛的应用,由于相干体技术处理的对象是三维地震数据体,所以算法运算时间较长。为了缩短解释周期,本文充分发挥GPU并行计算优势,对C3相干体算法进行并行化分析。从硬盘读取数据到GPU上计算相干值并写入硬盘的整个过程进行分析,剔除了冗余数据的读取,完成了C3相干体算法的并行化设计与实现。最后分别对串行算法与并行算法进行性能测试,结果表明本文设计的并行算法在保证精度的前提下达到了16倍左右的加速比,对加快地震资料解释具有重要意义。     

A consistent algorithm for quasigeostrophic energy and energy flux analysis

The energy flux vector is familiar to geophysical fluid dynamics, but only in the abstract. Equations for computing the energy balance and the energy flux vector (S) for a quasigeostrophic numerical ocean model are provided in both analytic and finite difference form. The multilayer model includes wind, lateral and bottom friction, and bathymetry. The finite difference approximation to the analytic energy balance is consistent with the finite difference approximation to the quasigeostrophic potential vorticity equation. An application of the algorithms to a simple steady ocean gyre illustrates their use. This choice of the flux vector (from an infinity of possibilities) has several advantages: it is computationally convenient; it is capable of field measurement; it has nice mathematical properties in the limit of small amplitude motion; and it facilitates intuition about the dynamics.     

Development and application of a master-slave parallel hybrid multi-objective evolutionary algorithm for groundwater remediation design

Two primary goals of a multi-objective evolutionary algorithm (MOEA) for solving multi-objective optimization problems are to find as many nondominated solutions as possible toward the true Pareto front and to maintain diversity of Pareto-optimal solutions along the tradeoff curves. However, few MOEAs can achieve these two goals concurrently. This study presents a new hybrid MOEA, the niched Pareto tabu search combined with a genetic algorithm (NPTSGA), in which the global search ability of niched Pareto tabu search (NPTS) is improved by the diversification of candidate solutions that arose from the evolving population of nondominated sorting genetic algorithm-II (NSGA-II). The NPTSGA coupled with a flow and transport model is developed for multi-objective optimal design of groundwater remediation systems. The proposed methodology is then applied to a large field-scale groundwater remediation system for cleanup of large trichloroethylene plume at the Massachusetts Military Reservation in Cape Cod, Massachusetts. Furthermore, a master-slave (MS) parallelization scheme based on the Message Passing Interface is incorporated into the NPTSGA to implement objective function evaluations in a distributed processor environment, which can greatly improve the efficiency of the NPTSGA in finding Pareto-optimal solutions to the real-world applications. This study shows that the MS parallel NPTSGA in comparison with the original NPTS and NSGA-II can balance the tradeoff between the diversity and optimality of solutions during the search process and is an efficient and effective tool for optimizing the multi-objective design of groundwater remediation systems under complicated hydrogeologic conditions.     

并行遗传算法对硅藻软岩本构关系的求解

利用并行遗传算法,基于不同条件下软岩三轴压缩实验的实验数据,对正常固结领域和超固结领域硅藻软岩的本构关系进行了拟合,建立了一种新的考虑时间效应的应力-应变-时间本构模型。预测结果分析表明,所建模型很好地反映了硅藻软岩的本构关系,从而验证了该模型并行遗传算法解的合理性和可行性。研究成果在地下空间的利用和开发中具有良好的应用前景,对介于岩石和土之间复杂软岩材料力学特性研究的进一步发展具有重要的参考价值。     

A coupled time integration algorithm for discontinuous deformation analysis using the numerical manifold method

To improve the computational efficiency of the numerical manifold method for discontinuous deformation simulations, a spatial-domain coupled explicit-implicit time integration algorithm is proposed. A subdomain partition algorithm based on a super manifold element is developed for the numerical manifold method to simulate dynamic motions of blocky rock mass. In different subdomains, explicit or implicit time integration method is employed respectively based on its contact and motion status. These subdomains interact through assembling the corresponding explicit or implicit time integration-based matrices of different rock blocks. The computational efficiency of the discontinuity system under dynamic loading is improved by partially diagonalizing the global matrices. Two verification examples of a sliding block along an inclined plane under a horizontal acceleration excitation and a multiblock system acted on by dynamic forces are studied to examine the accuracy of the proposed numerical method, respectively. A highly fractured rock mass situated on an inclined slope subjected to seismic excitations is then studied to show the computational efficiency of the developed algorithm. The simulated results are in good agreement with those from the versions using purely implicit or explicit time integration algorithm for the numerical manifold method. The computational efficiency is shown to be higher using the proposed algorithm, which demonstrates its potential for application in dynamic analysis of highly fractured rock masses.     

A GPU parallel computing strategy for the material point method

The material point method (MPM), which is a combination of the finite element and meshfree methods, suffers from significant computational workload due to the fine mesh that is required in spite of its advantages in simulating large deformations. This paper presents a parallel computing strategy for the MPM on the graphics processing unit (GPU) to boost the method’s computational efficiency. The interaction between a structural element and soil is investigated to validate the applicability of the parallelisation strategy. Two techniques are developed to parallelise the interpolation from soil particles to nodes to avoid a data race; the technique that is based on workload parallelisation across threads over the nodes has a higher computational efficiency. Benchmark problems of surface footing penetration and a submarine landslide are analysed to quantify the speedup of GPU parallel computing over sequential simulations on the central processing unit. The maximum speedup with the GPU used is ∼30 for single-precision calculations and decreases to ∼20 for double-precision calculations.     

一种基于数值应力场的强度各向异性边坡稳定性分析方法

提出了一种基于数值应力场下的边坡临界滑动面和临界坡高的分析方法。该分析方法首先利用有限元得到边坡内部较为精确的应力场,再通过在边坡内部模拟类似于链式反应过程中粒子产生和运动规律,在此基础上完成临界滑动面的搜索。主要结论如下：（1）提出了一种基于数值应力场的边坡临界滑动面的搜索方法,该方法可在不对边坡滑动面形状和位置进行干预的情况下完成潜在破坏路径的搜索。（2）通过对算法中区域与边界、激发源、产物扩散路径、路径权值4方面要素进行合理控制,可使算法在具有较高精度的同时又能保证较好的分析效率。（3）算法能较为方便地考虑真实应力条件下地层强度各向异性对边坡稳定性的影响,并能对临界坡高进行很好的分析。（4）通过具体算例对本文算法的计算结果进行验证,将所得结果与PSO和Monte Carlo两种方法得到结果进行对比,对本文方法的可靠性进行了验证,取得了较好的效果。     

边坡稳定性分析改进的径向移动算法研究

边坡非圆弧临界滑动面搜索是边坡稳定性计算中的一个关键问题,其实质是找到一条安全系数最小的滑动路径。采用新的全局最优化算法--径向移动优化算法搜索路径相对其他算法具有快速、存储空间小、计算简单等优势,但却存在搜索结果不稳定的现象,为克服这个问题,对其数据结构进行调整,提出了改进的径向移动算法,使路径搜索趋于稳定。搜索到的滑动面路径对应的安全系数采用不平衡推力法进行计算,在可行性分析的基础上,采用二分法对安全系数快速、精确地求解。通过一个水库岸坡的算例计算,验证了改进的径向移动算法用于非圆弧临界滑动面搜索的有效性。又通过分析对比改进的径向移动优化算法和粒子群算法的搜索结果,展示了改进的径向移动算法快速收敛,稳定性高的显著优势。     

A parallel ensemble-based framework for reservoir history matching and uncertainty characterization

We present a parallel framework for history matching and uncertainty characterization based on the Kalman filter update equation for the application of reservoir simulation. The main advantages of ensemble-based data assimilation methods are that they can handle large-scale numerical models with a high degree of nonlinearity and large amount of data, making them perfectly suited for coupling with a reservoir simulator. However, the sequential implementation is computationally expensive as the methods require relatively high number of reservoir simulation runs. Therefore, the main focus of this work is to develop a parallel data assimilation framework with minimum changes into the reservoir simulator source code. In this framework, multiple concurrent realizations are computed on several partitions of a parallel machine. These realizations are further subdivided among different processors, and communication is performed at data assimilation times. Although this parallel framework is general and can be used for different ensemble techniques, we discuss the methodology and compare results of two algorithms, the ensemble Kalman filter (EnKF) and the ensemble smoother (ES). Computational results show that the absolute runtime is greatly reduced using a parallel implementation versus a serial one. In particular, a parallel efficiency of about 35 % is obtained for the EnKF, and an efficiency of more than 50 % is obtained for the ES.     

边坡稳定可靠度分析的并行随机有限元方法

将Monte-Carlo随机方法与并行有限元方法结合,设计了基于PC机群的并行随机有限元算法,每一次随机模拟产生一个随机场,作为一个样本,代入有限元进行稳定性计算,发挥并行有限元计算量大、计算速度快的特点,克服了Monte-Carlo方法计算时间长的缺点。用C++语言结合MPI消息传递接口开发了相应的计算软件,计算了1 000个随机样本的边坡可靠度问题,验证了程序的可靠性及高效性。     

地质戴帽中的图形裁剪算法

地质戴帽根据地表地质构造特征绘制与地震剖面连为一体的岩性剖面,可极大提高解释精度。但目前该项技术一直沿用传统的手工绘制,效率低、图形质量不高。这里提出将多边形线裁剪算法应用在地质戴帽的绘图中：首先对地质戴帽的采集数据分类,构成任意多边形和线段并实现线裁剪,在此基础上,将裁剪之后的线段和原多边形成块,构成新的封闭块区,然后针对不同地质属性块填充相应岩性符号,准确高效的实现了地质戴帽绘图。     

A new cluster algorithm for orientation data

An algorithm to classify data points on the sphere in distinct cluster groups is defined. The characteristics of the cluster groups and the rule for assigning data to the groups are related to a continuous differentiable density estimation. The modes of the estimated density are assumed to be representative of the groups; data points are then assigned to the mode reached by the steepest ascent. The major advantage of this procedure is its sensitivity in detecting cluster groups independently of their geometry and configuration. As a consequence, the procedure is capable of handling orientation data that may be arranged in girdles.     

基于GPU的并行条件模拟算法及其在储量估算中的应用

条件模拟是一种计算非常耗时的高精度三维插值算法。针对串行条件模拟算法计算时间过长的问题,提出基于GPU的并行条件模拟算法,并进行储量估算。对条件模拟算法进行并行分析,利用GPU的高度并行性,构建CUDA通用计算开发环境,实现串行条件模拟算法到并行条件模拟算法的转换,使条件模拟算法的时间复杂度从O(n)降至O(logn)。并对西藏甲玛铜矿进行了储量估算。实验结果表明,在安装普通NVIDIA显卡的计算机以及估算精度不下降的情况下,GPU并行条件模拟的计算效率比CPU串行条件模拟的计算效率提高了60倍以上。     

A parallel block preconditioner for large-scale poroelasticity with highly heterogeneous material parameters

Large-scale simulations of coupled flow in deformable porous media require iterative methods for solving the systems of linear algebraic equations. Construction of efficient iterative methods is particularly challenging in problems with large jumps in material properties, which is often the case in realistic geological applications, such as basin evolution at regional scales. The success of iterative methods for such problems depends strongly on finding effective preconditioners with good parallel scaling properties, which is the topic of the present paper. We present a parallel preconditioner for Biot’s equations of coupled elasticity and fluid flow in porous media. The preconditioner is based on an approximation of the exact inverse of the two-by-two block system arising from a finite element discretisation. The approximation relies on a highly scalable approximation of the global Schur complement of the coefficient matrix, combined with generally available state-of-the-art multilevel preconditioners for the individual blocks. This preconditioner is shown to be robust on problems with highly heterogeneous material parameters. We investigate the weak and strong parallel scaling of this preconditioner on up to 512 processors and demonstrate its ability on a realistic basin-scale problem in poroelasticity with over eight million tetrahedral elements.     

A mesh deformation algorithm for free surface problems

Employing the simple iterative technique of adjusting the element positions using computed potentials to locate the free surface can lead to finite elements with large aspect ratios as the free surface drops towards the base of the mesh. In particular, free surface modelling of earth dams with base drains suffer from this problem. The paper suggests a number of steps which can be taken to alleviate mesh distortion problems and improve the numerical stability of the iterative finite element analysis. This leads to a mesh deformation algorithm which adjusts element widths in a simple fashion depending on the free surface height as the iterations proceed. The algorithm is specialized to the sloped earth dam problem, but may find application to other geometries. © 1997 by John Wiley & Sons, Ltd.     

A two-phase algorithm for point-feature cartographic label placement

Point-feature cartographic label placement (PFCLP) involves placing labels adjacent to their corresponding point features on a map. A widely accepted goal of PFCLP is to maximize the number of conflict-free labels. This paper presents an algorithm for PFCLP based on the four-slider (4S) model. The algorithm is composed of two phases: an initialization phase during which an initial solution is constructed by an exact algorithm and a heuristic method to maximize the probability of conflict-free labels. The initialization phase is followed by an improvement phase that adopts a backtracking greedy search. The exact algorithm can find a portion of the conflict-free labels in an optimal solution and an extension of the exact algorithm is provided that can find additional conflict-free labels. Computational tests were performed for instances based on standard sets. The two-phase algorithm generated better solutions relative to all methods previously reported in the literature. It also executes at a reasonable speed and is more stable than most other methods.     

Image analysis algorithm for detection and measurement of Martian sand grains

Image analysis methods are commonly employed to determine the size and shape of particles. Although commercial and non-commercial tools enable detection and measurement of grains from images, they do not provide good results in the case of images acquired during extensive in situ Martian investigations. Within the confines of the Mars Exploration Rover (MER) mission and the Mars Science Laboratory (MSL) mission thousands of images of sand grains were captured, and hitherto, they are the only source of ground-truth data on Martian sand particles. Therefore, a new approach is proposed to analyze such images. The semi-automatic algorithm allows fast detection and measurement of the size and shape of Martian grains from images obtained by the Microscopic Imager (MI) and the Mars Hand Lens Imager (MAHLI). The method was evaluated on 76 images of terrestrial and Martian deposits. The results for the terrestrial samples were compared to those from sieve analysis, as well as with ImageJ and Malvern Morphologi G3 systems. The method provides similar results to those from the other methods. It does not have any limitation on the size of grains, and permits separation of touching particles.     

A mathematical programming approach for scheduling equipment in a surface coal mining operation

Summary A mathematical programming model for scheduling open pit mining was developed and validated using data from a surface mining operation. A two-phase solution procedure was used involving repeated evaluations of an integer scheduling model and a simple transportation model.