High-efciency improved symmetric successive over-relaxation preconditioned conjugate gradient method for solving large-scale finite element linear equations

Fast solving large-scale linear equations in the finite element analysis is a classical subject in computational mechanics. It is a key technique in computer aided engineering （CAE） and computer aided manufacturing （CAM）. This paper presents a high-efficiency improved symmetric successive over-relaxation （ISSOR） preconditioned conjugate gradient （PCG） method, which maintains lelism consistent with the original form. Ideally, the by 50% as compared with the original algorithm. the convergence and inherent paralcomputation can It is suitable for be reduced nearly high-performance computing with its inherent basic high-efficiency operations. By comparing with the numerical results, it is shown that the proposed method has the best performance.

IMPROVED PRECONDITIONED CONJUGATE GRADIENT METHOD AND ITS APPLICATION IN F.E.A.FOR ENGINEERING

In this paper two theorems with theoretical and practical significance are given in respect to the preconditioned conjugate gradient method (PCCG). The theorems discuss respectively the qualitative property of the iterative solution and the construction principle of the iterative matrix. The authors put forward a new incompletely LU factorizing technique for non-M-matrix and the method of constructing the iterative matrix. This improved PCCG is used to calculate the ill-conditioned problems and large-scale three-dimensional finite element problems, and simultaneously contrasted with other methods. The abnormal phenomenon is analyzed when PCCG is used to solve the system of ill-conditioned equations, ft is shown that the method proposed in this paper is quite effective in solving the system of large-scale finite element equations and the system of ill-conditioned equations.

Preconditioned Iterative Methods for Algebraic Systems from Multiplicative Half-Quadratic Regularization Image Restorations

Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term.A regularized convex term can usually preserve the image edges well in the restored image.In this paper,we consider a class of convex and edge-preserving regularization functions,i.e.,multiplicative half-quadratic regularizations,and we use the Newton method to solve the correspondingly reduced systems of nonlinear equations.At each Newton iterate,the preconditioned conjugate gradient method,incorporated with a constraint preconditioner,is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix. The eigenvalue bounds of the preconditioned matrix are deliberately derived,which can be used to estimate the convergence speed of the preconditioned conjugate gradient method.We use experimental results to demonstrate that this new approach is efficient, and the effect of image restoration is reasonably well.

THE RESTRICTIVELY PRECONDITIONED CONJUGATE GRADIENT METHODS ON NORMAL RESIDUAL FOR BLOCK TWO-BY-TWO LINEAR SYSTEMS

The restrictively preconditioned conjugate gradient （RPCG） method is further developed to solve large sparse system of linear equations of a block two-by-two structure. The basic idea of this new approach is that we apply the RPCG method to the normal-residual equation of the block two-by-two linear system and construct each required approximate matrix by making use of the incomplete orthogonal factorization of the involved matrix blocks. Numerical experiments show that the new method, called the restrictively preconditioned conjugate gradient on normal residual （RPCGNR）, is more robust and effective than either the known RPCG method or the standard conjugate gradient on normal residual （CGNR） method when being used for solving the large sparse saddle point problems.

Explicit Iterative Methods of Second Order and Approximate Inverse Preconditioners for Solving Complex Computational Problems

Explicit Exact and Approximate Inverse Preconditioners for solving complex linear systems are introduced. A class of general iterative methods of second order is presented and the selection of iterative parameters is discussed. The second order iterative methods behave quite similar to first order methods and the development of efficient preconditioners for solving the original linear system is a decisive factor for making the second order iterative methods superior to the first order iterative methods. Adaptive preconditioned Conjugate Gradient methods using explicit approximate preconditioners for solving efficiently large sparse systems of algebraic equations are also presented. The generalized Approximate Inverse Matrix techniques can be efficiently used in conjunction with explicit iterative schemes leading to effective composite semi-direct solution methods for solving large linear systems of algebraic equations.

A Preconditioned Conjugate Gradient Method with Active Set Strategy for1-Regularized Least Squares

In the paper,we consider the l_(1)-regularized least square problem which has been intensively involved in the fields of signal processing,compressive sensing,linear inverse problems and statistical inference.The considered problem has been proved recently to be equivalent to a nonnegatively constrained quadratic programming(QP).In this paper,we use a recently developed active conjugate gradient method to solve the resulting QP problem.To improve the algorithm’s performance,we design a subspace exact steplength as well as a precondition technique.The performance comparisons illustrate that the proposed algorithm is competitive and even performs little better than several state-of-the-art algorithms.

PRECONDITIONED CONJUGATE GRADIENT METHODS FOR INTEGRAL EQUATIONS OF THE SECOND KIND DEFINED ON THE HALF-LINE

We consider solving integral equations of the second kind defined on the half-line [0, infinity) by the preconditioned conjugate gradient method. Convergence is known to be slow due to the non-compactness of the associated integral operator. In this paper, we construct two different circulant integral operators to be used as preconditioners for the method to speed up its convergence rate. We prove that if the given integral operator is close to a convolution-type integral operator, then the preconditioned systems will have spectrum clustered around 1 and hence the preconditioned conjugate gradient method will converge superlinearly. Numerical examples are given to illustrate the fast convergence.

桥梁移动荷载识别及其PCGM预优矩阵选取

基于时域法(TDM)求解思路,结合桥梁移动荷载特点,采用预处理共轭梯度法(PCGM)由梁的弯矩响应、加速度响应及其响应组合来识别桥梁移动荷载,重点比较在方程组不适定以及测量响应受噪声影响情况下不同预优矩阵对识别精度的影响,从而得到可用于移动荷载识别的最优预优矩阵.仿真结果表明,在绝大多数工况下,预处理共轭梯度法均能精确识别桥梁移动荷载,但不同预优矩阵对测量噪声及识别方程的不适定性有不同的抵抗能力,且对预处理共轭梯度法的收敛速度、识别精度也存在不同影响;合理选取预优矩阵能够有效提高桥梁移动荷载识别预处理共轭梯度法的精度和效率.

Multiple linear system techniques for 3D finite element method modeling of direct current resistivity

The strategies that minimize the overall solution time of multiple linear systems in 3D finite element method (FEM) modeling of direct current (DC) resistivity were discussed. A global stiff matrix is assembled and stored in two parts separately. One part is associated with the volume integral and the other is associated with the subsurface boundary integral. The equivalent multiple linear systems with closer right-hand sides than the original systems were constructed. A recycling Krylov subspace technique was employed to solve the multiple linear systems. The solution of the seed system was used as an initial guess for the subsequent systems. The results of two numerical experiments show that the improved algorithm reduces the iterations and CPU time by almost 50%, compared with the classical preconditioned conjugate gradient method.

NUMERICAL STUDY ON THE FLOW AROUND A CIRCULAR CYLINDER WITH SURFACE SUCTION OR BLOWING USING VORTICITY-VELOCITY METHOD

A vorticity-velocity method was used to study the incompressible viscous fluid flow around a circular cylinder with surface suction or blowing. The resulted high order implicit difference equations were effeciently solved by the modified incomplete LU decomposition conjugate gradient scheme ( MILU-CG). The effects of surface suction or blowing' s position and strength on the vortex structures in the cylinder wake, as well as on the drag and lift forces at Reynoldes number Re = 100 were investigated numerically. The results show that the suction on the shoulder of the cylinder or the blowing on the rear of the cylinder can effeciently suppress the asymmetry of the vortex wake in the transverse direction and greatly reduce the lift force; the suction on the shoulder of the cylinder, when its strength is properly chosen, can reduce the drag force significantly, too.

An Improved Graphics Processing Unit Acceleration Approach for Three-Dimensional Structural Topology Optimization Using the Element-Free Galerkin Method

We proposed an improved graphics processing unit(GPU)acceleration approach for three-dimensional structural topology optimization using the element-free Galerkin(EFG)method.This method can effectively eliminate the race condition under parallelization.We established a structural topology optimization model by combining the EFG method and the solid isotropic microstructures with penalization model.We explored the GPU parallel algorithm of assembling stiffness matrix,solving discrete equation,analyzing sensitivity,and updating design variables in detail.We also proposed a node pair-wise method for assembling the stiffnessmatrix and a node-wise method for sensitivity analysis to eliminate race conditions during the parallelization.Furthermore,we investigated the effects of the thread block size,the number of degrees of freedom,and the convergence error of preconditioned conjugate gradient(PCG)on GPU computing performance.Finally,the results of the three numerical examples demonstrated the validity of the proposed approach and showed the significant acceleration of structural topology optimization.To save the cost of optimization calculation,we proposed the appropriate thread block size and the convergence error of the PCG method.

Application of SSOR-PCGM with improved iteration format in FEM simulation of massive concrete

In this study, for the purpose of improving the efficiency and accuracy of numerical simulation of massive concrete, the symmetric successive over relaxation-preconditioned conjugate gradient method （SSOR-PCGM） with an improved iteration format was derived and applied to solution of large sparse symmetric positive definite linear equations in the computational process of the finite element analysis. A three-dimensional simulation program for massive concrete was developed based on SSOR-PCGM with an improved iteration format. Then, the programs based on the direct method and SSOR-PCGM with an improved iteration format were used for computation of the Guandi roller compacted concrete （RCC） gravity dam and an elastic cube under free expansion. The comparison and analysis of the computational results show that SSOR-PCGM with the improved iteration format occupies much less physical memory and can solve larger-scale problems with much less computing time and flexible control of accuracy.

MILU-CG METHOD AND THE NUMERICAL STUDY ON THE FLOW AROUND A ROTATINGCIRCULAR CYLINDER

A hybrid finite difference method and vortex method (HDV), which is based on domain decomposition and proposed by the authors (1992), is improved by using a modified incomplete LU decomposition conjugate gradient method (MILU-CG), and a high order implicit difference algorithm. The flow around a rotating circular cylinder at Reynolds number R-e = 1000, 200 and the angular to rectilinear speed ratio alpha is an element of (0.5, 3.25) is studied numerically. The long-time full developed features about the variations of the vortex patterns in the wake, and drag, lift forces on the cylinder are given. The calculated streamline contours agreed well with the experimental visualized flow pictures. The existence of critical states and the vortex patterns at the states are given for the first time. The maximum lift to drag force ratio can be obtained nearby the critical states.

DOMAIN DECOMPOSITION PRECONDITIONERS FOR SECOND-ORDER HYPERBOLIC EQUATIONS ON L-SHAPED REGIONS

Linear systems arising from implicit time discretizations and finite difference space discretizations of second-order hyperbolic equations on L-shaped region are considered. We analyse the use of domain deocmposilion preconditioner.s for the solution of linear systems via the preconditioned conjugate gradient method. For the constant-coefficient second-order hyperbolic equaions with initial and Dirichlet boundary conditions,we prove that the conditionnumber of the preconditioned interface system is bounded by 2+x2 2+0.46x2 where x is the quo-tient between the lime and space steps. Such condition number produces a convergence rale that is independent of gridsize and aspect ratios. The results could be extended to parabolic equations.

SINE TRANSFORM PRECONDITIONERS FOR SECOND-ORDER PARTIAL DIFFERENTIAL EQUATIONS

In this paper, we are concerned with the numerical solution of second-order partial differential equations. We analyse the use of the Sine Transform precondilioners for the solution of linear systems arising from the discretization of p.d.e. via the preconditioned conjugate gradient method. For the second-order partial differential equations with Dirichlel boundary conditions, we prove that the condition number of the preconditioned system is O(1) while the condition number of the original system is O(m 2) Here m is the number of interior gridpoints in each direction. Such condition number produces a linear convergence rale.

An Inexact Halley's Method

An inexact Halley＇s method-Halley-PCG（preconditioned conjugate gradient） method is proposed for solving the systems of linear equations for improved Halley method either by Cholesky factorization exactly or by preconditioned conjugate gradient method approximately. The convergence result is given and the efficiency of the method compared to the improved Halley＇s method is shown.

从瞬变电磁扩散场到拟地震波场的全时域反变换算法

将瞬变电磁满足的扩散方程转变为波动方程,然后利用地震类成像方法实现瞬变电磁虚拟波场成像,是实现瞬变电磁三维反演的有效手段之一.为了实现由扩散场到虚拟波场的转换,文中采用预条件正则化共轭梯度法求解波场反变换问题.首先,对几种离散方式进行比较,采用条件数最小的离散方式进行离散;然后选择最优的正则化参数,并利用超松弛预条件技术对系数矩阵进行预条件处理;最后,利用共轭梯度法进行迭代求解.超松弛预条件有效降低了系数矩阵的条件数,正则化方法使得反变换得到的波场稳定、可靠,共轭梯度法能够保证计算快速收敛.将反变换结果与已知虚拟波场函数对比,证明算法稳定、可信.将文中算法结果与前人研究结果进行对比,说明方法效果.通过实测数据的波场变换处理给出了文中方法的实际应用效果.结合反变换算法,对不同参数模型进行分析,总结了虚拟波场在色散介质中的传播规律.

用有限元法优化高压电缆参数

提出了优化高压电缆的综合场数学模型 ,它包括电流场和静电场 ,推出了综合电场的边值问题 ,并用有限元法离散此数学模型。改进了传统的双共轭梯度法 ,并用此方法解离散的线性方程组 ,改善了解的收敛特性。优化了高压电缆参数 。

基于有限差分和有限体积法相结合的油浸式变压器三维温度场计算

为准确计算油浸变压器的温度场,在对比有限体积法(FVM)和有限差分法(FDM)各自优点的基础上,提出了一种计算变压器温度场的混合计算方法。以驻马店金桥变电站的一台31.5 MVA主变为例,建立了3维模型,利用有限体积和有限差分混合计算方法,并在绕组和铁芯的热传导计算中采用了高精度的预条件共轭梯度解法(PCGM),计算了变压器的3维温度场。将利用混合方法的平均温度计算结果分别与实际监测数据、使用同样模型的FDM及FVM算法计算出的数据、以及使用IEEE导则模型计算出的数据进行了对比。对比结果表明:混合算法的计算精度明显高于利用IEEE导则模型、FDM算法和FVM算法的计算结果,证明了这种混合计算方法能更准确地计算油浸式变压器的内部温度场。

基于不等式约束的最小二乘法三维电阻率反演及其算法优化

基于光滑约束的最小二乘法是三维电阻率反演的主要方法,但该方法在某些情况下存在着多解性较强的问题,且普遍耗时较长,严重制约了三维反演方法的推广与发展.为改善上述问题,将表征模型参数变化范围的不等式约束作为先验信息引入最小二乘线性反演方法中,有效地改善了反演结果的精度,降低了反演的多解性问题.为了解决耗时较长的问题,基于预条件共轭梯度(PCG)算法和Cholesky分解法的特点提出了一套优化三维电阻率反演计算效率的计算方案.在该方案中,Cholesky分解法被用来求解敏感度矩阵计算中的多个点源场的正演问题,Cholesky分解法只需对总体系数矩阵进行一次分解,然后对不同的右端向量进行回代即可.将预条件共轭梯度法引入到三维电阻率反演方程的求解中,将雅可比迭代中的对角阵作为预处理矩阵,其具有求逆方便、无需内存空间的特点,有效地加快了收敛速度.对合成数据以及实测数据的反演算例表明,借助不等式约束和反演效率优化方案,最小二乘反演方法可得到较为精确的反演结果,有效地提高了反演计算效率,具有良好的推广前景.