首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到15条相似文献,搜索用时 187 毫秒
1.
付晓东  盛谦  张勇慧 《岩土力学》2014,35(8):2401-2407
非连续变形分析(DDA)方法严格满足平衡要求和能量守恒,具有完全的运动学及数值可靠性,但对大规模岩土工程问题的数值模拟耗时太长,尤其是线性方程组求解,并行计算可以很好地解决该问题。首先基于DDA方法的基本理论,阐述了适用于DDA方法中的基于块的行压缩法和基于“试验-误差”迭代格式的非零位置记录;其次,引入块雅可比迭代法并行求解DDA方法的线性方程组,并改进了相应的非零存储方法;最后,基于OpenMP实现了DDA线性方程组求解并行计算,并将其应用于地下洞室群的破坏过程分析,以加速比为并行效率的指标评价,结果表明,该并行计算策略可以极大提高DDA的计算效率,而且适合各种规模的问题。  相似文献   

2.
赵强  焦玉勇  张秀丽  谢壁婷  王龙  黄刚海 《岩土力学》2019,40(11):4515-4522
非连续变形分析方法(DDA)是一种平行于有限元法的新型数值计算方法,该方法基于最小势能原理,把每个离散块体的变形、运动和块体之间的接触统一到平衡方程中进行隐式求解。然而,传统DDA方法在计算过程中需组装整体刚度矩阵并联立求解方程组,在用于大型岩土工程问题的三维数值模拟时占用内存较大、耗时较长、计算效率极低。因此,提出一种基于显式时间积分的三维球颗粒DDA方法。该方法在求解过程中不需要组装整体刚度矩阵,在求解加速度时,由于质量矩阵为对角矩阵,可存储为一维向量占用内存较少,且可分块逐自由度求解,效率较高,在接触判断上采用最大位移准则简化了接触算法,采用较小的时步,保证了计算的精确性;通过几个典型算例验证了该方法的准确性及计算效率。  相似文献   

3.
陈曦  刘建坤  李旭  田亚护  王英男 《岩土力学》2013,34(Z2):272-277
岩土工程建设的发展极大地促进了三维数值模拟的应用。大规模三维有限元计算需要求解一系列大型线性方程组,这些线性方程组的求解直接影响着整个有限元计算的效率。复杂岩土工程问题通常涉及多相和多体耦合相互作用,各相之间或不同固体材料之间性质差别显著,可能导致Krylov子空间迭代法收敛缓慢,甚至求解失败。为了提高Krylov子空间迭代法的求解效率和可靠性,提出一种新的高效预处理技术,通过算例验证了所提出的分区块迭代预处理方法的有效性。  相似文献   

4.
有限元水流计算中内存和运行效率初探   总被引:1,自引:0,他引:1       下载免费PDF全文
周杰  汪德爟 《水科学进展》2004,15(5):593-597
有限元在非恒定流计算中耗内存大、耗机时多的问题一直困扰着工程师,限制了有限元的应用.采用分步有限元方法离散二维浅水方程,并初步探索了行指标矩阵压缩存储稀疏矩阵的方法和效率以及预条件双共扼梯度法在求解有限元方法中形成的大型线性方程组中的效率,取得了满意的结果.在一定程度上缓解了有限元在非恒定流计算中存在的耗内存大、耗时多的问题.  相似文献   

5.
王晓睿  张振  贾晓风 《地球科学》2015,40(12):2119-2124
随着岩土工程规模的不断扩大、复杂性的增加以及计算参数的多样化和计算精度的提高, 人们对于计算机计算能力的要求越来越高, 然而单处理器无法满足这类大规模计算.从数据输入、区域分解、线性方程组的迭代求解、后处理等方面详细阐述高性能计算平台上并行有限元求解大规模岩土工程的关键问题.提出了利用MPI2的新特性进行海量数据的分段并行读入, 采用ParMetis软件并行地进行区域分解, 实现了前处理过程的完全并行化; 采用基于Jacobi预处理技术的预处理共轭梯度法(PCG)进行线性方程组的并行迭代求解; 采用Paraview软件实现了后处理的并行可视化.在深腾7000系统上对某隧道工程的三维开挖过程进行了数值模拟, 对其并行性能进行了分析和评价, 验证了采用的区域分解算法和系统方程组的求解方法的可行性, 并且具有较高的加速比和并行效率.   相似文献   

6.
李小凯  郑宏 《岩土力学》2014,35(6):1787-1794
非连续变形分析(DDA)方法是一种新的用来分析块体系统运动和变形的非连续介质数值计算方法。研究的核心工作是致力于对现有DDA接触问题处理方法的改进。DDA主要采用罚函数法和Lagrange乘子法处理接触问题,合理设定罚参数很困难,此外,因开闭迭代而引起的刚度矩阵的不连续变化也会导致收敛方面的困难。为避免引入罚参数及传统意义上的开闭迭代,用混合线性互补模型(LCDDA)对DDA方法进行了重新描述。在此基础上,综合基于非光滑分析的Newton法的局部平方收敛和最速下降法的全局线性收敛的优势,提出求解LCDDA模型的有效算法。根据上述思想及理论研究成果编制了完整的计算程序,算例计算结果证明了方法的精度及可行性。  相似文献   

7.
朱帅润  吴礼舟 《岩土力学》2022,43(3):697-707
Richards方程常用于非饱和土渗流问题,并且应用广泛。在数值求解中,对Richards方程线性化,进而采用有限差分法进行数值离散以及迭代计算。其中传统的迭代法比如Jacobi迭代、Gauss-Seidel迭代法(GS)和连续超松驰迭代法(successive over-relaxation method,简称SOR)迭代收敛率较慢,尤其在离散空间步长较小以及离散时间步长较大时。因此,采用整体校正法以及多步预处理法对传统迭代法进行改进,提出一种基于整体校正法的多步预处理Gauss-Seidel迭代法(improved Gauss-Seidel iterative method with multistep preconditioner based on the integral correction method,简称ICMP(m)-GS)求解Richards方程导出的线性方程组。通过非饱和渗流算例,并与传统迭代法和解析解对比,对改进算法的收敛率和加速效果进行了验证。结果表明,提出的ICMP(m)-GS可以很大程度地改善线性方程组的病态性,相较于常规方法GS,SOR以及单一改进方法,ICMP(m)-GS具有更快的收敛率,更高的计算效率和计算精度。该方法可以为非饱和土渗流的数值模拟提供一定参考。  相似文献   

8.
在地球物理电磁勘探领域有限元数值模拟中,最后都会得到一个大型稀疏的复系数线性方程组,受计算机内存空间的限制,必须根据有限元刚度矩阵的稀疏性对其进行压缩存储。由于电磁场有限元计算的自由度大都在三个以上,因而提出了适合多自由度的块按行压缩稀疏存储方案,并通过存储格式的转换,把块按行压缩方式转换成流行的,大型稀疏矩阵的行压缩存储格式,以便于求解。用求解大型稀疏方程组的Krylov子空间方法中的稳定双共轭梯度(Bicgstab)方法,收敛速度快,精度高,而且稳定性好,结合ilu预处理技术,可以大大提高求解大型稀疏方程组的效率。  相似文献   

9.
《岩土力学》2017,(6):1746-1761
由石根华提出的非连续变形分析(DDA)方法理论严密且计算较为高效,在模拟块体滑移、转动和张开等大变形、大位移问题方面具备独特优势,因而在岩土工程领域得到了广泛运用。然而DDA方法在提出初期不可避免地存在一些精度问题,对此石根华及国内外学者就问题产生原因和改进方法开展了大量研究工作。基于部分相关成果的研究学习,对改进原始DDA计算精度的各类方法进行归纳探讨,主要包括:(1)DDA块体内部应力位移场的精度控制;(2)块体接触问题处理方法的改进;(3)人为参数的合理选取;(4)能量耗散机制的考虑;(5)人工边界的改进等方面。对以上方法的改进效果和计算效率进行了简要分析和讨论,在此基础上对DDA的研究热点和发展趋势进行了概述,为该方法的进一步发展和完善提供思路。  相似文献   

10.
复杂河网水动力数值模型   总被引:1,自引:1,他引:0       下载免费PDF全文
利用汊点水位预测-校正(junction-point water stage prediction and correction,JPWSPC)法处理缓流河网汊点处的回流效应,采用Preissmann格式离散Saint-Venant方程组,并采用Newton-Raphson方法求解非线性离散方程,构建了非恒定河网水动力模型.模型既无需特殊的河道编码,又避免了建立和求解总体矩阵.与常用的分级解法模型相比,保留了其既适用于树状又适用于环状河网的优点,同时克服了分级解法需要建立和求解河网总体矩阵的缺点,显著提高了稳定性和计算效率.  相似文献   

11.
Large‐scale engineering computing using the discontinuous deformation analysis (DDA) method is time‐consuming, which hinders the application of the DDA method. The simulation result of a typical numerical example indicates that the linear equation solver is a key factor that affects the efficiency of the DDA method. In this paper, highly efficient algorithms for solving linear equations are investigated, and two modifications of the DDA programme are presented. The first modification is a linear equation solver with high efficiency. The block Jacobi (BJ) iterative method and the block conjugate gradient with Jacobi pre‐processing (Jacobi‐PCG) iterative method are introduced, and the key operations are detailed, including the matrix‐vector product and the diagonal matrix inversion. Another modification consists of a parallel linear equation solver, which is separately constructed based on the multi‐thread and CPU‐GPU heterogeneous platforms with OpenMP and CUDA, respectively. The simulation results from several numerical examples using the modified DDA programme demonstrate that the Jacobi‐PCG is a better iterative method for large‐scale engineering computing and that adoptive parallel strategies can greatly enhance computational efficiency. Copyright © 2015 John Wiley & Sons, Ltd.  相似文献   

12.
The efficiency of solving equations plays an important role in implicit-scheme discontinuous deformation analysis (DDA). A systematic investigation of six iterative methods, namely, symmetric successive over relaxation (SSOR), Jacobi (J), conjugate gradient (CG), and three preconditioned CG methods (ie, J-PCG, block J-PCG [BJ-PCG], and SSOR-PCG), for solving equations in three-dimensional sphere DDA (SDDA) is conducted in this paper. Firstly, simultaneous equations of the SDDA and iterative formats of the six solvers are presented. Secondly, serial and OpenMP-based parallel computing numerical tests are done on a 16-core PC, the result of which shows that (a) for serial computing, the efficiency of the solvers is in this order: SSOR-PCG > BJ-PCG > J-PCG > SSOR>J > CG, while for parallel computing, BJ-PCG is the best solver; and (b) CG is not only the most sensitive to the ill-condition of the equations but also the most time consuming under both serial and parallel computing. Thirdly, to estimate the effects of equation solvers acting on SDDA computations, an application example with 10 000 spheres and 200 000 calculation steps is simulated on this 16-core PC using serial and parallel computing. The result shows that SSOR-PCG is about six times faster than CG for serial computing, while BJ-PCG is about four times faster than CG for parallel computing. On the other hand, the whole computation time using BJ-PCG for parallel computing is 3.37 hours (ie, 0.061 s per step), which is about 36 times faster than CG for serial computing. Finally, some suggestions are given based on this investigation result.  相似文献   

13.
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.  相似文献   

14.
This study explores a new form of Discontinuous Deformation Analysis (DDA) method, which uses mesh free displacement functions instead of linear polynomial ones adopted in the original DDA, hence it can effectively describe complex block displacements and deformations. Moreover, the capability of describing a block’s nonlinear mechanical behaviors, i.e., plasticity and fracture, are developed under classical fracture and increment plasticity mechanics theories. With consideration of computation efficiency and convenience, the Sibson natural neighbor interpolation technique for block plasticity analysis and the enriched Moving Least-Squares (MLS) approximation for block fracture analysis are employed, respectively. Numerical results show the applicability of the proposed mesh free DDA method.  相似文献   

15.
朱爱军  曾祥勇  邓安福 《岩土力学》2009,30(8):2495-2500
数值流形方法是包含流形元、有限元及DDA在内的数值方法体系,建立流形元与DDA块体的接触方程,则可实现流形方法框架下的连续介质和散体系统共同作用模拟。针对填石路堤工程,编制了大型数值计算程序,采用块体随机生成、块体粒径控制及块体自然堆积的方法建立散体系统的DDA模型,对路堤的分层铺设、碾压及工后沉降变形等进行模拟分析。通过算例表明,在数值流形方法框架下,采用流形元与DDA共同作用的方法,可以很好地对同时存在连续变形和散体大变形的体系进行计算分析,其对该类问题的模拟更接近分析对象的实际情况,有助于从根本上揭示分析对象变形的细观机制和规律,并能考察更多因素对工程问题的影响。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号