Finite volume method based on stabilized finite elements for the nonstationary Navier–Stokes problem

A finite volume method based on stabilized finite element for the two‐dimensional nonstationary Navier–Stokes equations is investigated in this work. As in stabilized finite element method, macroelement condition is introduced for constructing the local stabilized formulation of the nonstationary Navier–Stokes equations. Moreover, for P₁ ? P₀ element, the H¹ error estimate of optimal order for finite volume solution (u_h,p_h) is analyzed. And, a uniform H¹ error estimate of optimal order for finite volume solution (u_h, p_h) is also obtained if the uniqueness condition is satisfied. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Low‐order stabilized finite element methods for the unsteady Stokes/Navier‐Stokes equations with friction boundary conditions

In this paper, we consider low‐order stabilized finite element methods for the unsteady Stokes/Navier‐Stokes equations with friction boundary conditions. The time discretization is based on the Euler implicit scheme, and the spatial discretization is based on the low‐order element (P₁−P₁ or P₁−P₀) for the approximation of the velocity and pressure. Moreover, some error estimates for the numerical solution of fully discrete stabilized finite element scheme are obtained. Finally, numerical experiments are performed to confirm our theoretical results.     

Lagrange interpolation and finite element superconvergence

We consider the finite element approximation of the Laplacian operator with the homogeneous Dirichlet boundary condition, and study the corresponding Lagrange interpolation in the context of finite element superconvergence. For d‐dimensional Q_k‐type elements with d ≥ 1 and k ≥ 1, we prove that the interpolation points must be the Lobatto points if the Lagrange interpolation and the finite element solution are superclose in H¹ norm. For d‐dimensional P_k‐type elements, we consider the standard Lagrange interpolation—the Lagrange interpolation with interpolation points being the principle lattice points of simplicial elements. We prove for d ≥ 2 and k ≥ d + 1 that such interpolation and the finite element solution are not superclose in both H¹ and L² norms and that not all such interpolation points are superconvergence points for the finite element approximation. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 33–59, 2004.     

Analysis of newton multilevel stabilized finite volume method for the three‐dimensional stationary Navier‐Stokes equations

This article proposes and analyzes a multilevel stabilized finite volume method(FVM) for the three‐dimensional stationary Navier–Stokes equations approximated by the lowest equal‐order finite element pairs. The method combines the new stabilized FVM with the multilevel discretization under the assumption of the uniqueness condition. The multilevel stabilized FVM consists of solving the nonlinear problem on the coarsest mesh and then performs one Newton correction step on each subsequent mesh thus only solving one large linear systems. The error analysis shows that the multilevel‐stabilized FVM provides an approximate solution with the convergence rate of the same order as the usual stabilized finite element solution solving the stationary Navier–Stokes equations on a fine mesh for an appropriate choice of mesh widths: h_j ～ h_j‐1², j = 1,…,J. Therefore, the multilevel stabilized FVM is more efficient than the standard one‐level‐stabilized FVM. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Convergence analysis of a balancing domain decomposition method for solving a class of indefinite linear systems

A variant of balancing domain decomposition method by constraints (BDDC) is proposed for solving a class of indefinite systems of linear equations of the form (K?σ²M)u=f, which arise from solving eigenvalue problems when an inverse shifted method is used and also from the finite element discretization of Helmholtz equations. Here, both K and M are symmetric positive definite. The proposed BDDC method is closely related to the previous dual–primal finite element tearing and interconnecting method (FETI‐DP) for solving this type of problems (Appl. Numer. Math. 2005; 54 :150–166), where a coarse level problem containing certain free‐space solutions of the inherent homogeneous partial differential equation is used in the algorithm to accelerate the convergence. Under the condition that the diameters of the subdomains are small enough, the convergence rate of the proposed algorithm is established, which depends polylogarithmically on the dimension of the individual subdomain problems and which improves with a decrease of the subdomain diameters. These results are supported by numerical experiments of solving a two‐dimensional problem. Copyright © 2009 John Wiley & Sons, Ltd.     

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     

The maximum angle condition is not necessary for convergence of the finite element method

We show that the famous maximum angle condition in the finite element analysis is not necessary to achieve the optimal convergence rate when simplicial finite elements are used to solve elliptic problems. This condition is only sufficient. In fact, finite element approximations may converge even though some dihedral angles of simplicial elements tend to π.     

Numerical and theoretical study of weak Galerkin finite element solutions of Turing patterns in reaction–diffusion systems

In this paper, we introduce numerical schemes and their analysis based on weak Galerkin finite element framework for solving 2‐D reaction–diffusion systems. Weak Galerkin finite element method (WGFEM) for partial differential equations relies on the concept of weak functions and weak gradients, in which differential operators are approximated by weak forms through the Green's theorem. This method allows the use of totally discontinuous functions in the approximation space. In the current work, the WGFEM solves reaction–diffusion systems to find unknown concentrations (u, v) in element interiors and boundaries in the weak Galerkin finite element space WG(P₀, P₀, RT₀) . The WGFEM is used to approximate the spatial variables and the time discretization is made by the backward Euler method. For reaction–diffusion systems, stability analysis and error bounds for semi‐discrete and fully discrete schemes are proved. Accuracy and efficiency of the proposed method successfully tested on several numerical examples and obtained results satisfy the well‐known result that for small values of diffusion coefficient, the steady state solution converges to equilibrium point. Acquired numerical results asserted the efficiency of the proposed scheme.     

Numerical analysis for the mixed Navier–Stokes and Darcy Problem with the Beavers–Joseph interface condition

In this article, we consider the coupled Navier–Stokes and Darcy problem with the Beavers–Joseph interface condition. With suitable restrictions of physical parameters α and ν, we prove the existence and local uniqueness of a weak solution. Then we propose a coupled finite element scheme and a decoupled and linearized scheme based on two‐grid finite element. Under suitable further restrictions, their optimal error estimates are obtained. Finally numerical experiments indicate the validity of the theoretical results as well as the efficiency and effectiveness of the decoupled and linearized two‐grid algorithm. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1009–1030, 2015     

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     

Convergence and quasi-optimality of an adaptive finite element method for controlling <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript> errors

In this paper, a contraction property is proved for an adaptive finite element method for controlling the global L ₂ error on convex polyhedral domains. Furthermore, it is shown that the method converges in L ₂ with the best possible rate. The method that is analyzed is the standard adaptive method except that, if necessary, additional refinements are made to keep the meshes sufficiently mildly graded. This modification does not compromise the quasi-optimality of the resulting algorithm.     

A Globally Convergent Algorithm for a PDE-Constrained Optimization Problem Arising in Electrical Impedance Tomography

We study the convergence properties of an algorithm for the inverse problem of electrical impedance tomography, which can be reduced to a partial differential equation (PDE) constrained optimization problem. The direct problem consists of the potential equation div(??u) = 0 in a circle, with Neumann condition describing the behavior of the electrostatic potential in a medium with conductivity given by the function ?(x, y). We suppose that at each time a current ψ _i is applied to the boundary of the circle (Neumann's data), and that it is possible to measure the corresponding potential ? _i (Dirichlet data). The inverse problem is to find ?(x, y) given a finite number of Cauchy pairs measurements (? _i , ψ _i ), i = 1,…, N. The problem is formulated as a least squares problem, and the developed algorithm solves the continuous problem using descent iterations in its corresponding finite element approximations. Wolfe's conditions are used to ensure the global convergence of the optimization algorithm for the continuous problem. Although exact data are assumed, measurement errors in data and regularization methods shall be considered in a future work.     

AMLI preconditioner for the p‐version of the FEM

From the literature it is known that the conjugate gradient method with domain decomposition preconditioners is one of the most efficient methods for solving systems of linear algebraic equations resulting from p‐version finite element discretizations of elliptic boundary value problems. One ingredient of such a preconditioner is a preconditioner related to the Dirichlet problems. In the case of Poisson's equation, we present a preconditioner for the Dirichlet problems which can be interpreted as the stiffness matrix K_h,k resulting from the h‐version finite element discretization of a special degenerated problem. We construct an AMLI preconditioner C_h,k for the matrix K_h,k and show that the condition number of C K_h,k is independent of the discretization parameter. This proof is based on the strengthened Cauchy inequality. The theoretical result is confirmed by numerical examples. Copyright © 2003 John Wiley & Sons, Ltd.     

On Countable Products of Finite Hausdorff Spaces

We investigate in ZF (i.e., Zermelo‐Fraenke set theory without the axiom of choice) conditions that are necessary and sufficient for countable products ∏_m∈ℕX_m of (a) finite Hausdorff spaces X_m resp. (b) Hausdorff spaces X_m with at most n points to be compact resp. Baire. Typica results: (i) Countable products of finite Hausdorff spaces are compact (resp. Baire) if and only if countable products of non‐empty finite sets are non‐empty. (ii) Countable products of discrete spaces with at most n + 1 points are compact (resp. Baire) if and only if countable products of non‐empty sets with at most n points are non‐empty.     

A superconvergent nonconforming mixed finite element method for the Navier–Stokes equations

The superconvergence for a nonconforming mixed finite element approximation of the Navier–Stokes equations is analyzed in this article. The velocity field is approximated by the constrained nonconforming rotated Q₁ (CNRQ₁) element, and the pressure is approximated by the piecewise constant functions. Under some regularity assumptions, the superconvergence estimates for both the velocity in broken H¹‐norm and the pressure in L²‐norm are obtained. Some numerical examples are presented to demonstrate our theoretical results. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 646–660, 2016     

A least‐squares finite element approximation for the compressible Stokes equations

This article studies a least‐squares finite element method for the numerical approximation of compressible Stokes equations. Optimal order error estimates for the velocity and pressure in the H¹ are established. The choice of finite element spaces for the velocity and pressure is not subject to the inf‐sup condition. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 62–70, 2000     

Neumann–Neumann algorithms for a mortar Crouzeix–Raviart element for 2nd order elliptic problems

The paper proposes two scalable variants of the Neumann–Neumann algorithm for the lowest order Crouzeix–Raviart finite element or the nonconforming P ₁ finite element on nonmatching meshes. The overall discretization is done using a mortar technique which is based on the application of an approximate matching condition for the discrete functions, requiring function values only at the mesh interface nodes. The algorithms are analyzed using the abstract Schwarz framework, proving a convergence which is independent of the jumps in the coefficients of the problem and only depends logarithmically on the ratio between the subdomain size and the mesh size.     

Penalty finite element approximations for the Stokes equations by L2 projection

This paper considers the penalty finite element method for the Stokes equations, based on some stable finite elements space pair (X_h, M_h) that do satisfy the discrete inf–sup condition. Theoretical results show that the penalty error converges as fast as one should expect from the order of the elements. Moreover, the penalty finite element method by L² projection can improve the penalty error estimates. Finally, we confirm these results by a series of numerical experiments. Copyright © 2008 John Wiley & Sons, Ltd.     

Stability of the Crank–Nicolson–Adams–Bashforth scheme for the 2D Leray‐alpha model

We consider the stability of an efficient Crank–Nicolson–Adams–Bashforth method in time, finite element in space, discretization of the Leray‐α model. We prove finite‐time stability of the scheme in L², H¹, and H², as well as the long‐time L‐stability of the scheme under a Courant‐Freidrichs‐Lewy (CFL)‐type condition. Numerical experiments are given that are in agreement with the theoretical results. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1155–1183, 2016     

Extending the disjoint‐representatives theorems of Hall,Halmos, and Vaughan to list‐multicolorings of graphs

Philip Hall's famous theorem on systems of distinct representatives and its not‐so‐famous improvement by Halmos and Vaughan (1950) can be regarded as statements about the existence of proper list‐colorings or list‐multicolorings of complete graphs. The necessary and sufficient condition for a proper “coloring” in these theorems has a rather natural generalization to a condition we call Hall's condition on a simple graph G, a vertex list assignment to G, and an assignment of nonnegative integers to the vertices of G. Hall's condition turns out to be necessary for the existence of a proper multicoloring of G under these assignments. The Hall‐Halmos‐Vaughan theorem may be stated: when G is a clique, Hall's condition is sufficient for the existence of a proper multicoloring. In this article, we undertake the study of the class HHV of simple graphs G for which Hall's condition is sufficient for the existence of a proper multicoloring. It is shown that HHV is contained in the class ℋ︁₀ of graphs in which every block is a clique and each cut‐vertex lies in exactly two blocks. On the other hand, besides cliques, the only connected graphs we know to be in HHV are (i) any two cliques joined at a cut‐vertex, (ii) paths, and (iii) the two connected graphs of order 5 in ℋ︁₀, which are neither cliques, paths, nor two cliques stuck together. In case (ii), we address the constructive aspect, the problem of deciding if there is a proper coloring and, if there is, of finding one. © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 199–219, 2000