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.

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.

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.

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.

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.

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.

Spectral Analysis for Preconditioning of Multi-Dimensional Riesz Fractional Diffusion Equations

In this paper,we analyze the spectra of the preconditioned matrices arising from discretized multi-dimensional Riesz spatial fractional diffusion equations.The finite difference method is employed to approximate the multi-dimensional Riesz fractional derivatives,which generates symmetric positive definite ill-conditioned multi-level Toeplitz matrices.The preconditioned conjugate gradient method with a preconditioner based on the sine transform is employed to solve the resulting linear system.Theoretically,we prove that the spectra of the preconditioned matrices are uniformly bounded in the open interval(12,32)and thus the preconditioned conjugate gradient method converges linearly within an iteration number independent of the discretization step-size.Moreover,the proposed method can be extended to handle ill-conditioned multi-level Toeplitz matrices whose blocks are generated by functions with zeros of fractional order.Our theoretical results fill in a vacancy in the literature.Numerical examples are presented to show the convergence performance of the proposed preconditioner that is better than other preconditioners.

Fast and accurate surface normal integration on non-rectangular domains

The integration of surface normals for the purpose of computing the shape of a surface in 3D space is a classic problem in computer vision. However,even nowadays it is still a challenging task to devise a method that is flexible enough to work on non-trivial computational domains with high accuracy, robustness,and computational efficiency. By uniting a classic approach for surface normal integration with modern computational techniques, we construct a solver that fulfils these requirements. Building upon the Poisson integration model, we use an iterative Krylov subspace solver as a core step in tackling the task. While such a method can be very efficient, it may only show its full potential when combined with suitable numerical preconditioning and problem-specific initialisation. We perform a thorough numerical study in order to identify an appropriate preconditioner for this purpose.To provide suitable initialisation, we compute this initial state using a recently developed fast marching integrator. Detailed numerical experiments illustrate the benefits of this novel combination. In addition, we show on real-world photometric stereo datasets that the developed numerical framework is flexible enough to tackle modern computer vision applications.

A TensorFIow-based new high-performance computational framework for CFD

In this study,a computational framework in the field of artificial intelligence was applied in computational fluid dynamics(CFD)field.This Framework,which was initially proposed by Google Al department,is called"TensorFlow".An improved CFD model based on this framework was developed with a high-order difference method,which is a constrained interpolation profile(CIP)scheme for the base flow solver of the advection term in the Navier-Stokes equations,and preconditioned conjugate gradient(PCG)method was implemented in the model to solve the Poisson equation.Some new features including the convolution,vectorization,and graphics processing unit(GPU)acceleration were implemented to raise the computational efficiency.The model was tested with several benchmark cases and shows good performance.Compared with our former CIP-based model,the present Tensor Flow-based model also shows significantly higher computational efficiency in large-scale computation.The results indicate TensorFlow could be a promising framework for CFD models due to its ability in the computational acceleration and convenience for programming.