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     

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.     

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 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.     

Local and parallel finite element algorithm for stationary incompressible magnetohydrodynamics

This article presents a local and parallel finite element method for the stationary incompressible magnetohydrodynamics problem. The key idea of this algorithm comes from the two‐grid discretization technique. Specifically, we solve the nonlinear system on a global coarse mesh, and then solve a series of linear problems on several subdomains in parallel. Furthermore, local a priori estimates are obtained on a general shape regular grid. The efficiency of the algorithm is also illustrated by some numerical experiments.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1513–1539, 2017     

A two‐grid method for mixed finite‐element solution of reaction‐diffusion equations

We present a scheme for solving two‐dimensional, nonlinear reaction‐diffusion equations, using a mixed finite‐element method. To linearize the mixed‐method equations, we use a two grid scheme that relegates all the Newton‐like iterations to a grid Δ_H much coarser than the original one Δ_h, with no loss in order of accuracy so long as the mesh sizes obey . The use of a multigrid‐based solver for the indefinite linear systems that arise at each coarse‐grid iteration, as well as for the similar system that arises on the fine grid, allows for even greater efficiency. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 317–332, 1999     

Two‐grid methods for time‐harmonic Maxwell equations

In this paper, we develop several two‐grid methods for the Nédélec edge finite element approximation of the time‐harmonic Maxwell equations. We first present a two‐grid method that uses a coarse space to solve the original problem and then use a fine space to solve a corresponding symmetric positive definite problem. Then, we present two types of iterative two‐grid methods, one is to add the kernel of the curl ‐operator in the fine space to a coarse mesh space to solve the original problem and the other is to use an inner iterative method for dealing with the kernel of the curl ‐operator in the fine space and the coarse space, separately. We provide the error estimates for the first two methods and present numerical experiments to show the efficiency of our methods.Copyright © 2012 John Wiley & Sons, Ltd.     

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     

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.     

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.     

Existence and asymptotic behavior of global smooth solution for p‐system with nonlinear damping and fixed boundary effect

This paper is concerned with the initial boundary value problem for the p‐system with nonlinear damping and fixed boundary condition. We show that the corresponding problem admits a unique global solution, and such a solution tends time asymptotically to the corresponding nonlinear diffusion wave governed by the classical Darcy's law provided that the corresponding prescribed initial error function is sufficiently small. Copyright © 2013 John Wiley & Sons, Ltd.     

Memory‐efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis

Novel memory‐efficient Arnoldi algorithms for solving matrix polynomial eigenvalue problems are presented. More specifically, we consider the case of matrix polynomials expressed in the Chebyshev basis, which is often numerically more appropriate than the standard monomial basis for a larger degree d. The standard way of solving polynomial eigenvalue problems proceeds by linearization, which increases the problem size by a factor d. Consequently, the memory requirements of Krylov subspace methods applied to the linearization grow by this factor. In this paper, we develop two variants of the Arnoldi method that build the Krylov subspace basis implicitly, in a way that only vectors of length equal to the size of the original problem need to be stored. The proposed variants are generalizations of the so‐called quadratic Arnoldi method and two‐level orthogonal Arnoldi procedure methods, which have been developed for the monomial case. We also show how the typical ingredients of a full implementation of the Arnoldi method, including shift‐and‐invert and restarting, can be incorporated. Numerical experiments are presented for matrix polynomials up to degree 30 arising from the interpolation of nonlinear eigenvalue problems, which stem from boundary element discretizations of PDE eigenvalue problems. Copyright © 2013 John Wiley & Sons, Ltd.     

Convergence of Finite Element Approximations and Multilevel Linearization for Ginzburg–Landau Model of d-Wave Superconductors

In this paper, we consider the finite element approximations of a recently proposed Ginzburg–Landau-type model for d-wave superconductors. In contrast to the conventional Ginzburg–Landau model the scalar complex valued order-parameter is replaced by a multicomponent complex order-parameter and the free energy is modified according to the d-wave paring symmetry. Convergence and optimal error estimates and some superconvergent estimates for the derivatives are derived. Furthermore, we propose a multilevel linearization procedure to solve the nonlinear systems. It is proved that the optimal error estimates and superconvergence for the derivatives are preserved by the multilevel linearization algorithm.     

Two grid discretizations with backtracking of the stream function form of the Navier-Stokes equations

We analyze a two grid finite element method with backtracking for the stream function formulation of the stationary Navier—Stokes equations. This two grid method involves solving one small, nonlinear coarse mesh system, one linearized system on the fine mesh and one linear correction problem on the coarse mesh. The algorithm and error analysis are presented.     

Two‐level Newton iterative method for the 2D/3D steady Navier‐Stokes equations

A combination method of the Newton iteration and two‐level finite element algorithm is applied for solving numerically the steady Navier‐Stokes equations under the strong uniqueness condition. This algorithm is motivated by applying the m Newton iterations for solving the Navier‐Stokes problem on a coarse grid and computing the Stokes problem on a fine grid. Then, the uniform stability and convergence with respect to ν of the two‐level Newton iterative solution are analyzed for the large m and small H and h << H. Finally, some numerical tests are made to demonstrate the effectiveness of the method. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2012     

Two‐level discretization of the Navier‐Stokes equations with r‐Laplacian subgridscale viscosity

The r‐Laplacian has played an important role in the development of computationally efficient models for applications, such as numerical simulation of turbulent flows. In this article, we examine two‐level finite element approximation schemes applied to the Navier‐Stokes equations with r‐Laplacian subgridscale viscosity, where r is the order of the power‐law artificial viscosity term. In the two‐level algorithm, the solution to the fully nonlinear coarse mesh problem is utilized in a single‐step linear fine mesh problem. When modeling parameters are chosen appropriately, the error in the two‐level algorithm is comparable to the error in solving the fully nonlinear problem on the fine mesh. We provide rigorous numerical analysis of the two‐level approximation scheme and derive scalings which vary based on the coefficient r, coarse mesh size H, fine mesh size h, and filter radius δ. We also investigate the two‐level algorithm in several computational settings, including the 3D numerical simulation of flow past a backward‐facing step at Reynolds number Re = 5100. In all numerical tests, the two‐level algorithm was proven to achieve the same order of accuracy as the standard one‐level algorithm, at a fraction of the computational cost. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Two‐grid variational multiscale algorithms for the stationary incompressible Navier‐Stokes equations with friction boundary conditions

Two‐grid variational multiscale (VMS) algorithms for the incompressible Navier‐Stokes equations with friction boundary conditions are presented in this article. First, one‐grid VMS algorithm is used to solve this problem and some error estimates are derived. Then, two‐grid VMS algorithms are proposed and analyzed. The algorithms consist of nonlinear problem on coarse grid and linearized problem (Stokes problem or Oseen problem) on fine grid. Moreover, the stability and convergence of the present algorithms are established. Finally, Numerical results are shown to confirm the theoretical analysis. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 546–569, 2017     

Positive solutions for p‐Kirchhoff type problems on

In this paper, we establish the existence and non‐existence of positive solutions for p‐Kirchhoff type problems with a parameter on without assuming the usual compactness conditions. We show that the p‐Kirchhoff type problems have at least one positive solution when the parameter is small, while the p‐Kirchhoff type problems have no positive solutions when the parameter is large. Our argument is based on variational methods, monotonicity methods, cut‐off functional techniques, and a priori estimates techniques. Copyright © 2014 John Wiley & Sons, Ltd.     

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-scale sparse finite element approximations

To reduce computational cost,we study some two-scale finite element approximations on sparse grids for elliptic partial differential equations of second order in a general setting.Over any tensor product domain ?R~d with d = 2,3,we construct the two-scale finite element approximations for both boundary value and eigenvalue problems by using a Boolean sum of some existing finite element approximations on a coarse grid and some univariate fine grids and hence they are cheaper approximations.As applications,we obtain some new efficient finite element discretizations for the two classes of problem:The new two-scale finite element approximation on a sparse grid not only has the less degrees of freedom but also achieves a good accuracy of approximation.