Weak Galerkin finite element methods for Parabolic equations

A newly developed weak Galerkin method is proposed to solve parabolic equations. This method allows the usage of totally discontinuous functions in approximation space and preserves the energy conservation law. Both continuous and discontinuous time weak Galerkin finite element schemes are developed and analyzed. Optimal‐order error estimates in both H¹ and L² norms are established. Numerical tests are performed and reported. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

A weak Galerkin mixed finite element method for the Helmholtz equation with large wave numbers

In this article, a new weak Galerkin mixed finite element method is introduced and analyzed for the Helmholtz equation with large wave numbers. The stability and well‐posedness of the method are established for any wave number k without mesh size constraint. Allowing the use of discontinuous approximating functions makes weak Galerkin mixed method highly flexible in term of little restrictions on approximations and meshes. In the weak Galerkin mixed finite element formulation, approximation functions can be piecewise polynomials with different degrees on different elements and meshes can consist elements with different shapes. Suboptimal order error estimates in both discrete H¹ and L² norms are established for the weak Galerkin mixed finite element solutions. Numerical examples are tested to support the theory.     

Automated FEM discretizations for the Stokes equation

Current FEM software projects have made significant advances in various automated modeling techniques. We present some of the mathematical abstractions employed by these projects that allow a user to switch between finite elements, linear solvers, mesh refinement and geometry, and weak forms with very few modifications to the code. To evaluate the modularity provided by one of these abstractions, namely switching finite elements, we provide a numerical study based upon the many different discretizations of the Stokes equations. AMS subject classification (2000)  74S05, 65Y99, 35Q30     

An adaptive wavelet viscosity method for hyperbolic conservation laws

We extend the multiscale finite element viscosity method for hyperbolic conservation laws developed in terms of hierarchical finite element bases to a (pre‐orthogonal spline‐)wavelet basis. Depending on an appropriate error criterion, the multiscale framework allows for a controlled adaptive resolution of discontinuities of the solution. The nonlinearity in the weak form is treated by solving a least‐squares data fitting problem. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

Enhancing energy conserving methods

Recent observations [5] indicate that energy-momentum methods might be better suited for the numerical integration of highly oscillatory Hamiltonian systems than implicit symplectic methods. However, the popular energy-momentum method, suggested in [3], achieves conservation of energy by a global scaling of the force field. This leads to an undesirable coupling of all degrees of freedom that is not present in the original problem formulation. We suggest enhancing this energy-momentum method by splitting the force field and using separate adjustment factors for each force. In case that the potential energy function can be split into a strong and a weak part, we also show how to combine an energy conserving discretization of the strong forces with a symplectic discretization of the weak contributions. We demonstrate the numerical properties of our method by simulating particles that interact through Lennard-Jones potentials and by integrating the Sine-Gordon equation.This work was partly supported by NIH Grant P41RR05969, DOE/NSF Grant DE-FG02-91-ER25099/DMS-9304268, and NSF GCAG/HPCC ASC-9318159.     

On the Global Convergence of a Modified Augmented Lagrangian Linesearch Interior-Point Newton Method for Nonlinear Programming

We consider a linesearch globalization of the local primal-dual interior-point Newton method for nonlinear programming introduced by El-Bakry, Tapia, Tsuchiya, and Zhang. The linesearch uses a new merit function that incorporates a modification of the standard augmented Lagrangian function and a weak notion of centrality. We establish a global convergence theory and present promising numerical experimentation.     

Norm-relaxed method of feasible directions for solving nonlinear programming problems

A variation of the Polak method of feasible directions for solving nonlinear programming problems is shown to be related to the Topkis and Veinott method of feasible directions. This new method is proven to converge to a Fritz John point under rather weak assumptions. Finally, numerical results show that the method converges with fewer iterations than that of Polak with a proper choice of parameters.     

A convergence theorem for the Newton-like methods under some kind of weak Lipschitz conditions

We provide sufficient conditions for the convergence of the Newton-like methods in the assumption that the derivative satisfies some kind of weak Lipschitz conditions. Consequently, some important convergence theorems follow from our main result in this paper.     

On Warner's algorithm for the solution of boundary-value problems for ordinary differential equations

The paper discusses the solution of boundary-value problems for ordinary differential equations by Warner's algorithm. This shooting algorithm requires that only the original system of differential equations is solved once in each iteration, while the initial conditions for a new iteration are evaluated from a matrix equation. Numerical analysis performed shows that the algorithm converges even for very bad starting values of the unknown initial conditions and that the number of iterations is small and weakly dependent on the starting point. Based on this algorithm, a general subroutine can be realized for the solution of a large class of boundary-value problems.     

Stability Analysis of Runge-Kutta Methods for Non-Linear Delay Differential Equations

This paper is concerned with the numerical solution of delay differential equations(DDEs). We focus on the stability behaviour of Runge-Kutta methods for nonlinear DDEs. The new concepts of GR(l)-stability, GAR(l)-stability and weak GAR(l)-stability are further introduced. We investigate these stability properties for (k, l)-algebraically stable Runge-Kutta methods with a piecewise constant or linear interpolation procedure.     

Construction of Solutions and L^1-error Estimates of Viscous Methods for Scalar Conservation Laws with Boundary

This paper is concerned with an initial boundary value problem for strictly convex conservation laws whose weak entropy solution is in the piecewise smooth solution class consisting of finitely many discontinuities. By the structure of the weak entropy solution of the corresponding initial value problem and the boundary entropy condition developed by Bardos-Leroux Nedelec, we give a construction method to the weak entropy solution of the initial boundary value problem. Compared with the initial value problem, the weak entropy solution of the initial boundary value problem includes the following new interaction type： an expansion wave collides with the boundary and the boundary reflects a new shock wave which is tangent to the boundary. According to the structure and some global estimates of the weak entropy solution, we derive the global L^1-error estimate for viscous methods to this initial boundary value problem by using the matching travelling wave solutions method. If the inviscid solution includes the interaction that an expansion wave collides with the boundary and the boundary reflects a new shock wave which is tangent to the boundary, or the inviscid solution includes some shock wave which is tangent to the boundary, then the error of the viscosity solution to the inviscid solution is bounded by O（ε^1/2） in L^1-norm; otherwise, as in the initial value problem, the L^1-error bound is O（ε｜ In ε｜）.     

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.     

弱有限元方法简论

本文简述弱有限元方法(weak Galerkin finite element met,hods)的数学基本原理和计算机实现.弱有限元方法对间断函数引入广义弱微分,并将其应用于偏微分方程相应的变分形式进行数值求解,而数值解的弱连续性则通过稳定子或光滑子来实现.弱有限元方法针对广义函数而构建,是经典有限元方法的一种自然拓广,且能够弥补经典有限元方法的某些缺憾,也因此在科学与工程计算领域具有广泛的应用前景.     

Extrapolation of the Stochastic Theta Numerical Method for Stochastic Differential Equations

ABSTRACT

The stochastic theta method is a family of implicit Euler methods for approximating solutions to Itô stochastic differential equations. It is proved that the weak error for the stochastic theta numerical method is of the correct form to apply Richardson extrapolation. Several computational examples illustrate the improvement in accuracy of the approximations when applying extrapolation.     

A weak Galerkin method for second order elliptic problems with polynomial reduction

The second order elliptic equation, which is also know as the diffusion-convection equation, is of great interest in many branches of physics and industry. In this paper, we use the weak Galerkin finite element method to study the general second order elliptic equation. A weak Galerkin finite element method is proposed and analyzed. This scheme features piecewise polynomials of degree $k\geq 1$ on each element and piecewise polynomials of degree $k-1\geq 0$ on each edge or face of the element. Error estimates of optimal order of convergence rate are established in both discrete $H^1$ and standard $L^2$ norm. The paper also presents some numerical experiments to verify the efficiency of the method.     

Convergence of the Approximate Auxiliary Problem Method for Solving Generalized Variational Inequalities

We consider an extension of the auxiliary problem principle for solving a general variational inequality problem. This problem consists in finding a zero of the sum of two operators defined on a real Hilbert space H: the first is a monotone single-valued operator; the second is the subdifferential of a lower semicontinuous proper convex function . To make the subproblems easier to solve, we consider two kinds of lower approximations for the function : a smooth approximation and a piecewise linear convex approximation. We explain how to construct these approximations and we prove the weak convergence and the strong convergence of the sequence generated by the corresponding algorithms under a pseudo Dunn condition on the single-valued operator. Finally, we report some numerical experiences to illustrate the behavior of the two algorithms.     

The existence of solutions for a class of semilinear elliptic systems

In this paper, some new existence theorems of weak solutions for a class of semilinear elliptic systems are obtained by means of the local linking theorem and the saddle point theorem.     

A convergence theory for a class of anti-jamming strategies

A convergence theory for a class of anti-jamming strategies for nonlinear programming algorithms is presented. This theory generalizes previous results in this area by Zoutendijk, Topkis and Veinott, Mangasarian, and others; it is applicable to algorithms in which the anti-jamming parameter is fixed at some positive value as well as to algorithms in which it tends to zero. In addition, under relatively weak hypotheses, convergence of the entire sequence of iterates is proved.This research was sponsored by the United States Army under Contract No. DA-31-124-ARO-D-462.