共查询到17条相似文献，搜索用时 171 毫秒
1.
在地球物理电磁勘探领域有限元数值模拟中,最后都会得到一个大型稀疏的复系数线性方程组,受计算机内存空间的限制,必须根据有限元刚度矩阵的稀疏性对其进行压缩存储。由于电磁场有限元计算的自由度大都在三个以上,因而提出了适合多自由度的块按行压缩稀疏存储方案,并通过存储格式的转换,把块按行压缩方式转换成流行的,大型稀疏矩阵的行压缩存储格式,以便于求解。用求解大型稀疏方程组的Krylov子空间方法中的稳定双共轭梯度（Bicgstab）方法,收敛速度快,精度高,而且稳定性好,结合ilu预处理技术,可以大大提高求解大型稀疏方程组的效率。 相似文献
2.
非连续变形分析(DDA)方法对大规模工程问题的数值模拟耗时太长,其中线性方程组求解耗时可占总计算时间的70%以上,因此,高效的线性方程组解法是重要研究课题。首先,阐述了适用于DDA方法的基于块的行压缩法和基于试验-误差迭代格式的非0位置记录;然后,针对DDA的子矩阵技术,将块雅可比迭代法 (BJ)、预处理的块共轭梯度法 (PCG,包括Jacobi-PCG、SSOR-PCG) 引入DDA方法,重点研究了线性方程组求解过程中的关键运算;最后,通过两个洞室开挖算例,分析了各线性方程组求解算法在DDA中的计算效率。研究表明：与迭代法相比,直解法无法满足大规模工程计算需要;BJ迭代法与块超松弛迭代法(BSOR)的效率差别不大,但明显不如PCG迭代法。因此,建议采用PCG迭代法求解DDA线性方程组,特别是SSOR-PCG值得推广;如果开展并行计算研究,Jacobi-PCG是较好的选择,当刚度矩阵惯性优势明显时,BJ迭代法同样有效。 相似文献
3.
随着岩土工程规模的不断扩大、复杂性的增加以及计算参数的多样化和计算精度的提高, 人们对于计算机计算能力的要求越来越高, 然而单处理器无法满足这类大规模计算.从数据输入、区域分解、线性方程组的迭代求解、后处理等方面详细阐述高性能计算平台上并行有限元求解大规模岩土工程的关键问题.提出了利用MPI2的新特性进行海量数据的分段并行读入, 采用ParMetis软件并行地进行区域分解, 实现了前处理过程的完全并行化; 采用基于Jacobi预处理技术的预处理共轭梯度法(PCG)进行线性方程组的并行迭代求解; 采用Paraview软件实现了后处理的并行可视化.在深腾7000系统上对某隧道工程的三维开挖过程进行了数值模拟, 对其并行性能进行了分析和评价, 验证了采用的区域分解算法和系统方程组的求解方法的可行性, 并且具有较高的加速比和并行效率. 相似文献
4.
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具有更快的收敛率,更高的计算效率和计算精度。该方法可以为非饱和土渗流的数值模拟提供一定参考。 相似文献
5.
为了研究复杂地电模型的航空瞬变电磁法全波形响应特征,需要开发考虑发射波形的三维数值模拟算法。本研究基于非结构四面体网格和位移逆Krylov子空间(Shift-and-Invert Krylov,简称SAI Krylov)方法,采用基于电偶极子离散的场源处理方法模拟场源,在时间域进行计算实现了全波形航空瞬变电磁法矢量有限元三维数值模拟。使用均匀半空间模型在阶跃波、半正弦波、三角波和梯形波激发下的全波形解析解、VTEM实际激发波形的后推欧拉算法计算结果,检验了本研究开发的数值模拟算法的正确性。设计地表起伏异常体模型,计算和分析了航空瞬变电磁响应特征。开发的基于位移逆Krylov子空间的全波形航空瞬变电磁法三维数值模拟算法适合模拟复杂地电模型的响应,具有较高的计算精度。 相似文献
6.
在三维电阻率的正演计算中往往涉及到快速、准确求解大型线性方程纽Ax=b的问题。通过采用有限差分法来构造出求解点电源三维地电场的大型稀疏对称线性方程组。并引入Lanczos迭代技术，构造出三对角阵方程组，然后采用正交分解法进行求解，它是Krylov子空间方法中的一种。与传统迭代算法相比，它占用内存少，收敛速度快且稳定。针对大型稀疏矩阵及MATLAB语言的特点，采用简单记录矩阵的非零元素值及其所在行、列值的方法存储大型稀疏矩阵，可大大节省机器内存，提高运算速度。理论分析和计算实例显示，此算法是地电三维正演计算的有效方法，为下一步的反演计算打好基础。 相似文献
7.
8.
非连续变形分析（DDA）方法严格满足平衡要求和能量守恒,具有完全的运动学及数值可靠性,但对大规模岩土工程问题的数值模拟耗时太长,尤其是线性方程组求解,并行计算可以很好地解决该问题。首先基于DDA方法的基本理论,阐述了适用于DDA方法中的基于块的行压缩法和基于“试验-误差”迭代格式的非零位置记录;其次,引入块雅可比迭代法并行求解DDA方法的线性方程组,并改进了相应的非零存储方法;最后,基于OpenMP实现了DDA线性方程组求解并行计算,并将其应用于地下洞室群的破坏过程分析,以加速比为并行效率的指标评价,结果表明,该并行计算策略可以极大提高DDA的计算效率,而且适合各种规模的问题。 相似文献
9.
基于粗细网格的有限元并行分析方法 总被引：2，自引：0，他引：2
并行计算己成为求解大规模岩土工程问题的一种强大趋势。探讨了粗细网格与预处理共轭梯度法结合的并行有限元算法。从多重网格刚度矩阵推得有效的预处理子。该算法在工作站机群上实现。用地基处理时土体强夯的数值模拟分析进行了数值测试,对其并行性能进行了详细分析。计算结果表明：该算法具有良好的并行加速比和效率,是一种有效的并行算法。 相似文献
10.
大区域地下水模拟的预优并行GMRES(m)算法研究 总被引：1，自引：1，他引：0
大区域研究区由于涉及范围大、水文地质参数复杂多变,一直是进行地下水数值模拟的热点和难点。针对大区域地下水模拟的特点,在MPI环境中对Krylov子空间GMRES(m)算法的并行性进行分析,提出基于区域分解法的并行实现策略,并对不同的预条件子的加速效果进行比较。数值实验结果表明:并行GMRES(m)算法在求解大区域三维地下水模型时可以显著的加快求解速度,且具有较好的可扩展性。另外,Jacobi预条件子与GMRES算法的组合具有更优的加速比和执行效率,是一种求解大型化、复杂化地下水水流问题的可行方案。 相似文献
11.
Clint N. Dawson Héctor Klíe Mary F. Wheeler Carol S. Woodward 《Computational Geosciences》1997,1(3-4):215-249
A new parallel solution technique is developed for the fully implicit three‐dimensional two‐phase flow model. An expandedcell‐centered finite difference scheme which allows for a full permeability tensor is employed for the spatial discretization, and backwardEuler is used for the time discretization. The discrete systems are solved using a novel inexact Newton method that reuses the Krylov information generated by the GMRES linear iterative solver. Fast nonlinear convergence can be achieved by composing inexact Newton steps with quasi‐Newton steps restricted to the underlying Krylov subspace. Furthermore, robustness and efficiency are achieved with a line‐search backtracking globalization strategy for the nonlinear systems and a preconditioner for each coupled linear system to be solved. This inexact Newton method also makes use of forcing terms suggested by Eisenstat and Walker which prevent oversolving of the Jacobian systems. The preconditioner is a new two‐stage method which involves a decoupling strategy plus the separate solutions of both nonwetting‐phase pressure and saturation equations. Numerical results show that these nonlinear and linear solvers are very effective. 相似文献
12.
The repeated solution in time of the linear system arising from the finite element integration of coupled consolidation equations is a major computational effort. This system can be written in either a symmetric or an unsymmetric form, thus calling for the implementation of different preconditioners and Krylov subspace solvers. The present paper aims at investigating when either a symmetric or an unsymmetric approach should be better used. The results from a number of representative numerical experiments indicate that a major role in selecting either form is played by the preconditioner rather than by the Krylov subspace method itself. Two other important issues addressed are the size of the time integration step and the possible lumping of the flow capacity matrix. It appears that ad hoc block constrained preconditioners provide the most robust algorithm independently of the time step size, lumping, and symmetry. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
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.
Preconditioners in computational geomechanics: A survey 总被引：1，自引：0，他引：1
The finite element (FE) solution of geomechanical problems in realistic settings raises a few numerical issues depending on the actual process addressed by the analysis. There are two basic problems where the linear solver efficiency may play a crucial role: 1. fully coupled consolidation and 2. faulted uncoupled consolidation. A class of general solvers becoming increasingly popular relies on the Krylov subspace (or Conjugate Gradient‐like) methods, provided that an efficient preconditioner is available. For both problems mentioned above, the possible preconditioners include the diagonal scaling (DS), the Incomplete LU decomposition (ILU), the mixed constraint preconditioning (MCP) and the multilevel incomplete factorization (MIF). The development and the performance of these algorithms have been the topic of several recent works. The present paper aims at providing a survey of the preconditioners available to date in computational geomechanics. In particular, a review and a critical discussion of DS, ILU, MCP and MIF are given along with some comparative numerical results. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
15.
Joachim Berdal Haga Harald Osnes Hans Petter Langtangen 《Computational Geosciences》2012,16(3):723-734
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. 相似文献
16.
Soil–structure interaction problems are commonly encountered in geotechnical practice and remarkably characterized with significant material stiffness contrast. When solving the soil–structure interaction problems, the employed Krylov subspace iterative method may converge slowly or even fail, indicating that the adopted preconditioning method may not suit for such problems. The inexact block diagonal preconditioners proposed recently have been shown effective for the soil–structure interaction problems; however, they haven't been exploited to full capabilities. By using the same partition strategy according to the structure elements and soil elements, the partitioned block symmetric successive over‐relaxation preconditioners or partitioned block constraint preconditioners are proposed. Based on two pile‐group foundation problems and a tunnel problem, the proposed preconditioners are evaluated and compared with the available preconditioners for the consolidation analysis and the drained analysis, respectively. In spite of one additional solve associated with the structure block and multiplications with off‐diagonal blocks in the preconditioning step, numerical results reveal that the proposed preconditioners obviously possess better performance than the recently developed inexact block preconditioners. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
17.
Finite element discretization of Biot's consolidation equations can produce a symmetric indefinite system (commonly used in geomechanics) or a non‐symmetric system. While this difference appears to be minor, however, it will require the selection of entirely different Krylov subspace solvers with potentially significant impact on solution efficiency. The former is solved using the symmetric quasi‐minimal residual whereas the latter is solved using the popular bi‐conjugate gradient stabilized. This paper presents an extensive comparison of the symmetric and non‐symmetric forms by varying the time step, size of the spatial domain, choice of physical units, and left versus left–right preconditioning. The generalized Jacobi (GJ) preconditioner is able to handle the non‐symmetric version of Biot's finite element method equation, although there are no practical incentives to do so. The convergence behaviour of GJ‐preconditioned systems and its relation to the spectral condition number or the complete spectrum are studied to clarify the concept of ill‐conditioning within the context of iteration solvers. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献