ON ALGEBRAIC MULTILEVEL PRECONDITIONINGMETHODS

In the present paper we extend the method presented by 0. Axelsson and P. Vassilevski called AMLP version (i) of recursively constructing preconditioner for the stiffness matrix in the discretization of selfadjoint second order elliptic boundary value problems. In our extended method the systems to be eliminated on each level containing the major block matrices of the given matrix can be solved approximately, while they must be solved exactly in the original method.     

ALGEBRAIC MULTILEVEL RELAXED PRECONDITIONING METHODS

Some ways of multilevel relaxed preconditioning matrices for the stiffness matrix in the discretization of selfad joint second order elliptic boundary value problems are proposed. For reason-able assumptions of the relaxed factor ω, smaller relative condition numbers are given. The optimal relaxed factor ω is derived, too.     

A unified framework for the construction of various algebraic multilevel preconditioning methods

1.IntroductionThediscretizationofmanysecondorderselfadjointellipticboundaryvalueproblemsbythefiniteelementmethodleadstolargesparsesystemsoflinearequationswithsymmetricpositivedefinite(SPD)coefficientmatrices.Fortheselinearsystems,algebraicmultilevelp...     

A CLASS OF NEW PARALLEL HYBRID ALGEBRAIC MULTILEVEL ITERATIONS

1. IntroductionConsider the large sparse system of linear equationsAx = b, (1.1)where, for a fixed positive integer cr, A e L(R") is a symmetric positive definite (SPD) matrir,having the bloCked formx,b E R" are the uDknwn and the known vectors, respectively, having the correspondingblocked formsni(ni S n, i = 1, 2,', a) are a given positthe integers, satisfying Z ni = n. This systemi= 1of linear equations often arises in sultable finite element discretizations of many secondorderseifad…     

NONNESTED MULTILEVEL PRECONDITIONING METHODS WITH SIMPLE AND IDENTICAL COARSE MESH CORRECTION SPACES

1　ＩｎｔｒｏｄｕｃｔｉｏｎＭｕｌｔｉｌｅｖｅｌｍｅｔｈｏｄｓｈａｖｅｂｅｃｏｍｅｓｏｍｅｏｆｔｈｅｍｏｓｔｐｏｐｕｌａｒｍｅｔｈｏｄｓｆｏｒｓｏｌｖｉｎｇｌａｒｇｅｓｙｓｔｅｍｏｆｌｉｎｅａｒｅｑｕａｔｉｏｎｓｒｅｓｕｌｔｉｎｇｆｒｏｍｔｈｅｆｉｎｉｔｅｅｌｅｍｅｎｔｄｉｓｃｒｅｔｉｚａｔｉｏｎｏｆｐａｒｔｉａｌｄｉｆｆｅｒｅｎｔｉａｌｅｑｕａｔｉｏｎｓ.ＴｈｅｐｉｏｎｅｅｒｗｏｒｋｏｆｍｕｌｔｉｌｅｖｅｌｍｅｔｈｏｄｓｉｓｔｈｅＹｓｅｒｅｎｔａｎｔ’ｓＨｉｅｒａｒｃｈｉｃａｌｂａｓｉｓｍｅｔｈ…     

A framework of parallel algebraic multilevel preconditioning iterations

1.IntroductionConsiderthesyllUnetricpositivedeflate(SPD)systemsoflinearequationsthatariseinfiniteelementdiscretisstionsofmanysecond-orderself-adjointellipticboundaryvalueproblems.Tosolvethisclassoflinearsystemsiteratively,AxelssonandVassilevski[1--4]preselltedthealgebraicmultileveliteration(AMLI)methodsbyreasonablyutilizingthemultigridtechniqueandthepolynomialaccelerationstrategy.Thesemethodsareamongthemostefficientiterativesolversbecausetheirpreconditioningmatricesarespectrallyequlvalellt…     

非匹配网格上Stokes-Darcy模型的非协调元方法及其预条件技术

本文讨论了非匹配网格上Stokes-Darcy模型的两种低阶非协调元方法,证明了离散问题的适定性并得到了最优的误差估计.对离散出来的非对称不定线性方程组,我们提出了几种有效的预条件子,证明了预条件子的最优性.最后,数值试验验证了我们的理论结果.     

混合有限元非嵌套网格型预处理法

1 引言 众所周知,二阶椭圆型问题混合有限元离散以后的矩阵是不定的,所以对混合法很难形成一种有效的区域分解法,在文[9]、[10]、[11]中提出了一些混合有限元方法的区域分解法,但在实际计算中有很多局限性。最近Chen对混合有限元法提出一种全新的解释并把它应用到多重网格法中,他的基本思想是混合有限元离散的代数系统实际上等价于某个非协调有限元离散的代数系统,这样可把一个不定问题转化为一个正定问题,本文将基于这种思想考虑混合有限元的区域分解法。 若按传统的Dryia-widlund两水平加性Schwarz方法,要求两层网格间具有嵌套关系,这样在应用中将带来很大的不便。本文将不要求粗网格嵌入细网格中,减少两层网格间的     

MULTILEVEL AUGMENTATION METHODS FOR SOLVING OPERATOR EQUATIONS

We introduce multilevel augmentation methods for solving operator equations based on direct sum decompositions of the range space of the operator and the solution space of the operator equation and a matrix splitting scheme. We establish a general setting for the analysis of these methods, showing that the methods yield approximate solutions of the same convergence order as the best approximation from the subspace. These augmentation methods allow us to develop fast, accurate and stable nonconventional numerical algorithms for solving operator equations. In particular, for second kind equations, special splitting techniques are proposed to develop such algorithms. These algorithms are then applied to solve the linear systems resulting from matrix compression schemes using wavelet-like functions for solving Fredholm integral equations of the second kind. For this special case, a complete analysis for computational complexity and convergence order is presented. Numerical examples are included to demonstra     

几乎各向同性的高维空间分数阶扩散方程的分块快速正则Hermite分裂预处理方法

一类空间分数阶扩散方程经过有限差分离散后所得到的离散线性方程组的系数矩阵是两个对角矩阵与Toeplitz型矩阵的乘积之和.在本文中,对于几乎各向同性的二维或三维空间分数阶扩散方程的离散线性方程组,采用预处理Krylov子空间迭代方法,我们利用其系数矩阵的特殊结构和具体性质构造了一类分块快速正则Hermite分裂预处理子.通过理论分析,我们证明了所对应的预处理矩阵的特征值大部分都聚集于1的附近.数值实验也表明,这类分块快速正则Hermite分裂预处理子可以明显地加快广义极小残量(GMRES)方法和稳定化的双共轭梯度(BiCGSTAB)方法等Krylov子空间迭代方法的收敛速度.     

A MPI PARALLEL PRECONDITIONED SPECTRAL ELEMENT METHOD FOR THE HELMHOLTZ EQUATION

Spectral element method is well known as high-order method, and has potential better parallel feature as compared with low order methods. In this paper, a parallel preconditioned conjugate gradient iterative method is proposed to solving the spectral element approximation of the Helmholtz equation. The parallel algorithm is shown to have good performance as compared to non parallel cases, especially when the stiffness matrix is not memorized. A series of numerical experiments in one dimensional case is carried out to demonstrate the efficiency of the proposed method.     

PRECONDITIONING HIGHER ORDER FINITE ELEMENT SYSTEMS BY ALGEBRAIC MULTIGRID METHOD OF LINEAR ELEMENTS

We present and analyze a robust preconditioned conjugate gradient method for the higher order Lagrangian finite element systems of a class of elliptic problems. An auxiliary linear element stiffness matrix is chosen to be the preconditioner for higher order finite elements. Then an algebraic multigrid method of linear finite element is applied for solving the preconditioner. The optimal condition number which is independent of the mesh size is obtained. Numerical experiments confirm the efficiency of the algorithm.     

CASCADIC MULTIGRID METHODS FOR MORTAR WILSON FINITE ELEMENT METHODS ON PLANAR LINEAR ELASTICITY

Cascadic multigrid technique for mortar Wilson finite element method of homogeneous boundary value planar linear elasticity is described and analyzed. First the mortar Wilson finite element method for planar linear elasticity will be analyzed, and the error estimate under L2 and H1 norm is optimal. Then a cascadic multigrid method for the mortar finite element discrete problem is described. Suitable grid transfer operator and smoother are developed which lead to an optimal cascadic multigrid method. Finally, the computational results are presented.     

求解三维高次拉格朗日有限元方程的代数多重网格法

本文针对带有间断系数的三维椭圆问题,讨论任意四面体剖分下的二次拉格朗日有限元方程的代数多重网格法．通过分析线性和高次有限元空间之间的关系,我们给出了一种新的网格粗化算法和构造提升算子的代数途径．进一步,我们还对新的代数多重网格法给出了收敛性分析．数值实验表明这种代数多重网格法对求解二次拉格朗日有限元方程是健壮和有效的。     

Numerical solution of the elastic body-plate problem by nonoverlapping domain decomposition type techniques

The purpose of this paper is to provide two numerical methods for solving the elastic body-plate problem by nonoverlapping domain decomposition type techniques, based on the discretization method by Wang. The first one is similar to an older method, but here the corresponding Schur complement matrix is preconditioned by a specific preconditioner associated with the plate problem. The second one is a ``displacement-force' type Schwarz alternating method. At each iteration step of the two methods, either a pure body or a pure plate problem needs to be solved. It is shown that both methods have a convergence rate independent of the size of the finite element mesh.

     

高波数波动问题的多水平方法

本文主要讨论求解高波数Helmholtz方程的多水平方法,主要回顾了一些具有代表性的多重网格方法.如Erlangga等人的shifted Laplacian预处理的多重网格法;Elman等提出的修正的多重网格方法;以及我们的基于连续内罚有限元(CIP-FEM)离散代数系统的多水平算法.最后还介绍了求解高波数时谐Maxwell方程的CIP-FEM离散代数系统的多水平算法.     

解线性方程组的预条件迭代方法

In this paper,we study the preconditioning iterative methods for the solution of the linear system and provide a convergence theorem of this method,it improves some recent results,We prove that if all parameters are in [0,1],the convergence rates for the MGS (Modified Gauss-Seidel)type methods are better than those of the corresponding SOR type methods.     

一类求解鞍点问题的广义不精确Uzawa方法

本文提出了一类求解大型稀疏鞍点问题的新的广义不精确Uzawa算法.该方法不仅可以包含 前人的方法, 而且可以拓展出很多新方法. 理论分析给出该方法收敛的条件, 并详细的分析了其收敛性质和参数矩阵的选取方法. 通过对有限元离散的Stokes问题的数值实验表明, 新方法是行之有效的, 其收敛速度明显优于原来的算法.