一类新的瀑布型多重网格法

对椭圆问题提出了一类新的瀑布型多重网格法.     

抛物问题的mortar有限元逼近的瀑布型多重网格法

用瀑布型多重网格法解决椭圆、抛物问题，已有不少研究工作[1-2]，本文对抛物问题的mortar有限元的全离散格式提出瀑布型多重网格法，证明了该方法是最优的，即具有最优精确度和复杂度．     

一类非对称椭圆问题瀑布型多重网格法

本将瀑布型多重网格法用于求解非对称椭圆边值问题，数值结果表明算法是有效的。     

一类非线性椭圆问题的瀑布型多重网格法

本对二阶非线性椭圆问题提出一种瀑布型多重网格法，数值实验表明该算法非常有效，当d＝1时，给出了理论结果。     

半线性问题的瀑布型多重网格法

本文提出了求解半线性椭圆问题的一类新的瀑布型多重网格法，在网格层数固定的条件下证明了此法的最优阶收敛性。     

经济的瀑布型多重网格法(ECMG)

提出一种新的经济的瀑布型多重网格法(ECMG), 和通常的瀑布型多重网格法(CMG)的工作量相比, 新的瀑布型多重网格法在每层上的工作量 都相应的减少, 尤其是粗网格上的工作量将大量的减少. 新格式的误差和通常的 瀑布型多重网格法一样, 都具有最优精度. 最后给出数值算例 来验证所得理论的结果.     

抛物问题非协调元多重网格法

抛物问题非协调元多重网格法周叔子,文承标（湖南大学应用数学系）ＮＯＮＣＯＮＦＯＲＭＩＮＧＥＬＥＭＥＮＴＭＵＬＴＩＧＲＩＤＭＥＴＨＯＤＦＯＲＭＲＡＢＯＬＩＣＥＱＵＡＴＩＯＮＳ￥ＺｈｏｕＳｈｕ－ｚｉ;ＷｅｎＣｈｅｎｇ－ｂｉａｏ（ＨｕｎａｎＵｎｉｖｅｒｓｉ...     

半线性椭圆型问题Mortar有限元逼近的瀑布型多重网格法

Mortar有限元法作为一个非协调的区域分解技术已得到许多研究者的关注(如文献[2]、[5]等)。本文对半线性椭圆型问题的Mortar有限元逼近提出了瀑布型多重网格法,并给出了此法的误差估计和计算复杂度估计定理。     

解二阶椭圆型变分不等式的瀑布型多重网格法

本文将瀑布型多重网格法推广应用于求解二阶椭圆型变分不等式并给出了一些数值例子。数值算例表明该算法是有效的。     

基于超收敛和外推方法的一类新的瀑布型多重网格方法

本文运用有限元超收敛理论和外推技巧提出了一类求解椭圆型方程的新的瀑布型多重网格方法(ACMG).数值结果表明新方法具有超收敛性.     

Cascadic Multigrid for Finite Volume Methods for Elliptic Problems

In this paper, some effective cascadic multigrid methods are proposed for solving the large scale symmetric or nonsymmetric algebraic systems arising from the finite volume methods for second order elliptic problems. It is shown that these algorithms are optimal in both accuracy and computational complexity. Numerical experiments are reported to support our theory.     

Standard and Economical Cascadic Multigrid Methods for the Mortar Finite Element Methods

In this paper, standard and economical cascadic multigrid methods are con-sidered for solving the algebraic systems resulting from the mortar finite element meth-ods. Both cascadic multigrid methods do not need full elliptic regularity, so they can be used to tackle more general elliptic problems. Numerical experiments are reported to support our theory.     

Cascadic Multigrid Method for Isoparametric Finite Element with Numerical Integration

The purpose of this paper is to study the cascadic multigrid method for the secondorder elliptic problems with curved boundary in two-dimension which are discretized by the isoparametric finite element method with numerical integration. We show that the CCG method is accurate with optimal complexity and traditional multigrid smoother (likesymmetric Gauss-Seidel, SSOR or damped Jacobi iteration) is accurate with suboptimal complexity.     

A Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians

In this paper, we develop a cascadic multigrid algorithm for fast computation of the Fiedler vector of a graph Laplacian, namely, the eigenvector corresponding to the second smallest eigenvalue. This vector has been found to have applications in fields such as graph partitioning and graph drawing. The algorithm is a purely algebraic approach based on a heavy edge coarsening scheme and pointwise smoothing for refinement. To gain theoretical insight, we also consider the related cascadic multigrid method in the geometric setting for elliptic eigenvalue problems and show its uniform convergence under certain assumptions. Numerical tests are presented for computing the Fiedler vector of several practical graphs, and numerical results show the efficiency and optimality of our proposed cascadic multigrid algorithm.     

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…     

A Projected Algebraic Multigrid Method for Linear Complementarity Problems

We present an algebraic version of an iterative multigrid method for obstacle problems, called projected algebraic multigrid (PAMG) here. We show that classical algebraic multigrid algorithms can easily be extended to deal with this kind of problem. This paves the way for efficient multigrid solution of obstacle problems with partial differential equations arising, for example, in financial engineering.     

A Multigrid Method for Nonlinear Parabolic Problems

1.IntroductionThefiniteelementmethodsforsolvingnonlinearparabolicproblemsarestudiedbymanyauthors,suchasDouglasandDupont[5],Wheelerl4],Luskin[3lfetc.Theyproposedvariouswaysofcomputingtheproblemsandprovedtheoptimalorderconvergenceratesofthemethods,suchasthelinearizedmethods,thepredictor-correctormethods,theextraPolationmethods,thealternatingdirectiollmethodsandtheiterativemethodsl2]1etc.Themultigridmethodsforsolvingparabolicproblemsarestudiedbysomeauthors,suchasHachbuschl14,15],BankandDupontl…