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.     

Comparison of multigrid algorithms for high‐order continuous finite element discretizations

We present a comparison of different multigrid approaches for the solution of systems arising from high‐order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the pointwise Jacobi, the Chebyshev‐accelerated Jacobi, and the symmetric successive over‐relaxation smoothers, as well as elementwise block Jacobi smoothing. Three approaches for the multigrid hierarchy are compared: (1) high‐order h‐multigrid, which uses high‐order interpolation and restriction between geometrically coarsened meshes; (2) p‐multigrid, in which the polynomial order is reduced while the mesh remains unchanged, and the interpolation and restriction incorporate the different‐order basis functions; and (3) a first‐order approximation multigrid preconditioner constructed using the nodes of the high‐order discretization. This latter approach is often combined with algebraic multigrid for the low‐order operator and is attractive for high‐order discretizations on unstructured meshes, where geometric coarsening is difficult. Based on a simple performance model, we compare the computational cost of the different approaches. Using scalar test problems in two and three dimensions with constant and varying coefficients, we compare the performance of the different multigrid approaches for polynomial orders up to 16. Overall, both h‐multigrid and p‐multigrid work well; the first‐order approximation is less efficient. For constant coefficients, all smoothers work well. For variable coefficients, Chebyshev and symmetric successive over‐relaxation smoothing outperform Jacobi smoothing. While all of the tested methods converge in a mesh‐independent number of iterations, none of them behaves completely independent of the polynomial order. When multigrid is used as a preconditioner in a Krylov method, the iteration number decreases significantly compared with using multigrid as a solver. Copyright © 2015 John Wiley & Sons, Ltd.     

Towards optimal Runge-Kutta smoothers for multigrid methods for unsteady flow problems

We consider Runge-Kutta smoothers in a dual time stepping multigrid method for unsteady flow problems. These smoothers are easily parallelizable and Jacobian-free, making them very attractive for 3D calculations. Existing methods have been designed for steady flows, leading to slow convergence for unsteady problems. Here we determine the free parameters of the smoother to provide optimal damping for high frequency components for the unsteady linear advection equation. This is compared with an RK smoother designed for steady state problems, as commonly used in CFD codes. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Analysis of a Class of Parallel Multigrid Smoothers

This paper proposes and analyzes a class of multigrid smoothers called the parallel multiplicative (PM) smoother by subspace decomposition techniques. It shows that the well known additive and multiplicative smoothers and the JSOR smoother are special cases of the PM smoother, and their smoothing properties can be obtained directly from the PM analysis. Moreover, numerical results are presented in this paper to show that the JSOR smoother is more robust and effective than the damped Jacobi smoother on current MIMD parallel computers. AMS subject classification (2000) 65N55, 65Y05.Received May 2004. Revised September 2004. Communicated by Per Lötstedt.Dexuan Xie: This work was partially supported by the National Science Foundation through grant DMS-0241236.     

Convergence analysis of HSS-multigrid methods for second-order nonselfadjoint elliptic problems

In this paper, the multigrid methods using Hermitian/skew-Hermitian splitting (HSS) iteration as smoothers are investigated. These smoothers also include the modified additive and multiplicative smoothers which result from subspace decomposition. Without full elliptic regularity assumption, it is shown that the multigrid methods with these smoothers converge uniformly for second-order nonselfadjoint elliptic boundary value problems if the mesh size of the coarsest grid is sufficiently small (but independent of the number of the multigrid levels). Numerical results are reported to confirm the theoretical analysis.     

Uniform convergence of the multigrid V-cycle for an anisotropic problem

In this paper, we consider the linear systems arising from the standard finite element discretizations of certain second order anisotropic problems with variable coefficients on a rectangle. We study the performance of a V-cycle multigrid method applied to the finite element equations. Since the usual ``regularity and approximation' assumption does not hold for the anisotropic finite element problems, the standard multigrid convergence theory cannot be applied directly. In this paper, a modification of the theory of Braess and Hackbusch will be presented. We show that the V-cycle multigrid iteration with a line smoother is a uniform contraction in the energy norm. In the verification of the hypotheses in our theory, we use a weighted -norm estimate for the error in the Galerkin finite element approximation and a smoothing property of the line smoothers which is proved in this paper.

     

Some combinatorial identities via Fibonacci numbers

The Pascal matrix and the Stirling matrices of the first kind and the second kind obtained from the Fibonacci matrix are studied, respectively. Also, we obtain combinatorial identities from the matrix representation of the Pascal matrix, the Stirling matrices of the first kind and the second kind and the Fibonacci matrix.     

An adaptive finite element method for singular parabolic equations

Summary. In this paper we consider additive Schwarz-type iteration methods for saddle point problems as smoothers in a multigrid method. Each iteration step of the additive Schwarz method requires the solutions of several small local saddle point problems. This method can be viewed as an additive version of a (multiplicative) Vanka-type iteration, well-known as a smoother for multigrid methods in computational fluid dynamics. It is shown that, under suitable conditions, the iteration can be interpreted as a symmetric inexact Uzawa method. In the case of symmetric saddle point problems the smoothing property, an important part in a multigrid convergence proof, is analyzed for symmetric inexact Uzawa methods including the special case of the additive Schwarz-type iterations. As an example the theory is applied to the Crouzeix-Raviart mixed finite element for the Stokes equations and some numerical experiments are presented. Mathematics Subject Classification (1991):65N22, 65F10, 65N30Supported by the Austrian Science Foundation (FWF) under the grant SFB F013}\and Walter Zulehner     

Fast Solvers of Fredholm Optimal Control Problems

<正>The formulation of optimal control problems governed by Fredholm integral equations of second kind and an efficient computational framework for solving these control problems is presented.Existence and uniqueness of optimal solutions is proved. A collective Gauss-Seidel scheme and a multigrid scheme are discussed.Optimal computational performance of these iterative schemes is proved by local Fourier analysis and demonstrated by results of numerical experiments.     

Algebraic multigrid for complex symmetric matrices and applications

This paper is concerned with the numerical study of an algebraic multigrid preconditioner for complex symmetric system matrices. We use several different Krylov subspace methods as an outer iteration, namely the QMR method proposed by Freund and Nachtigal, the BiCGCR method of Clemens, and the CSYM method of Bunse-Gerstner and Stoever. In addition, we compare the results with the standard Jacobi preconditioner for complex symmetric problems. We test our approach on the numerical simulation of high-voltage insulators.     

Multilevel Schwarz methods

Summary We consider the solution of the algebraic system of equations which result from the discretization of second order elliptic equations. A class of multilevel algorithms are studied using the additive Schwarz framework. We establish that the condition number of the iteration operators are bounded independent of mesh sizes and the number of levels. This is an improvement on Dryja and Widlund's result on a multilevel additive Schwarz algorithm, as well as Bramble, Pasciak and Xu's result on the BPX algorithm. Some multiplicative variants of the multilevel methods are also considered. We establish that the energy norms of the corresponding iteration operators are bounded by a constant less than one, which is independent of the number of levels. For a proper ordering, the iteration operators correspond to the error propagation operators of certain V-cycle multigrid methods, using Gauss-Seidel and damped Jacobi methods as smoothers, respectively.This work was supported in part by the National Science Foundation under Grants NSF-CCR-8903003 at Courant Institute of Mathematical Sciences, New York University and NSF-ASC-8958544 at Department of Computer Science, University of Maryland.     

线性互补问题模系多重网格方法的AMSOR光滑算子

为了改进求解大型稀疏线性互补问题模系多重网格方法的收敛速度和计算时间,本文采用加速模系超松弛(AMSOR)迭代方法作为光滑算子.局部傅里叶分析和数值结果表明此光滑算子能有效地改进模系多重网格方法的收敛因子、迭代次数和计算时间.     

Optimal polynomial smoothers for multigrid V-cycles

The idea of using polynomial methods to improve simple smoother iterations within a multigrid method for a symmetric positive definite system is revisited. A two-level bound going back to Hackbusch is optimized by a very simple iteration, a close cousin of the Chebyshev semi-iterative method, but based on the Chebyshev polynomials of the fourth instead of first kind. A full V-cycle bound for general polynomial smoothers is derived using the V-cycle theory of McCormick. The fourth-kind Chebyshev iteration is quasi-optimal for the V-cycle bound. The optimal polynomials for the V-cycle bound can be found numerically, achieving about an 18% lower error contraction factor bound than the fourth-kind Chebyshev iteration, asymptotically as the number of smoothing steps $k\to \infty$. Implementation of the optimized iteration is discussed, and the performance of the polynomial smoothers is illustrated with numerical examples.     

THE KACANOV METHOD FOR A NONLINEAR VARIATIONAL INEQUALITY OF THE SECOND KIND ARISING IN ELASTOPLASTICITY

The authors first prove a convergence result on the Ka(?)anov method for solving generalnonlinear variational inequalities of the second kind and then apply the Kacanov method tosolve a nonlinear variational inequality of the second kind arising in elastoplasticity. In additionto the convergence result, an a posteriori error estimate is shown for the Kacanov iterates. Ineach step of the Ka(?)anov iteration, one has a (linear) variational inequality of the secondkind, which can be solved by using a regularization technique. The Ka(?)anov iteration andthe regularization technique together provide approximations which can be readily computednumerically. An a posteriori error estimate is derived for the combined effect of the Ka(?)anoviteration and the regularization.     

(2+1)维五次非线性薛定谔方程的无穷序列新解

利用第二种椭圆方程的解和B¨acklund变换,获得了(2+1)维五次非线性薛定谔方程的新解.这些解是由Jacobi椭圆函数、三角函数、Riemann theta函数和指数函数组成的无穷序列新解.     

Multigrid algorithms for a vertex–centered covolume method for elliptic problems

Summary. We analyze V–cycle multigrid algorithms for a class of perturbed problems whose perturbation in the bilinear form preserves the convergence properties of the multigrid algorithm of the original problem. As an application, we study the convergence of multigrid algorithms for a covolume method or a vertex–centered finite volume element method for variable coefficient elliptic problems on polygonal domains. As in standard finite element methods, the V–cycle algorithm with one pre-smoothing converges with a rate independent of the number of levels. Various types of smoothers including point or line Jacobi, and Gauss-Seidel relaxation are considered. Received August 19, 1999 / Revised version received July 10, 2000 / Published online June 7, 2001     

Modulus‐based multigrid methods for linear complementarity problems

By employing modulus‐based matrix splitting iteration methods as smoothers, we establish modulus‐based multigrid methods for solving large sparse linear complementarity problems. The local Fourier analysis is used to quantitatively predict the asymptotic convergence factor of this class of multigrid methods. Numerical results indicate that the modulus‐based multigrid methods of the W‐cycle can achieve optimality in terms of both convergence factor and computing time, and their asymptotic convergence factors can be predicted perfectly by the local Fourier analysis of the corresponding modulus‐based two‐grid methods.     

三对角矩阵的特征值及其应用

给出了计算一种三对角矩阵的特征值和特征向量的公式.利用矩阵的特征值理论证明了一些三角恒等式,特别是一些与Fibonacci数和第二类Chebyshev多项式有关的三角恒等式.     

Nonlinear multigrid method for solving the anisotropic image denoising models

In this paper, we study a nonlinear multigrid method for solving a general image denoising model with two L ¹-regularization terms. Different from the previous studies, we give a simpler derivation of the dual formulation of the general model by augmented Lagrangian method. In order to improve the convergence rate of the proposed multigrid method, an improved dual iteration is proposed as its smoother. Furthermore, we apply the proposed method to the anisotropic ROF model and the anisotropic LLT model. We also give the local Fourier analysis (LFAs) of the Chambolle’s dual iterations and a modified smoother for solving these two models, respectively. Numerical results illustrate the efficiency of the proposed method and indicate that such a multigrid method is more suitable to deal with large-sized images.     

第二类曲线(面)积分的向量学习法再探

以通量概念引入第二类曲面积分、以环流量概念引入第二类曲线积分,并用向量形式表达高斯公式、斯托克斯公式等关系,以期达到第二类曲线(面)积分部分的知识点符号表达简明、计算和公式容易记忆的目的.