REVIEW ARTICLE MULTIGRID METHODS FOR OBSTACLE PROBLEMS

In this review, we intend to clarify the underlying ideas and the relations between various multigrid methods ranging from subset decomposition, to projected subspace decomposition and truncated multigrid. In addition, we present a novel globally convergent inexact active set method which is closely related to truncated multigrid. The numerical properties of algorithms are carefully assessed by means of a degenerate problem and a problem with a complicated coincidence set.     

MULTIGRID METHODS FOR THE GENERALIZED STOKES EQUATIONS BASED ON MIXED FINITE ELEMENT METHODS

1. IntroductionIn this paper, we consider the fOllowing generalized stationary Stokes equations:where fl is a bounded convex domain in R', u represents the velocity of fluid, p its pressure; Fand G are external fOrce and source terms. Note that the source…     

GAUSS-SEIDEL-TYPE MULTIGRID METHODS

By making use of the Gauss-Seidel-type solution method, the procedure for computing the interpolation operator of multigrid methods is simplified. This leads to a saving of computational time. Three new kinds of interpolation formulae are obtained by adopting different approximate methods, to try to enhance the accuracy of the interpolatory oper-ator. A theoretical study proves the two-level convergence of these Gauss-Seidel-type MG methods. A series of numerical experiments is presented to evaluate the relative perfor-mance of the methods with respect to the convergence factor, CPU-time(for one V-cycle and the setup phase) and computational complexity.     

MULTIGRID METHOD FOR FLUID DYNAMIC PROBLEMS

This paper covers the dynamics problems. The review and some aspects of main development stages of using Multigrid method for fluid multigrid technics are presented. Some approaches for solving Navier-Stokes equations and convection- diffusion problems are considered.     

MULTIGRID METHODS FOR MORLEY ELEMENT ON NONNESTED MESHES

1.IntroductionWeconsidersomemultigridalgorithmsforthebiharmonicequationdiscretizedbyMoneyelementonnonnestedmeshes.TOdefineamultigridalgorithm,certainintergridtransferoperatorhastobeconstructed.Throughtakingtheaveragesofthenodalvariables,weconstructanintergridtransferoperatorforMoneyelementonnonnestedmeshesthatsatisfiesacertainstableapproximationpropertywhichplaysakeyroleinmultigridmethodsfornonconformingplateelementsonnonnestedmeshes.Theso--calledregularity-approximaticnassurnptionisestablis…     

CASCADIC MULTIGRID FOR PARABOLIC PROBLEMS CASCADIC MULTIGRID FOR PARABOLIC PROBLEMS

1. IntroductionBornemann and Deuflhaxd [2][3] have Presented a new take of multgiid methods,the sthcalled cascadic multigrid. Compared with usual multigrid ndhods, it reqno coarse grid correCtions at all that may be viewed as a "one way" multis. AnotherdiStinctive feature is performing more iterations on coarser levels so as to obtain leSSiterations on finer levels. Numerical openments show that this ndhod is yak effectivefor second order elliptic problems.In the paper3 we will consider the…     

MULTIGRID METHOD FOR A MODIFIED CURVATURE DRIVEN DIFFUSION MODEL FOR IMAGE INPAINTING

Digital inpainting is a fundamental problem in image processing and many variational models for this problem have appeared recently in the literature. Among them are the very successfully Total Variation （TV） model [11] designed for local inpainting and its improved version for large scale inpainting： the Curvature-Driven Diffusion （CDD） model [10]. For the above two models, their associated Euler Lagrange equations are highly nonlinear partial differential equations. For the TV model there exists a relatively fast and easy to implement fixed point method, so adapting the multigrid method of [24] to here is immediate. For the CDD model however, so far only the well known but usually very slow explicit time marching method has been reported and we explain why the implementation of a fixed point method for the CDD model is not straightforward. Consequently the multigrid method as in [Savage and Chen, Int. J. Comput. Math., 82 （2005）, pp. 1001-1015] will not work here. This fact represents a strong limitation to the range of applications of this model since usually fast solutions are expected. In this paper, we introduce a modification designed to enable a fixed point method to work and to preserve the features of the original CDD model. As a result, a fast and efficient multigrid method is developed for the modified model. Numerical experiments are presented to show the very good performance of the fast algorithm.     

MULTIGRID FOR THE MORTAR FINITE ELEMENT FOR PARABOLIC PROBLEM

In this paper, a mortar finite element method for parabolic problem is presented. Multi-grid method is used for solving the resulting discrete system. It is shown that the multigrid method is optimal, i.e, the convergence rate is independent of the mesh size L and the time step parameter τ.     

ON CONVERGENCE OF MULTIGRID METHOD FOR NONNEGATIVE DEFINITE SYSTEMS

In this paper, we consider multigrid methods for solving symmetric nonnegative definite matrix equations. We present some interesting features of the multigrid method and prove that the method is convergent in L2 space and the convergent solution is unique for such nonnegative definite system and given initial guess.     

解线性互补问题的区间GAOR方法

1引言设M∈Rn×n,q∈Rn,则线性互补问题LCP(M,q)指的是寻找一个向量x∈Rn,使其满足下面的条件: x≥0 Mx+q≥0 xt(Mx+q)=0由于线性互补问题在工程物理、管理学、经济学、约束最优化等领域的应用非常广泛,所以该问题的研究一直倍受大家的关注,至今已有很多有效的算法.早在20世纪80年代     

OBSTACLE PROBLEMS FOR SCALAR GINZBURG-LANDAU EQUATIONS

In this note, we establish some estimates of solutions of the scalar Ginzburg-Landau equation and other nonlinear Laplacian equation △u =f(x, u). This will give an estimate of the Hausdorff dimension for the free boundary of the obstacle problem.     

求解单调变分不等式问题的一类迭代方法

１．引言 变分不等式问题在数学规划中起着重要作用,它最初作为研究偏微分方程的工具,首先由 Ｆｉｓｈｅｒａ和 Ｓｔａｍｐａｃｃｈｉａ等于六十年代初提出,可参看［１］及其参考文献,之后也被广泛用于研究经济学和运筹学等领域中的均衡模型,互补问题和凸规划问题都是变分不等式问题的特殊情形,文献［２］对有限维变分不等式问题和非线性互补问题的理论、算法及应用作了十分全面的综述．设 Ｃ是实有限维空间 Ｒｎ,的非空闲凸子集, Ｆ是 Ｒｎ → Ｒｎ的映射,本文讨论的变分不等式问题ＶＩ（Ｃ,Ｆ）是： 求向量ｒ＊∈Ｃ．使得：Ｆ（…     

变分不等式问题的一个外梯度投影算法

１．引 言 设Ｃ Ｒｎ为非空闭凸集,为连续映射．变分不等式问题,记为ＶＩ（Ｆ,Ｃ）,是求满足上述条件的向量ｘ∈Ｃ变分不等式问题在工程力学,交通运输,经济运筹等方面具有广泛的应用并越来越受到人们的重视 ［２,３］ 求解变分不等式问题有很多解法,其中最简单的是投影     

一种新的并行代数多重网格粗化算法

近年来,受实际应用领域中大规模科学计算问题的驱动,在大规模并行机上实现代数多重网格（AMG）算法成为数值计算领域的研究热点。本文针对经典AMG方法,提出一种新的并行网格粗化算法一多阶段并行RS算法（MPRS）。我们将新算法集成到了高性能预条件子软件包Hypre中。大量数值实验结果显示,新算法适合更广泛的问题,相对其他并行粗化算法,明显地改善了AMG并行计算的可扩展性。对三维27点格式有限差分离散的Poisson方程,在64个处理机上并行AMG求解,含8百万个未知量,新算法比RS3算法减少了近60的三维Poisson方程,近32万个未知量,在16个处理机上并行AMG—GMRES求解,新算法所需的迭代步数大约为其他粗化算法的一半,显示了很好的算法可扩展性。     

关于多孔介质可混溶流体Galerkin方法后处理

本文利用林群教授[4]介绍的有限元方法，对藕合半线性问题做后处理，使整体解超一阶收敛．     

非对称椭圆型变分问题的多重网格法

1.引言 多重网格法是求解椭圆型方程边值问题的一种有效的迭代解法,其特点是方法收敛速度与网格长度h无关,因此为达到具有相同精度的解只需O(N)次的运算量(N为离散后的线性方程组未知数个数).从而比一般的迭代法有效得多.现在这个方法已被广泛     

非线性特征值问题的二次近似方法

本文研究求解非线性特征值问题的数值方法.基于矩阵值函数的二次近似,将非线性特征值问题转化为二次特征值问题,提出了求解非线性特征值问题的逐次二次近似方法,分析了该方法的收敛性.结合求解二次特征值问题的Arnoldi方法和Jacobi-Davidson方法,给出求解非线性特征值问题的一些二次近似方法.数值结果表明本文所给算法是有效的.     

MULTILEVEL ITERATION METHODS FOR SOLVING LINEAR ILL-POSED PROBLEMS

In this paper we develop multilevel iteration methods for solving linear systems resulting from the Galerkin method and Tikhonov regularization for ill-posed problems, The algorithm and its convergence analysis ave presented in an abstract framework.     

单障碍问题区域分解法的单调收敛性与收敛速度估计

本文我们考虑一类典型的椭圆型算子的障碍问题的区域分解算法,分析算法的单调收敛性并给出相应的收敛速度估计.障碍问题有着重要的物理背景（参见[3,9]）.近些年来,有关障碍问题的区域分解法方面的研究已经有一些成果.关于线性算子情形,读者可参看[1,2,5,7,8,10,12,13,14,15,17]等文献,而对于非线性算子情形,读者可参看[4,6,16,18].在这些文献中,已经有部分涉及到算法的收敛速度估计.例如,文[15,16]给出了有限元区域分解算法的迭代误差的渐近最大模估计,文[13]给出了求解具M-阵的有限维互补问题     

MORTAR型旋转Q_1元的多重网格方法

本文讨论了mortar型旋转Q_1元的多重网格方法.证明了W循环的多重网格法是最优的,即收敛率与网格尺寸及层数无关.同时给出了一种可变的V循环多重网格算法,得到了一个条件数一致有界的预条件子.最后,数值试验验证了我们的理论结果.