A Petrov–Galerkin spectral method for fourth‐order problems

In this paper, we consider the Petrov–Galerkin spectral method for fourth‐order elliptic problems on rectangular domains subject to non‐homogeneous Dirichlet boundary conditions. We derive some sharp results on the orthogonal approximations in one and two dimensions, which play important roles in numerical solutions of higher‐order problems. By applying these results to a fourth‐order problem, we establish the H²‐error and L²‐error bounds of the Petrov–Galerkin spectral method. Numerical experiments are provided to illustrate the high accuracy of the proposed method and coincide well with the theoretical analysis. Copyright © 2013 John Wiley & Sons, Ltd.     

hp–Adaptive composite discontinuous Galerkin methods for elliptic problems on complicated domains

In this article, we develop the a posteriori error estimation of hp–version discontinuous Galerkin composite finite element methods for the discretization of second‐order elliptic partial differential equations. This class of methods allows for the approximation of problems posed on computational domains which may contain a huge number of local geometrical features, or microstructures. Although standard numerical methods can be devised for such problems, the computational effort may be extremely high, as the minimal number of elements needed to represent the underlying domain can be very large. In contrast, the minimal dimension of the underlying composite finite element space is independent of the number of geometric features. Computable bounds on the error measured in terms of a natural (mesh‐dependent) energy norm are derived. Numerical experiments highlighting the practical application of the proposed estimators within an automatic hp–adaptive refinement procedure will be presented. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1342–1367, 2014     

A fast Petrov–Galerkin method for solving the generalized airfoil equation

In this paper we develop a fast Petrov–Galerkin method for solving the generalized airfoil equation using the Chebyshev polynomials. The conventional method for solving this equation leads to a linear system with a dense coefficient matrix. When the order of the linear system is large, the computational complexity for solving the corresponding linear system is huge. For this we propose the matrix truncation strategy, which compresses the dense coefficient matrix into a sparse matrix. We prove that the truncated method preserves the optimal order of the approximate solution for the conventional method. Moreover, we solve the truncated equation using the multilevel augmentation method. The computational complexity for solving this truncated linear system is estimated to be linear up to a logarithmic factor.     

Pointwise error estimates of the local discontinuous Galerkin method for a second order elliptic problem

In this paper we derive some pointwise error estimates for the local discontinuous Galerkin (LDG) method for solving second-order elliptic problems in (). Our results show that the pointwise errors of both the vector and scalar approximations of the LDG method are of the same order as those obtained in the norm except for a logarithmic factor when the piecewise linear functions are used in the finite element spaces. Moreover, due to the weighted norms in the bounds, these pointwise error estimates indicate that when at least piecewise quadratic polynomials are used in the finite element spaces, the errors at any point depend very weakly on the true solution and its derivatives in the regions far away from . These localized error estimates are similar to those obtained for the standard conforming finite element method.

     

A Petrov‐Galerkin method with quadrature for semi‐linear second‐order hyperbolic problems

We propose and analyze a Crank–Nicolson quadrature Petrov–Galerkin (CNQPG) ‐spline method for solving semi‐linear second‐order hyperbolic initial‐boundary value problems. We prove second‐order convergence in time and optimal order H² norm convergence in space for the CNQPG scheme that requires only linear algebraic solvers. We demonstrate numerically optimal order H^k, k = 0,1,2, norm convergence of the scheme for some test problems with smooth and nonsmooth nonlinearities. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

A selective immersed discontinuous Galerkin method for elliptic interface problems

This article proposes a selective immersed discontinuous Galerkin method based on bilinear immersed finite elements (IFE) for solving second‐order elliptic interface problems. This method applies the discontinuous Galerkin formulation wherever selected, such as those elements around an interface or a singular source, but the regular Galerkin formulation everywhere else. A selective bilinear IFE space is constructed and applied to the selective immersed discontinuous Galerkin method based on either the symmetric or nonsymmetric interior penalty discontinuous Galerkin formulation. The new method can solve an interface problem by a rectangular mesh with local mesh refinement independent of the interface even if its geometry is nontrivial. Meanwhile, if desired, its computational cost can be maintained very close to that of the standard Galerkin IFE method. It is shown that the selective bilinear IFE space has the optimal approximation capability expected from piecewise bilinear polynomials. Numerical examples are provided to demonstrate features of this method, including the effectiveness of local mesh refinement around the interface and the sensitivity to the penalty parameters. Copyright © 2013 John Wiley & Sons, Ltd.     

An ADI Petrov–Galerkin method with quadrature for parabolic problems

We propose and analyze a fully discrete Laplace modified alternating direction implicit quadrature Petrov–Galerkin (ADI‐QPG) method for solving parabolic initial‐boundary value problems on rectangular domains. We prove optimal order convergence results for a restricted class of the associated elliptic operator and demonstrate accuracy of our scheme with numerical experiments for some parabolic problems with variable coefficients.© 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Functional a posteriori error estimates for discontinuous Galerkin approximations of elliptic problems

In this article, we develop functional a posteriori error estimates for discontinuous Galerkin (DG) approximations of elliptic boundary‐value problems. These estimates are based on a certain projection of DG approximations to the respective energy space and functional a posteriori estimates for conforming approximations developed by S. Repin (see e.g., Math Comp 69 (2000) 481–500). On these grounds, we derive two‐sided guaranteed and computable bounds for the errors in “broken” energy norms. A series of numerical examples presented confirm the efficiency of the estimates. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Optimal error estimates of the local discontinuous Galerkin method for nonlinear second‐order elliptic problems on Cartesian grids

In this paper, we study the local discontinuous Galerkin (LDG) methods for two‐dimensional nonlinear second‐order elliptic problems of the type u_xx + u_yy = f(x, y, u, u_x, u_y) , in a rectangular region Ω with classical boundary conditions on the boundary of Ω . Convergence properties for the solution and for the auxiliary variable that approximates its gradient are established. More specifically, we use the duality argument to prove that the errors between the LDG solutions and the exact solutions in the L² norm achieve optimal (p + 1)th order convergence, when tensor product polynomials of degree at most p are used. Moreover, we prove that the gradient of the LDG solution is superclose with order p + 1 toward the gradient of Gauss–Radau projection of the exact solution. The results are valid in two space dimensions on Cartesian meshes using tensor product polynomials of degree p ≥ 1 , and for both mixed Dirichlet–Neumann and periodic boundary conditions. Preliminary numerical experiments indicate that our theoretical findings are optimal.     

BDDC methods for discontinuous Galerkin discretization of elliptic problems

A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coefficients in 2-D is considered. For this discretization, balancing domain decomposition with constraints (BDDC) algorithms are designed and analyzed as an additive Schwarz method (ASM). The coarse and local problems are defined using special partitions of unity and edge constraints. Under certain assumptions on the coefficients and the mesh sizes across ∂Ω_i, where the Ω_i are disjoint subregions of the original region Ω, a condition number estimate C(1+max_ilog(H_i/h_i))² is established with C independent of h_i, H_i and the jumps of the coefficients. The algorithms are well suited for parallel computations and can be straightforwardly extended to the 3-D problems. Results of numerical tests are included which confirm the theoretical results and the necessity of the imposed assumptions.     

Numerical approximation of the generalized regularized long wave equation using Petrov–Galerkin finite element method

The generalized regularized long wave (GRLW) equation has been developed to model a variety of physical phenomena such as ion‐acoustic and magnetohydrodynamic waves in plasma, nonlinear transverse waves in shallow water and phonon packets in nonlinear crystals. This paper aims to develop and analyze a powerful numerical scheme for the nonlinear GRLW equation by Petrov–Galerkin method in which the element shape functions are cubic and weight functions are quadratic B‐splines. The proposed method is implemented to three reference problems involving propagation of the single solitary wave, interaction of two solitary waves and evolution of solitons with the Maxwellian initial condition. The variational formulation and semi‐discrete Galerkin scheme of the equation are firstly constituted. We estimate rate of convergence of such an approximation. Using Fourier stability analysis of the linearized scheme we show that the scheme is unconditionally stable. To verify practicality and robustness of the new scheme error norms L₂, L_∞ and three invariants I₁, I₂, and I₃ are calculated. The computed numerical results are compared with other published results and confirmed to be precise and effective.     

A posteriori error estimate for discontinuous Galerkin finite element method on polytopal mesh

In this work, we derive a posteriori error estimates for discontinuous Galerkin finite element method on polytopal mesh. We construct a reliable and efficient a posteriori error estimator on general polygonal or polyhedral meshes. An adaptive algorithm based on the error estimator and DG method is proposed to solve a variety of test problems. Numerical experiments are performed to illustrate the effectiveness of the algorithm.     

On a nonoverlapping additive Schwarz method for h‐p discontinuous Galerkin discretization of elliptic problems

The condition number of a discontinuous Galerkin finite element discretization preconditioned with a nonoverlapping additive Schwarz method is analyzed. We improve the result of Antonietti and Houston (J Sci Comput 46 (2011), 124–149), where a bound has been proved for a two‐level nonoverlapping additive Schwarz method with coarse problem using polynomials of degree on a coarse mesh size . In a more general framework, where the concurrency of the algorithm is increased by applying solvers on subdomains smaller than the coarse grid cells, we prove that the condition number of the preconditioned system is where is the coarse space element degree polynomial and is the size of subdomain where local problems are solved in parallel. Our result also extends to the case of discontinuous coefficient, piecewise constant on the coarse grid, for a composite continuous–discontinuous Galerkin discretization. © 2016Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1572–1590, 2016     

Time discontinuous Galerkin space-time finite element method for nonlinear Sobolev equations

This article presents a complete discretization of a nonlinear Sobolev equation using space-time discontinuous Galerkin method that is discontinuous in time and continuous in space. The scheme is formulated by introducing the equivalent integral equation of the primal equation. The proposed scheme does not explicitly include the jump terms in time, which represent the discontinuity characteristics of approximate solution. And then the complexity of the theoretical analysis is reduced. The existence and uniqueness of the approximate solution and the stability of the scheme are proved. The optimalorder error estimates in L²(H¹) and L²(L²) norms are derived. These estimates are valid under weak restrictions on the space-time mesh, namely, without the condition k_n≥ch², which is necessary in traditional space-time discontinuous Galerkin methods. Numerical experiments are presented to verify the theoretical results.     

Pointwise error estimates for discontinuous Galerkin methods with lifting operators for elliptic problems

In this article, we prove some weighted pointwise estimates for three discontinuous Galerkin methods with lifting operators appearing in their corresponding bilinear forms. We consider a Dirichlet problem with a general second-order elliptic operator.

     

A class of discontinuous Petrov–Galerkin methods. II. Optimal test functions

We lay out a program for constructing discontinuous Petrov–Galerkin (DPG) schemes having test function spaces that are automatically computable to guarantee stability. Given a trial space, a DPG discretization using its optimal test space counterpart inherits stability from the well posedness of the undiscretized problem. Although the question of stable test space choice had attracted the attention of many previous authors, the novelty in our approach lies in the fact we identify a discontinuous Galerkin (DG) framework wherein test functions, arbitrarily close to the optimal ones, can be locally computed. The idea is presented abstractly and its feasibility illustrated through several theoretical and numerical examples. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Analysis of the heterogeneous multiscale method for elliptic homogenization problems

A comprehensive analysis is presented for the heterogeneous multiscale method (HMM for short) applied to various elliptic homogenization problems. These problems can be either linear or nonlinear, with deterministic or random coefficients. In most cases considered, optimal estimates are proved for the error between the HMM solutions and the homogenized solutions. Strategies for retrieving the microstructural information from the HMM solutions are discussed and analyzed.

     

Numerical error analysis for nonsymmetric interior penalty discontinuous Galerkin method of Cahn–Hilliard equation

In this paper, we derive a theoretical analysis of nonsymmetric interior penalty discontinuous Galerkin methods for solving the Cahn–Hilliard equation. We prove unconditional unique solvability of the discrete system and derive stability bounds with a generalized chemical energy density. Convergence of the method is obtained by optimal a priori error estimates. Our analysis is valid for both symmetric and nonsymmetric versions of the discontinuous Galerkin formulation.     

A discontinuous finite volume element method for second‐order elliptic problems

In this article, we propose a new discontinuous finite volume element (DFVE) method for the second‐order elliptic problems. We treat the DFVE method as a perturbation of the interior penalty method and get a superapproximation estimate in a mesh dependent norm between the solution of the DFVE method and that of the interior penalty method. This reveals that the DFVE method is much closer to the interior penalty method than we have known. By using this superapproximation estimate, we can easily get the optimal order error estimates in the L² ‐norm and in the maximum norms of the DFVE method.© 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 425–440, 2012     

A combined mixed finite element method and local discontinuous Galerkin method for miscible displacement problem in porous media

A combined method consisting of the mixed finite element method for flow and the local discontinuous Galerkin method for transport is introduced for the one-dimensional coupled system of incompressible miscible displacement problem. Optimal error estimates in L∞(0,T;L2) for concentration c,in L2(0,T;L2)for cxand L∞(0,T;L2) for velocity u are derived. The main technical difficulties in the analysis include the treatment of the inter-element jump terms which arise from the discontinuous nature of the numerical method,the nonlinearity,and the coupling of the models. Numerical experiments are performed to verify the theoretical results. Finally,we apply this method to the one-dimensional compressible miscible displacement problem and give the numerical experiments to confirm the efficiency of the scheme.