A full multigrid method for semilinear elliptic equation

A full multigrid finite element method is proposed for semilinear elliptic equations. The main idea is to transform the solution of the semilinear problem into a series of solutions of the corresponding linear boundary value problems on the sequence of finite element spaces and semilinear problems on a very low dimensional space. The linearized boundary value problems are solved by some multigrid iterations. Besides the multigrid iteration, all other efficient numerical methods can also serve as the linear solver for solving boundary value problems. The optimality of the computational work is also proved. Compared with the existing multigrid methods which need the bounded second order derivatives of the nonlinear term, the proposed method only needs the Lipschitz continuation in some sense of the nonlinear term.     

A cascadic multigrid method for a kind of semilinear elliptic problem

In this paper, we analyze a cascadic multigrid method for semilinear elliptic problems in which the derivative of the semilinear term is Hölder continuous. We first investigate the standard finite element error estimates of this kind of problem. We then solve the corresponding discrete problems using the cascadic multigrid method. We prove that the algorithm has an optimal order of convergence in energy norm and quasi-optimal computational complexity. We also report some numerical results to support the theory.     

A full multigrid method for nonlinear eigenvalue problems

We introduce a type of full multigrid method for the nonlinear eigenvalue problem. The main idea is to transform the solution of the nonlinear eigenvalue problem into a series of solutions of the corresponding linear boundary value problems on the sequence of finite element spaces and nonlinear eigenvalue problems on the coarsest finite element space. The linearized boundary value problems are solved by some multigrid iterations. Besides the multigrid iteration, all other efficient iteration methods for solving boundary value problems can serve as the linear problem solver. We prove that the computational work of this new scheme is truly optimal, the same as solving the linear corresponding boundary value problem. In this case, this type of iteration scheme certainly improves the overfull efficiency of solving nonlinear eigenvalue problems. Some numerical experiments are presented to validate the efficiency of the new method.     

AN IMPROVED SEARCH-EXTENTION METHOD FOR SOLVING SEMILINEAR PDES

This article will combine the finite element method, the interpolated coefftcient finite element method, the eigenfunction expansion method, and the search-extension method to obtain the multiple solutions for semilinear elliptic equations. This strategy not only grently reduces the expensive computation, but also is successfully implemented to obtain multiple solutions for a class of semilinear elliptic boundary value problems with non-odd nonlinearity on some convex or nonconvex domains. Numerical solutions illustrated by their graphics for visualization will show the efficiency of the approach.     

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.     

Error estimates of the lumped mass finite element method for semilinear elliptic problems

We are concerned with the semilinear elliptic problems. We first investigate the L²-error estimate for the lumped mass finite element method. We then use the cascadic multigrid method to solve the corresponding discrete problem. On the basis of the finite element error estimates, we prove the optimality of the proposed multigrid method. We also report some numerical results to support the theory.     

Adaptive pseudo‐transient‐continuation‐Galerkin methods for semilinear elliptic partial differential equations

In this article, we investigate the application of pseudo‐transient‐continuation (PTC) schemes for the numerical solution of semilinear elliptic partial differential equations, with possible singular perturbations. We will outline a residual reduction analysis within the framework of general Hilbert spaces, and, subsequently, use the PTC‐methodology in the context of finite element discretizations of semilinear boundary value problems. Our approach combines both a prediction‐type PTC‐method (for infinite dimensional problems) and an adaptive finite element discretization (based on a robust a posteriori residual analysis), thereby leading to a fully adaptive PTC ‐Galerkin scheme. Numerical experiments underline the robustness and reliability of the proposed approach for different examples.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 2005–2022, 2017     

A new type of full multigrid method for the elasticity eigenvalue problem

This paper introduces a new type of full multigrid method for the elasticity eigenvalue problem. The main idea is to avoid solving large scale elasticity eigenvalue problem directly by transforming the solution of the elasticity eigenvalue problem into a series of solutions of linear boundary value problems defined on a multilevel finite element space sequence and some small scale elasticity eigenvalue problems defined on the coarsest correction space. The involved linear boundary value problems will be solved by performing some multigrid iterations. Besides, some efficient techniques such as parallel computing and adaptive mesh refinement can also be absorbed in our algorithm. The efficiency and validity of the multigrid methods are verified by several numerical experiments.     

New intergrid transfer operator in multigrid method for P1-nonconforming finite element method

For a second-order elliptic boundary value problem, We develop an intergrid transfer operator in multigrid method for the P₁-nonconforming finite element method. This intergrid transfer operator needs smaller computation than previous intergrid transfer operators. Multigrid method with this operator converges well.     

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.     

Multilevel methods for mixed finite elements in three dimensions

In this paper we consider second order scalar elliptic boundary value problems posed over three–dimensional domains and their discretization by means of mixed Raviart–Thomas finite elements [18]. This leads to saddle point problems featuring a discrete flux vector field as additional unknown. Following Ewing and Wang [26], the proposed solution procedure is based on splitting the flux into divergence free components and a remainder. It leads to a variational problem involving solenoidal Raviart–Thomas vector fields. A fast iterative solution method for this problem is presented. It exploits the representation of divergence free vector fields as s of the –conforming finite element functions introduced by Nédélec [43]. We show that a nodal multilevel splitting of these finite element spaces gives rise to an optimal preconditioner for the solenoidal variational problem: Duality techniques in quotient spaces and modern algebraic multigrid theory [50, 10, 31] are the main tools for the proof. Received November 4, 1996 / Revised version received February 2, 1998     

Preconditioning spectral element schemes for definite and indefinite problems

Spectral element schemes for the solution of elliptic boundary value problems are considered. Preconditioning methods based on finite difference and finite element schemes are implemented. Numerical experiments show that inverting the preconditioner by a single multigrid iteration is most efficient and that the finite difference preconditioner is superior to the finite element one for both definite and indefinite problems. A multigrid preconditioner is also derived from the finite difference preconditioner and is found suitable for the CGS acceleration method. It is pointed out that, for the finite difference and finite element preconditioners, CGS does not always converge to the accurate algebraic solution. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 535–543, 1999     

On the convergence of nonnested multigrid methods with nested spaces on coarse grids

Multigrid methods for discretized partial differential problems using nonnested conforming and nonconforming finite elements are here defined in the general setting. The coarse‐grid corrections of these multigrid methods make use of different finite element spaces from those on the finest grid. In general, the finite element spaces on the finest grid are nonnested, while the spaces are nested on the coarse grids. An abstract convergence theory is developed for these multigrid methods for differential problems without full elliptic regularity. This theory applies to multigrid methods of nonnested conforming and nonconforming finite elements with the coarse‐grid corrections established on nested conforming finite element spaces. Uniform convergence rates (independent of the number of grid levels) are obtained for both the V and W‐cycle methods with one smoothing on all coarse grids and with a sufficiently large number of smoothings solely on the finest grid. In some cases, these uniform rates are attained even with one smoothing on all grids. The present theory also applies to multigrid methods for discretized partial differential problems using mixed finite element methods. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 265–284, 2000     

P1-NONCONFORMING QUADRILATERAL FINITE VOLUME ELEMENT METHOD AND ITS CASCADIC MULTIGRID ALGORITHM FOR ELLIPTIC PROBLEMS

In this paper,we discuss the finite volume element method of P_1-nonconforming quadri-lateral element for elliptic problems and obtain optimal error estimates for general quadri-lateral partition.An optimal eascadie multigrid algorithm is proposed to solve the non-symmetric large-scale system resulting from such discretization.Numerical experimentsare reported to support our theoretical results.     

Mixed Finite Element Methods for the Ferrofluid Model with Magnetization Paralleled to the Magnetic Field

Mixed finite element methods are considered for a ferrofluid flow model with magnetization paralleled to the magnetic field. The ferrofluid model is a coupled system of the Maxwell equations and the incompressible Navier-Stokes equations. By skillfully introducing some new variables, the model is rewritten as several decoupled subsystems that can be solved independently. Mixed finite element formulations are given to discretize the decoupled systems with proper finite element spaces. Existence and uniqueness of the mixed finite element solutions are shown, and optimal order error estimates are obtained under some reasonable assumptions. Numerical experiments confirm the theoretical results.     

The analysis of multigrid algorithms for cell centered finite difference methods

In this paper, we examine multigrid algorithms for cell centered finite difference approximations of second order elliptic boundary value problems. The cell centered application gives rise to one of the simplest non-variational multigrid algorithms. We shall provide an analysis which guarantees that the W-cycle and variable V-cycle multigrid algorithms converge with a rate of iterative convergence which can be bounded independently of the number of multilevel spaces. In contrast, the natural variational multigrid algorithm converges much more slowly.     

L ∞-error estimates of triangular mixed finite element methods for optimal control problems governed by semilinear elliptic equations

We look at L ^∞-error estimates for convex quadratic optimal control problems governed by nonlinear elliptic partial differential equations. In so doing, use is made of mixed finite element methods. The state and costate are approximated by the lowest order Raviart-Thomas mixed finite element spaces, and the control, by piecewise constant functions. L ^∞-error estimates of optimal order are derived for a mixed finite element approximation of a semilinear elliptic optimal control problem. Finally, numerical tests are presented which confirm our theoretical results.     

kth Order convergence for semilinear elliptic boundary value problems

The method of quasilinearization coupled with the method of upper and lower solutions, is applied to the semilinear elliptic boundary value problems. At the same time, the result of kth convergence for the semilinear boundary value problems is obtained via the idea of Taylors approximation.     

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

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

A quadrature finite element method for semilinear second‐order hyperbolic problems

In this work we propose and analyze a fully discrete modified Crank–Nicolson finite element (CNFE) method with quadrature for solving semilinear second‐order hyperbolic initial‐boundary value problems. We prove optimal‐order convergence in both time and space for the quadrature‐modified CNFE scheme that does not require nonlinear algebraic solvers. Finally, we demonstrate numerically the order of convergence of our scheme for some test problems. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008