共查询到20条相似文献，搜索用时 125 毫秒
1.
2.
条件模拟是一种计算非常耗时的高精度三维插值算法。针对串行条件模拟算法计算时间过长的问题,提出基于GPU的并行条件模拟算法,并进行储量估算。对条件模拟算法进行并行分析,利用GPU的高度并行性,构建CUDA通用计算开发环境,实现串行条件模拟算法到并行条件模拟算法的转换,使条件模拟算法的时间复杂度从O(n)降至O(logn)。并对西藏甲玛铜矿进行了储量估算。实验结果表明,在安装普通NVIDIA显卡的计算机以及估算精度不下降的情况下,GPU并行条件模拟的计算效率比CPU串行条件模拟的计算效率提高了60倍以上。 相似文献
3.
《物探化探计算技术》2017,(2)
针对航空瞬变电磁法正演算法结构与GPU的并行性运算相结合,推导出了航空瞬变电磁法一维正演公式,在2007年NVIDIA公司推出的CUDA平台上实现了一维正演算法在GPU上的调用。为验证CUDA C语言程序的正确性,设计了几个模型,并与C代码模拟的响应做了对比,结果表明,基于GPU的CUDA C代码所编的程序在航空瞬变电磁法的模拟中拥有明显优势,速度提高非常明显,在复杂的地球物理学模型计算和反演中,拥有巨大的发展潜力。 相似文献
4.
分布式水文模型对流域水文过程的应用深度及广度不断加深,常与数值天气及气候预报相结合,面临巨大的计算量。近年来GPU技术的进步使普通电脑能够实现高效而又廉价的并行计算。提出了资料插值、单元产流以及单元汇流采用GPU并行计算,马斯京根法河道汇流采用一种非并行的递归方法。基于笔记本电脑和NVIDIA GPU/CUDA结合C#语言,由分布式新安江模型在沂河流域的模拟应用表明,降水量空间插值及新安江产流的并行执行效率为普通CPU上C#的8~9倍。使用直接递归法实现马斯京根汇流演算比以往采用汇流次序表的执行效率提升0.5~0.9倍。 相似文献
5.
《岩土力学》2017,(7):2103-2112
针对非连续变形分析中开合迭代难以收敛的难题,基于块体接触约束状态和块体位移之间的关系,提出了基于逼近阶跃函数和拉格朗日插值的改进DDA方法。采用双曲正切函数来逼近阶跃函数,利用阶跃函数将块体接触约束状态用块体位移来表达,以此来替代开合迭代,避免了开合迭代难以收敛的难题。利用拉格朗日插值原理,推导得到只含有块体位移为未知量的块体系统势能函数,并利用变尺度法来求解总体势能函数的极值以得到块体位移。分别结合滑块模型和地下洞室模型,分析了改进DDA方法的计算精度和计算速度,验证了文中提出的改进DDA方法的正确性和稳定性。研究表明:基于逼近阶跃函数和拉格朗日插值的改进DDA方法具有较高的精度,且相比较传统DDA方法而言,具有更为稳定的和更为强健的计算收敛性。因此,基于逼近阶跃函数和拉格朗日插值的改进DDA方法是一种稳定有效的数值计算方法,为解决非连续变形中开合迭代难以收敛的问题提供了新思路。 相似文献
6.
2.5D有限元方法在铁路路基动力响应研究领域中的应用渐趋广泛。针对其在求解随机不平顺条件下路基动力响应时计算效率显著下降的问题,构建了基于二维降阶Hermite插值的2.5D有限元路基动力响应快速计算框架。以路基在频率-波数域动力响应的基本特征为依据确定了插值原则,讨论了插值点分布和数量对插值精度的影响。研究表明：采用二维降阶Hermite插值方法可以实现随机不平顺条件下路基动力响应的快速计算。相比插值点非均匀分布,插值点均匀分布可以兼顾幅值和相位的插值精度,适应性更好。此外,该方法的计算效率仅与插值点数量相关,不受随机不平顺谐波数量的影响,在模拟随机不平顺条件下路基动力响应方面具备显著的优势。 相似文献
7.
8.
旅行时射线追踪的精度和效率一直是影响地震层析成像质量和效果的关键因素。这里在三维近地表速度结构层析成像应用中,结合旅行时插值算法与最短路径算法,提出了一种三维初至波射线追踪算法。通过对双线性旅行时插值算法进行改进,并运用判定条件与简化插值计算公式进行快速计算,减少了插值次数,降低了运算量,同时也保证了较高的射线精度,有效地解决了三维射线追踪算法的计算低效率,射线精度不高的问题。 相似文献
9.
介绍了国内、外张量测量技术及数据处理技术的发展情况。把离散余弦变换与有限单元方法结合起来,进行重力张量的正演计算。首先,利用有限单元法求解重力场的一阶导数,然后利用离散余弦变换求解重力张量分量。这样既保留了有限单元法对复杂模型的正演优势,又避免了利用有限元法直接求解重力张量时,因多次插值引起的数据量过大的问题。模型试验证明,用基于DCT的有限元法进行重力张量的正演,不但具有很高的计算精度,而且相对于利用有限单元法直接正演,其计算速度得到了显著的提高。 相似文献
10.
混合像元分解是遥感技术向定量化、精细化发展的重要技术,是关系到地物精细分类的重要操作环节,而线性光谱模型确实是目前解决混合像元问题的有效策略.针对高光谱遥感影像数据量大,混合像元分解计算耗时长的问题,提出了一种基于CUDA的高光谱遥感端元投影向量法实现方法.在分析高光谱图像端元投影向量法串行算法的基础上,建立了在CUDA架构下以像元点为基准产生相应的进程数,每个进程负责一单位像元点的计算方式.实验结果表明,将该方法应用于实际的高光谱遥感影像的混合像元中,可极大地提高传统中央处理器(CPU)的运算效率. 相似文献
11.
高光谱遥感数据具有波段多、数据量大、处理复杂等特点, 基于GPU的高性能计算在遥感领域得到了快速发展, 为高光谱数据的快速处理提供了硬件和技术条件。采用GPU对高光谱遥感数据常用的SAM、PPI等处理算法进行应用实验, 验证基于GPU的高光谱遥感数据快速处理技术。实验采用新疆东天山地区的一景星载Hyperion数据, 利用支持IDL开发语言的GPULib、CUDA运行时API库进行算法效率的验证, 结果表明, 基于GPU的高光谱数据处理效率比常规的多核CPU主机处理效率有较大提升, 具有一定的应用推广价值。 相似文献
12.
根据随钻测录井实时地质导向和大斜度、水平井评价成图技术需求，针对传统绘图方法存在的弊端，提出了将测录井信息、井眼轨迹和地质模型进行二维分解的实时绘图方法。针对二维分解绘图方法绘图时空复杂度较高的问题，给出了不同事件驱动下的局部实时计算和拷屏重绘算法，控制了对CPU和内存的消耗、提高了绘图效率，消除了实时绘图的闪烁和卡顿现象。应用实例表明，二维分解实时绘图方法能够实现大尺度随钻测录井地质导向图形的流畅、无卡顿实时绘图，可提高大斜度、水平井储层模型评价的刻画精度和时效。 相似文献
13.
为了进一步提高叠前时间体偏移的计算效率,实现了在GPU＼CPU协同并行计算模式下Kirchhoff叠前时间体偏移技术,并进行优化。经在Nvida Tesla C1060GPU上的测试表明,GPU（Graphic Processing Unit）的处理速度是CPU（单核）的四十倍左右。同时表明,CUDA（Cornpute Unified Device Architectarc）编程为CPU向GPU的转化提供了一个较为方便的语言环境。 相似文献
14.
We study and compare five different combinations of finite element spaces for approximating the coupled flow and solid deformation system, so-called Biot’s equations. The permeability and porosity fields are heterogeneous and depend on solid displacement and fluid pressure. We provide detailed comparisons among the continuous Galerkin, discontinuous Galerkin, enriched Galerkin, and two types of mixed finite element methods. Several advantages and disadvantages for each of the above techniques are investigated by comparing local mass conservation properties, the accuracy of the flux approximation, number of degrees of freedom (DOF), and wall and CPU times. Three-field formulation methods with fluid velocity as an additional primary variable generally require a larger number of DOF, longer wall and CPU times, and a greater number of iterations in the linear solver in order to converge. The two-field formulation, a combination of continuous and enriched Galerkin function space, requires the fewest DOF among the methods that conserve local mass. Moreover, our results illustrate that three out of the five methods conserve local mass and produce similar flux approximations when conductivity alteration is included. These comparisons of the key performance indicators of different combinations of finite element methods can be utilized to choose the preferred method based on the required accuracy and the available computational resources.
相似文献15.
16.
Magnolia Mamaghani Guillaume Enchéry Claire Chainais-Hillairet 《Computational Geosciences》2011,15(1):17-34
Steam-assisted gravity drainage (SAGD) is an enhanced oil recovery process for heavy oils and bitumens. Numerical simulations of this thermal process allow us to estimate the retrievable volume of oil and to evaluate the benefits of the project. As there exists a thin flow interface (compared to the reservoir dimensions), SAGD simulations are sensitive to the grid size. Thus, to obtain precise forecasts of oil production, very small-sized cells have to be used, which leads to prohibitive CPU times. To reduce these computation times, one can use an adaptive mesh refinement technique, which will only refine the grid in the interface area and use coarser cells outside. To this end, in this work, we introduce new refinement criteria, which are based on the work achieved in Kröner and Ohlberger (Math Comput 69(229):25–39, 2000) on a posteriori error estimators for finite volume schemes for hyperbolic equations. Through numerical experiments, we show that they enable us to decrease in a significant way the number of cells (and then CPU times) while maintaining a good accuracy in the results. 相似文献
17.
Soil–structure interaction problems are commonly encountered in engineering practice, and the resulting linear systems of equations are difficult to solve due to the significant material stiffness contrast. In this study, a novel partitioned block preconditioner in conjunction with the Krylov subspace iterative method symmetric quasiminimal residual is proposed to solve such linear equations. The performance of these investigated preconditioners is evaluated and compared on both the CPU architecture and the hybrid CPU–graphics processing units (GPU) computing environment. On the hybrid CPU–GPU computing platform, the capability of GPU in parallel implementation and high-intensity floating point operations is exploited to accelerate the iterative solutions, and particular attention is paid to the matrix–vector multiplications involved in the iterative process. Based on a pile-group foundation example and a tunneling example, numerical results show that the partitioned block preconditioners investigated are very efficient for the soil–structure interaction problems. However, their comparative performances may apparently depend on the computer architecture. When the CPU computer architecture is used, the novel partitioned block symmetric successive over-relaxation preconditioner appears to be the most efficient, but when the hybrid CPU–GPU computer architecture is adopted, it is shown that the inexact block diagonal preconditioners embedded with simple diagonal approximation to the soil block outperform the others. 相似文献
18.
A stationary specification of anisotropy does not always capture the complexities of a geologic site. In this situation, the
anisotropy can be varied locally. Directions of continuity and the range of the variogram can change depending on location
within the domain being modeled. Kriging equations have been developed to use a local anisotropy specification within kriging
neighborhoods; however, this approach does not account for variation in anisotropy within the kriging neighborhood. This paper
presents an algorithm to determine the optimum path between points that results in the highest covariance in the presence
of locally varying anisotropy. Using optimum paths increases covariance, results in lower estimation variance and leads to
results that reflect important curvilinear structures. Although CPU intensive, the complex curvilinear structures of the kriged
maps are important for process evaluation. Examples highlight the ability of this methodology to reproduce complex features
that could not be generated with traditional kriging. 相似文献
19.
Multiple-point statistics are widely used for the simulation of categorical variables because the method allows for integrating a conceptual model via a training image and then simulating complex heterogeneous fields. The multiple-point statistics inferred from the training image can be stored in several ways. The tree structure used in classical implementations has the advantage of being efficient in terms of CPU time, but is very RAM demanding and then implies limitations on the size of the template, which serves to make a proper reproduction of complex structures difficult. Another technique consists in storing the multiple-point statistics in lists. This alternative requires much less memory and allows for a straightforward parallel algorithm. Nevertheless, the list structure does not benefit from the shortcuts given by the branches of the tree for retrieving the multiple-point statistics. Hence, a serial algorithm based on list structure is generally slower than a tree-based algorithm. In this paper, a new approach using both list and tree structures is proposed. The idea is to index the lists by trees of reduced size: the leaves of the tree correspond to distinct sublists that constitute a partition of the entire list. The size of the indexing tree can be controlled, and then the resulting algorithm keeps memory requirements low while efficiency in terms of CPU time is significantly improved. Moreover, this new method benefits from the parallelization of the list approach. 相似文献
20.
基于EBE方法的三维有限元并行计算 总被引：4，自引：1，他引：4
在水利工程中,施工过程的模拟、动力的时域分析、开裂计算等,都对大规模并行计算提出了迫切的需求。然而,基于高斯消去的有限元直接解法,通常会占用大量的内存,并花费大量的CPU时间。而水利工程中的问题多为大带宽问题,这些问题更为突出。基于EBE-PCG方法的有限元方法,可以避免形成整体刚度矩阵,进而,显著减少内存的需求。而且,这种方法可以有效地并行实现,为大规模数值计算提供了可能。采用基于EBE策略的Jacobi预处理共轭梯度法,编制了有限元计算程序,并成功应用于溪洛渡、锦屏等工程的大规模数值分析。结果表明,对水利工程中的大带宽问题,该方法是一种很有效的并行计算方法。 相似文献