Two-grid Methods for Finite Volume Element Approximations of Nonlinear Sobolev Equations

In this article, two-grid methods are studied for solving nonlinear Sobolev equation using the finite volume element method. The methods are based on one coarse grid space and one fine grid space. The nonsymmetric and nonlinear iterations are only executed on the coarse grid (with grid size H), and the fine grid solution (with grid size h) can be obtained in a single symmetric and linear step. The optimal H¹ error estimates are presented for the proposed methods, which show that the two-grid methods achieve optimal approximation as long as the mesh sizes satisfy h = 𝒪(H³|ln H|). As a result, solving such a large class of nonlinear Sobolev equations will not be much more difficult than solving one linearized equation.     

Two-grid methods for characteristic finite volume element solution of semilinear convection-diffusion equations

Two-grid methods for characteristic finite volume element solutions are presented for a kind of semilinear convection-dominated diffusion equations. The methods are based on the method of characteristics, two-grid method and the finite volume element method. The nonsymmetric and nonlinear iterations are only executed on the coarse grid (with grid size H). And the fine-grid solution (with grid size h) can be obtained by a single symmetric and linear step. It is proved that the coarse grid can be much coarser than the fine grid. The two-grid methods achieve asymptotically optimal approximation as long as the mesh sizes satisfy H = O(h^1/3).     

Two-grid methods for finite volume element approximations of nonlinear parabolic equations

Two-grid methods are studied for solving a two dimensional nonlinear parabolic equation using finite volume element method. The methods are based on one coarse-grid space and one fine-grid space. The nonsymmetric and nonlinear iterations are only executed on the coarse grid and the fine-grid solution can be obtained in a single symmetric and linear step. It is proved that the coarse grid can be much coarser than the fine grid. The two-grid methods achieve asymptotically optimal approximation as long as the mesh sizes satisfy h=O(H³|lnH|)$h=O\left(H^3|lnH|\right)$. As a result, solving such a large class of nonlinear parabolic equations will not be much more difficult than solving one single linearized equation.     

A two-grid finite element method for the Allen-Cahn equation with the logarithmic potential

In this paper, we present a two-grid finite element method for the Allen-Cahn equation with the logarithmic potential. This method consists of two steps. In the first step, based on a fully implicit finite element method, the Allen-Cahn equation is solved on a coarse grid with mesh size H. In the second step, a linearized system whose nonlinear term is replaced by the value of the first step is solved on a fine grid with mesh size h. We give the energy stabilities of the traditional finite element method and the two-grid finite element method. The optimal convergence order of the two-grid finite element method in H¹ norm is achieved when the mesh sizes satisfy h = O(H²). Numerical examples are given to demonstrate the validity of the proposed scheme. The results show that the two-grid method can save the CPU time while keeping the same convergence rate.     

Two-grid finite volume element method for linear and nonlinear elliptic problems

Two-grid finite volume element discretization techniques, based on two linear conforming finite element spaces on one coarse and one fine grid, are presented for the two-dimensional second-order non-selfadjoint and indefinite linear elliptic problems and the two-dimensional second-order nonlinear elliptic problems. With the proposed techniques, solving the non-selfadjoint and indefinite elliptic problem on the fine space is reduced into solving a symmetric and positive definite elliptic problem on the fine space and solving the non-selfadjoint and indefinite elliptic problem on a much smaller space; solving a nonlinear elliptic problem on the fine space is reduced into solving a linear problem on the fine space and solving the nonlinear elliptic problem on a much smaller space. Convergence estimates are derived to justify the efficiency of the proposed two-grid algorithms. A set of numerical examples are presented to confirm the estimates. The work is supported by the National Natural Science Foundation of China (Grant No: 10601045).     

一类非线性对流扩散方程两重网格特征有限元方法及误差估计

主要研究了一类非线性对流扩散方程的全离散特征有限元方法的两重网格算法及其误差估计.首先在网格步长为H的粗网格上计算一个较小的非线性问题,然后利用一阶牛顿迭代和粗网格解将网格步长为h的细网格上的非线性问题转化为线性问题求解.由于非线性问题的求解仅在粗网格上进行,该两重网格算法可以节省大量的计算工作量,同时具有较高的精度,证明了该两重网格算法L~2模先验误差估计结果为O(△t+h~2+H~(4-d/2)),其中d为空间维数.     

Two-grid finite volume element methods for semilinear parabolic problems

Two-grid finite volume element methods, based on two linear conforming finite element spaces on one coarse grid and one fine grid, are presented and studied for two-dimensional semilinear parabolic problems. With the proposed techniques, solving the nonsymmetric and nonlinear system on the fine space is reduced to solving a symmetric and linear system on the fine space and solving the nonsymmetric and nonlinear system on a much smaller space. Convergence estimates are derived to justify the efficiency of the proposed two-grid algorithms. It is proved that the coarse grid can be much coarser than the fine grid. As a result, solving such a large class of semilinear parabolic problems will not be much more difficult than solving one single linearized equation. In the end a numerical example is presented to validate the usefulness and efficiency of the method.     

Two‐Grid method for nonlinear parabolic equations by expanded mixed finite element methods

In this article, we develop a two‐grid algorithm for nonlinear reaction diffusion equation (with nonlinear compressibility coefficient) discretized by expanded mixed finite element method. The key point is to use two‐grid scheme to linearize the nonlinear term in the equations. The main procedure of the algorithm is solving a small‐scaled nonlinear equations on the coarse grid and dealing with a linearized system on the fine space using the Newton iteration with the coarse grid solution. Error estimation to the expanded mixed finite element solution is analyzed in detail. We also show that two‐grid solution achieves the same accuracy as long as the mesh sizes satisfy H = O(h^1/2). Two numerical experiments are given to verify the effectiveness of the algorithm. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Two grid finite element discretization method for semi‐linear hyperbolic integro‐differential equations

In this paper, we will investigate a two grid finite element discretization method for the semi‐linear hyperbolic integro‐differential equations by piecewise continuous finite element method. In order to deal with the semi‐linearity of the model, we use the two grid technique and derive that once the coarse and fine mesh sizes H, h satisfy the relation h = H² for the two‐step two grid discretization method, the two grid method achieves the same convergence accuracy as the ordinary finite element method. Both theoretical analysis and numerical experiments are given to verify the results.     

A two-grid method with expanded mixed element for nonlinear reaction-diffusion equations

Expanded mixed finite element approximation of nonlinear reaction-diffusion equations is discussed. The equations considered here are used to model the hydrologic and bio-geochemical phenomena. To linearize the mixed-method equations, we use a two-grid method involving a small nonlinear system on a coarse gird of size H and a linear system on a fine grid of size h. Error estimates are derived which demonstrate that the error is O(△t + h k+1 + H 2k+2 d/2 ) (k ≥ 1), where k is the degree of the approximating space for the primary variable and d is the spatial dimension. The above estimates are useful for determining an appropriate H for the coarse grid problems.     

A second order accuracy for a full discretized time-dependent Navier–Stokes equations by a two-grid scheme

We study a second-order two-grid scheme fully discrete in time and space for solving the Navier–Stokes equations. The two-grid strategy consists in discretizing, in the first step, the fully non-linear problem, in space on a coarse grid with mesh-size H and time step Δt and, in the second step, in discretizing the linearized problem around the velocity u _H computed in the first step, in space on a fine grid with mesh-size h and the same time step. The two-grid method has been applied for an analysis of a first order fully-discrete in time and space algorithm and we extend the method to the second order algorithm. This strategy is motivated by the fact that under suitable assumptions, the contribution of u _H to the error in the non-linear term, is measured in the L ² norm in space and time, and thus has a higher-order than if it were measured in the H ¹ norm in space. We present the following results: if h ² = H ³ = (Δt)², then the global error of the two-grid algorithm is of the order of h ², the same as would have been obtained if the non-linear problem had been solved directly on the fine grid.     

An optimal nonlinear Galerkin method with mixed finite elements for the steady Navier‐Stokes equations

An optimal nonlinear Galerkin method with mixed finite elements is developed for solving the two‐dimensional steady incompressible Navier‐Stokes equations. This method is based on two finite element spaces X_H and X_h for the approximation of velocity, defined on a coarse grid with grid size H and a fine grid with grid size h ? H, respectively, and a finite element space M_h for the approximation of pressure. We prove that the difference in appropriate norms between the solutions of the nonlinear Galerkin method and a classical Galerkin method is of the order of H⁵. If we choose H = O(h^2/5), these two methods have a convergence rate of the same order. We numerically demonstrate that the optimal nonlinear Galerkin method is efficient and can save a large amount of computational time. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 762–775, 2003.     

A two-grid method based on Newton iteration for the Navier–Stokes equations

In this paper, we consider a two-grid method for resolving the nonlinearity in finite element approximations of the equilibrium Navier–Stokes equations. We prove the convergence rate of the approximation obtained by this method. The two-grid method involves solving one small, nonlinear coarse mesh system and two linear problems on the fine mesh which have the same stiffness matrix with only different right-hand side. The algorithm we study produces an approximate solution with the optimal asymptotic in h and accuracy for any Reynolds number. Numerical example is given to show the convergence of the method.     

A two‐grid characteristic finite volume element method for semilinear advection‐dominated diffusion equations

A two‐grid finite volume element method, combined with the modified method of characteristics, is presented and analyzed for semilinear time‐dependent advection‐dominated diffusion equations in two space dimensions. The solution of a nonlinear system on the fine‐grid space (with grid size h) is reduced to the solution of two small (one linear and one nonlinear) systems on the coarse‐grid space (with grid size H) and a linear system on the fine‐grid space. An optimal error estimate in H¹ ‐norm is obtained for the two‐grid method. It shows that the two‐grid method achieves asymptotically optimal approximation, as long as the mesh sizes satisfy h = O(H²). Numerical example is presented to validate the usefulness and efficiency of the method. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Fast calculation based on a spatial two-grid finite element algorithm for a nonlinear space–time fractional diffusion model

In this article, a spatial two-grid finite element (TGFE) algorithm is used to solve a two-dimensional nonlinear space–time fractional diffusion model and improve the computational efficiency. First, the second-order backward difference scheme is used to formulate the time approximation, where the time-fractional derivative is approximated by the weighted and shifted Grünwald difference operator. In order to reduce the computation time of the standard FE method, a TGFE algorithm is developed. The specific algorithm is to iteratively solve a nonlinear system on the coarse grid and then to solve a linear system on the fine grid. We prove the scheme stability of the TGFE algorithm and derive a priori error estimate with the convergence result O(Δt² + h^{r + 1 − η} + H^{2r + 2 − 2η}) . Finally, through a two-dimensional numerical calculation, we improve the computational efficiency and reduce the computation time by the TGFE algorithm.     

Numerical analysis of a modified finite element nonlinear Galerkin method

Summary. A fully discrete modified finite element nonlinear Galerkin method is presented for the two-dimensional equation of Navier-Stokes type. The spatial discretization is based on two finite element spaces X_H and X_h defined on a coarse grid with grid size H and a fine grid with grid size h << H, respectively; the time discretization is based on the Euler explicit scheme with respect to the nonlinear term. We analyze the stability and convergence rate of the method. Comparing with the standard finite element Galerkin method and the nonlinear Galerkin method, this method can admit a larger time step under the same convergence rate of same order. Hence this method can save a large amount of computational time. Finally, we provide some numerical tests on this method, the standard finite element Galerkin method, and the nonlinear Galerkin method, which are in a good agreement with the theoretical analysis.Mathematics Subject Classification (2000): 35Q30, 65M60, 65N30, 76D05     

Two-grid stabilized algorithms for the steady Navier–Stokes equations with damping

This paper presents and studies three two-grid stabilized quadratic equal-order finite element algorithms based on two local Gauss integrations for the steady Navier–Stokes equations with damping. In these algorithms, we first solve a stabilized nonlinear problem on a coarse grid, and then pass the coarse grid solution to a fine grid and solve a stabilized linear problem. Using some nonlinear analysis techniques, we analyze stability of the algorithms and derive optimal order error estimates of the approximate solutions. Theoretical and numerical results show that, when the algorithmic parameters are chosen appropriately, the accuracy of the approximate solutions computed by our two-grid stabilized algorithms is comparable to that of solving a fully stabilized nonlinear problem on the same fine grid; however, our two-grid algorithms save a large amount of CPU time than the one-grid stabilized algorithm.     

Analysis of two‐grid discretization scheme for semilinear hyperbolic equations by mixed finite element methods

In this paper, the full discrete scheme of mixed finite element approximation is introduced for semilinear hyperbolic equations. To solve the nonlinear problem efficiently, two two‐grid algorithms are developed and analyzed. In this approach, the nonlinear system is solved on a coarse mesh with width H, and the linear system is solved on a fine mesh with width h≪H. Error estimates and convergence results of two‐grid method are derived in detail. It is shown that if we choose in the first algorithm and in the second algorithm, the two‐grid algorithms can achieve the same accuracy of the mixed finite element solutions. Finally, the numerical examples also show that the two‐grid method is much more efficient than solving the nonlinear mixed finite element system directly.     

An efficient algorithm for the Schrödinger–Poisson eigenvalue problem

We present a new implementation of the two-grid method for computing extremum eigenpairs of self-adjoint partial differential operators with periodic boundary conditions. A novel two-grid centered difference method is proposed for the numerical solutions of the nonlinear Schrödinger–Poisson (SP) eigenvalue problem.We solve the Poisson equation to obtain the nonlinear potential for the nonlinear Schrödinger eigenvalue problem, and use the block Lanczos method to compute the first k   eigenpairs of the Schrödinger eigenvalue problem until they converge on the coarse grid. Then we perform a few conjugate gradient iterations to solve each symmetric positive definite linear system for the approximate eigenvector on the fine grid. The Rayleigh quotient iteration is exploited to improve the accuracy of the eigenpairs on the fine grid. Our numerical results show how the first few eigenpairs of the Schrödinger eigenvalue problem are affected by the dopant in the Schrödinger–Poisson (SP) system. Moreover, the convergence rate of eigenvalue computations on the fine grid is O(h³)$\mathrm{O}(h^3)$.     

A two-grid method with backtracking for the mixed Navier–Stokes/Darcy model

In this paper, we consider the effect of adding a coarse mesh correction to the two-grid algorithm for the mixed Navier–Stokes/Darcy model. The method yields both L² and H¹ optimal velocity and piezometric head approximations and an L² optimal pressure approximation. The method involves solving one small, coupled, nonlinear coarse mesh problem, two independent subproblems (linear Navier–Stokes equation and Darcy equation) on the fine mesh, and a correction problem on the coarse mesh. Theoretical analysis and numerical tests are done to indicate the significance of this method.