共查询到19条相似文献，搜索用时 169 毫秒
1.
在地球物理电磁勘探领域有限元数值模拟中,最后都会得到一个大型稀疏的复系数线性方程组,受计算机内存空间的限制,必须根据有限元刚度矩阵的稀疏性对其进行压缩存储。由于电磁场有限元计算的自由度大都在三个以上,因而提出了适合多自由度的块按行压缩稀疏存储方案,并通过存储格式的转换,把块按行压缩方式转换成流行的,大型稀疏矩阵的行压缩存储格式,以便于求解。用求解大型稀疏方程组的Krylov子空间方法中的稳定双共轭梯度（Bicgstab）方法,收敛速度快,精度高,而且稳定性好,结合ilu预处理技术,可以大大提高求解大型稀疏方程组的效率。 相似文献
2.
基于有限单元法的二维／三维大地电磁正演模拟策略 总被引：1，自引：0，他引：1
对于二维和三维大地电磁正演问题,有限单元法最后形成了一个线性方程组KX=p。方程组中的K是大型稀疏的带状对称复系数矩阵,其条件数远大于1,为严重病态矩阵,求解其对应方程组会遇到很多困难。不完全LU分解处理的BICGSTAB算法,可用于该线性方程组的求解,并且具有速度快,精度高,稳定性好等优点。为了模拟无穷远边界及满足计算机的内存需求,在保证计算精度的情况下,设计了非均匀网格剖分。在程序编制中,因只存储有限元系数矩阵的非零元素,大大减少了正演计算的时间。通过对二维模型和三维模型电磁响应的计算,验证了该算法的正确性。 相似文献
3.
有限单元法求解地下水流数学模型,最终将形成一线代数方程组。利用有限元构成该方程组系数矩阵的特点,采用分块集合波阵方法(wave front method)求解该线代数方程组,可以大量节省计算所需的内存空间,为用小内存容量的计算机求解规模较大的地下水流问题,提供了一种有效的手段。 相似文献
4.
5.
在三维电阻率的正演计算中往往涉及到快速、准确求解大型线性方程纽Ax=b的问题。通过采用有限差分法来构造出求解点电源三维地电场的大型稀疏对称线性方程组。并引入Lanczos迭代技术，构造出三对角阵方程组，然后采用正交分解法进行求解，它是Krylov子空间方法中的一种。与传统迭代算法相比，它占用内存少，收敛速度快且稳定。针对大型稀疏矩阵及MATLAB语言的特点，采用简单记录矩阵的非零元素值及其所在行、列值的方法存储大型稀疏矩阵，可大大节省机器内存，提高运算速度。理论分析和计算实例显示，此算法是地电三维正演计算的有效方法，为下一步的反演计算打好基础。 相似文献
6.
非连续变形分析方法（DDA）是一种平行于有限元法的新型数值计算方法,该方法基于最小势能原理,把每个离散块体的变形、运动和块体之间的接触统一到平衡方程中进行隐式求解。然而,传统DDA方法在计算过程中需组装整体刚度矩阵并联立求解方程组,在用于大型岩土工程问题的三维数值模拟时占用内存较大、耗时较长、计算效率极低。因此,提出一种基于显式时间积分的三维球颗粒DDA方法。该方法在求解过程中不需要组装整体刚度矩阵,在求解加速度时,由于质量矩阵为对角矩阵,可存储为一维向量占用内存较少,且可分块逐自由度求解,效率较高,在接触判断上采用最大位移准则简化了接触算法,采用较小的时步,保证了计算的精确性;通过几个典型算例验证了该方法的准确性及计算效率。 相似文献
7.
GJP-1程序是针对岩土力学课题而进行的空间非线性有限元分析的第一阶段成果,可用于含节理的三维弹性静力有限元分析。 GJP-1程序采用20节点等参元划分连续介质,而用18节点等参节理单元来模拟非连续面。本程序考虑了集中荷载、重力荷载、均布或不均布的作用方向为任意的面荷载、温度荷载,以及它们的各种组合作用。本程序允许各个单元有不同的材料性质。GJP-1程序具有自动划分网格,自动调整网格,和自动校核数据的功能,并提供波前法和分块三角分解解法供用户灵活选用,以便能在中小型计算机上求解比较大型的工程问题。本文列举了几个有理论解的算例,计算结果表明,本程序的计算精度是令人满意的 相似文献
8.
一般而言,有限差分法求解点源三维地电场正问题所形成的大型稀疏线必方程组Ａｘ＝ｂ,直接解法的计算效率极低。本文从系数矩阵Ａ的不完全Ｃｈｏｌｅｓｋｙ分解及矩阵特征值的特点等角度,说明了不完全Ｃｈｏｌｅｓｋｙ共轭梯度（ＩＣＣＧ）迭代技术可大大提高电阻率三维正演速度的内在原因。结合矩阵Ａ的稀疏存储模式,使得内存需求也大大减少。 相似文献
9.
10.
岩土工程百万以上自由度有限元并行计算 总被引：3，自引：0，他引：3
讨论了大规模有限元并行计算需要解决的并行策略、大量数据的分布存储、方程组迭代求解和程序实现等问题。采用区域分解的“分而治之”的并行策略实现有限元并行。结合区域分解并行策略，将每个子区域的数据信息存储在相应的各个计算机上，实现存储局部化，大大减少并行计算中的通讯量，同时可以实现大规模计算。采用Schur补和共轭梯度法来实现方程组的并行求解，解决岩土有限元病态方程组的求解。采用面向对象的编程技术开发了并行有限元程序。对两个大规模算例进行了并行计算，得到了较好的结果。 相似文献
11.
The double Column block method applies to solute of large sparse linear simultaneous equations in finite element analysis. At present the portioned triangular decomposition method is generally used for solving large systems of linear equations in FE. With the partition of the coefficient matrix dependent on its bandwidth, the solution of problems with a large bandwidth is restricted owing to the computer core storage and hence it is difficult for this method to solve some large-scal FE problems, especially the three-dimensional problems. This difficulty has been overcome by the double column block method, completely independent of the bandwidth, by means of our method the coefficient matrix is partitioned according to computer core storage capacity. It is proved that this approach is successful and effective. Based on this method, the solution has been completed of the three-dimensional FE problem with 124 twenty-node and 8 sixteen-node isoparametric elements, and 831 nodes, having a maximum half-bandwidth of 1746 and global stiffness matrix storage of more than 5000 K bytes. The computation was performed on PE-3220 minicomputer and only a core storage of 685 K bytes was used. The double column block method makes it possible for minicomputer and high-level microcomputer to be applied to calculations in large-scale FE problems. 相似文献
12.
Preconditioned projection (or conjugate gradient like) methods are increasingly used for the accurate and efficient solution to finite element (FE) coupled consolidation equations. Theory indicates that preliminary row/column scaling does not affect the eigenspectrum of the iteration matrix controlling convergence as long as the preconditioner relies on the incomplete factorization of the FE coefficient matrix. However, computational experience with mid‐large size problems shows that the above inexpensive operation can significantly accelerate the solver convergence, and to a minor extent also improve the final accuracy, as a result of a better solver stability to the accumulation and propagation of floating point round‐off errors. This is demonstrated with the aid of the least square logarithm (LSL) scaling algorithm on FE consolidation problems of increasing size up to more than 100 000. It is shown that a major source of numerical instability rests with the sub‐matrix which couples the structural to the fluid part of the underlying mathematical model. It is concluded that for mid‐large size, possibly difficult, FE consolidation problems left/right LSL scaling is to be always recommended when the incomplete factorization is used as a preconditioning technique. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
13.
梁生贤 《吉林大学学报(地球科学版)》2018,48(5):1473-1482
本文将拟合残差计算所得的互相关系数作为先验信息,与深度加权函数同时引入到重力正则化反演的模型约束中,以提升反演结果的可靠性。针对三维反演中的大型线性方程组问题,引入阻尼LSQR （最小二乘QR分解）算法,结合等效几何格架技术,将大矩阵按照模型单元划分为若干个子矩阵进行存储与运算。理论模型计算结果表明：同时利用互相关系数和深度加权的模型自约束反演,能较清晰地反映真实异常体;基于分块矩阵的阻尼LSQR算法求解线性方程组较直接法节省了几千甚至上万倍的存储量,且计算速率提高了数倍,可在普通计算机上实现较大规模的反演计算。将其应用于云南芦子园铁铅锌铜多金属矿床隐伏花岗岩体定位,取得了良好的效果。 相似文献
14.
井地直流电法三维数值模拟中若干问题研究 总被引：3，自引：0，他引：3
讨论了地下垂直线源分段计算和场叠加的方法,并实现了在套管上供直流电的三维数值模拟。讨论了大型容量矩阵的压缩存储方式,采用数组和结构体相结合的方法实现容量矩阵的一维链表式压缩存储。在求解超大型稀疏线形方程组时引入不完全Cholesky分解稳定化的双共轭梯度算法(ICBG),通过与均匀半空间垂直线源解析解的对比,证明了该算法是准确可靠的。 相似文献
15.
Projection, or conjugate gradient like, methods are becoming increasingly popular for the efficient solution of large sparse sets of unsymmetric indefinite equations arising from the numerical integration of (initial) boundary value problems. One such problem is soil consolidation coupling a flow and a structural model, typically solved by finite elements (FE) in space and a marching scheme in time (e.g. the Crank–Nicolson scheme). The attraction of a projection method stems from a number of factors, including the ease of implementation, the requirement of limited core memory and the low computational cost if a cheap and effective matrix preconditioner is available. In the present paper, biconjugate gradient stabilized (Bi‐ CGSTAB) is used to solve FE consolidation equations in 2‐D and 3‐D settings with variable time integration steps. Three different nodal orderings are selected along with the preconditioner ILUT based on incomplete triangular factorization and variable fill‐in. The overall cost of the solver is made up of the preconditioning cost plus the cost to converge which is in turn related to the number of iterations and the elementary operations required by each iteration. The results show that nodal ordering affects the perfor mance of Bi‐CGSTAB. For normally conditioned consolidation problems Bi‐CGSTAB with the best ILUT preconditioner may converge in a number of iterations up to two order of magnitude smaller than the size of the FE model and proves an accurate, cost‐effective and robust alternative to direct methods. Copyright © 2001 John Wiley & Sons, Ltd. 相似文献
16.
Clarisse Alboin Jérôme Jaffré Patrick Joly Jean E. Roberts Christophe Serres 《Computational Geosciences》2002,6(3-4):523-543
Contaminant transport in a fractured porous medium can be modeled, under appropriate conditions, with a double porosity model. Such a model consists of a parabolic equation with a coupling term describing contaminant exchange between the fractures, which have high permeability, and the matrix block, which has low permeability. A locally conservative method based on mixed finite elements is used to solve the parabolic problem, and the calculation of the coupling term, which involves the solution of diffusion equations in the matrix blocks, is based on an analytic expression. Numerical experiments show that this semi-analytic method for the coupling term is accurate and faster than several other methods but at a small expense of computer memory. 相似文献
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.
拟解析近似方法是一种求解积分方程的一种近似方法,它可以处理强散射或者大扰动的电磁散射问题,在计算过程中避免了传统微分数值方法解决问题时所遇到的大型矩阵或大型代数方程组的求解。孙建国[5]将其引入直流电场的积分方程中,并给出了求解异常电场积分方程的标量拟解析近似公式。在以前的研究中,已经验证了均匀场中异常球体的拟解析近似解的精度,这里对均匀场中的立方体异常体进行数值模拟,得到了直流电场中异常立方体模型的标量拟解析近似解。由于复杂地电模型可以用立方体的组合进行模拟,因此对立方体异常电场拟解析近似解的研究,为三维直流电场中复杂地电模型的快速正反演模拟打下了基础。 相似文献
19.