一类半线性对流扩散问题特征-有限体积法H1模误差估计

1引言有限体积法是由Baliga和Patankar提出的一种数值求解偏微分方程,特别是物理学中保持守恒律方程的有效方法．由于其运用原方程的体积积分公式和有限控制体积来离散方程．使方程在控制体积上保持守恒律这一重要的物理特性,自出现以来,有了很大的发展([2-4],[10])．特征线方法([1],[8],[9])则是一种非常适合求解对流占优扩散方程的数值     

A critical review of discrete filled function methods in solving nonlinear discrete optimization problems

Many real life problems can be modeled as nonlinear discrete optimization problems. Such problems often have multiple local minima and thus require global optimization methods. Due to high complexity of these problems, heuristic based global optimization techniques are usually required when solving large scale discrete optimization or mixed discrete optimization problems. One of the more recent global optimization tools is known as the discrete filled function method. Nine variations of the discrete filled function method in literature are identified and a review on theoretical properties of each method is given. Some of the most promising filled functions are tested on various benchmark problems. Numerical results are given for comparison.     

On regularization methods based on dynamic programming techniques

In this article, we investigate the connection between regularization theory for inverse problems and dynamic programming theory. This is done by developing two new regularization methods, based on dynamic programming techniques. The aim of these methods is to obtain stable approximations to the solution of linear inverse ill-posed problems. We follow two different approaches and derive a continuous and a discrete regularization method. Regularization properties for both methods are proved as well as rates of convergence. A numerical benchmark problem concerning integral operators with convolution kernels is used to illustrate the theoretical results.     

Error estimates of CFVE method for fully nonlinear convection‐dominated diffusion problems

Finite volume method and characteristics finite element method are two important methods for solving the partial differential equations. These two methods are combined in this paper to establish a fully discrete characteristics finite volume method for fully nonlinear convection‐dominated diffusion problems. Through detailed theoretical analysis, optimal order H¹ norm error estimates are obtained for this fully discrete scheme. Copyright © 2010 John Wiley & Sons, Ltd.     

Partition of Unity for a Class of Nonlinear Parabolic Equation on Overlapping Non-Matching Grids

A class of nonlinear parabolic equation on a polygonal domain Ω  R2 is inves- tigated in this paper. We introduce a finite element method on overlapping non-matching grids for the nonlinear parabolic equation based on the partition of unity method. We give the construction and convergence analysis for the semi-discrete and the fully discrete finite element methods. Moreover, we prove that the error of the discrete variational problem has good approximation properties. Our results are valid for any spatial dimensions. A numerical example to illustrate the theoretical results is also given.     

A New Reduced-Order fve Algorithm Based on POD Method for Viscoelastic Equations

A proper orthogonal decomposition (POD) technique is used to reduce the finite volume element (FVE) method for two-dimensional (2D) viscoelastic equations. A reduced-order fully discrete FVE algorithm with fewer degrees of freedom and sufficiently high accuracy based on POD method is established. The error estimates of the reduced-order fully discrete FVE solutions and the implementation for solving the reduced-order fully discrete FVE algorithm are provided. Some numerical examples are used to illustrate that the results of numerical computation are consistent with theoretical conclusions. Moreover, it is shown that the reduced-order fully discrete FVE algorithm is one of the most effective numerical methods by comparing with corresponding numerical results of finite element formulation and finite difference scheme and that the reduced-order fully discrete FVE algorithm based on POD method is feasible and efficient for solving 2D viscoelastic equations.     

A comparative study of efficient iterative solvers for generalized Stokes equations

We consider a generalized Stokes equation with problem parameters ξ?0 (size of the reaction term) and ν>0 (size of the diffusion term). We apply a standard finite element method for discretization. The main topic of the paper is a study of efficient iterative solvers for the resulting discrete saddle point problem. We investigate a coupled multigrid method with Braess–Sarazin and Vanka‐type smoothers, a preconditioned MINRES method and an inexact Uzawa method. We present a comparative study of these methods. An important issue is the dependence of the rate of convergence of these methods on the mesh size parameter and on the problem parameters ξ and ν. We give an overview of the main theoretical convergence results known for these methods. For a three‐dimensional problem, discretized by the Hood–Taylor ??₂–??₁ pair, we give results of numerical experiments. Copyright © 2007 John Wiley & Sons, Ltd.     

Energy-conserved splitting FDTD methods for Maxwell’s equations

In this paper, two new energy-conserved splitting methods (EC-S-FDTDI and EC-S-FDTDII) for Maxwell’s equations in two dimensions are proposed. Both algorithms are energy-conserved, unconditionally stable and can be computed efficiently. The convergence results are analyzed based on the energy method, which show that the EC-S-FDTDI scheme is of first order in time and of second order in space, and the EC-S-FDTDII scheme is of second order both in time and space. We also obtain two identities of the discrete divergence of electric fields for these two schemes. For the EC-S-FDTDII scheme, we prove that the discrete divergence is of first order to approximate the exact divergence condition. Numerical dispersion analysis shows that these two schemes are non-dissipative. Numerical experiments confirm well the theoretical analysis results.     

The Finite Difference Based Fast Adaptive Composite Grid Method

The fast adaptive composite grid (FAC) method is an iterative method for solving discrete boundary value problems on composite grids. McCormick introduced the method in [8] and considered the convergence behaviour for discrete problems resulting from finite volume element discretization on composite grids. In this paper we consider discrete problems resulting from finite difference discretization on composite grids. We distinguish between two obvious discretization approaches at the grid points on the interfaces between fine and coarse subgrids. The FAC method for solving such discrete problems is described. In the FAC method several intergrid transfer operators appear. We study how the convergence behaviour depends on these intergrid transfer operators. Based on theoretical insights, (quasi-)optimal intergrid transfer operators are derived. Numerical results illustrate the fast convergence of the FAC method using these intergrid transfer operators.     

The Finite Difference Methods for Fractional Ordinary Differential Equations

Fractional finite difference methods are useful to solve the fractional differential equations. The aim of this article is to prove the stability and convergence of the fractional Euler method, the fractional Adams method and the high order methods based on the convolution formula by using the generalized discrete Gronwall inequality. Numerical experiments are also presented, which verify the theoretical analysis.     

Group Actions, Double Cosets, and Homomorphisms: Unifying Concepts for the Constructive Theory of Discrete Structures

In the present paper we describe the use of group actions, double cosets and homomorphisms in the constructive theory of discrete structures, as we found it useful from both a theoretical and a practical point of view. By means of examples we should like to demonstrate that these methods are useful both as unifying principles and as efficient methods for applications.     

The virtual element method for a nonhomogeneous double obstacle problem of Kirchhoff plate

This paper is intended to propose and analyze the lowest order conforming and nonconforming virtual element methods (VEMs) for a nonhomogeneous double obstacle problem in fourth-order variational inequality. We first present an abstract framework for the error analysis of an abstract discrete method. Then, we develop the conforming and fully nonconforming VEMs for the previous problem, with the optimal error estimates obtained by using the previous abstract framework combined with two modified interpolation operators and the related estimates. The discrete problem is solved by the primal–dual active set algorithm and the numerical results are in good agreement with theoretical findings.     

Newton Linearized Methods for Semilinear Parabolic Equations

In this study, Newton linearized finite element methods are presented for solving semi-linear parabolic equations in two- and three-dimensions. The proposed scheme is a one-step, linearized and second-order method in temporal direction, while the usual linearized second-order schemes require at least two starting values. By using a temporal-spatial error splitting argument, the fully discrete scheme is proved to be convergent without time-step restrictions dependent on the spatial mesh size. Numerical examples are given to demonstrate the efficiency of the methods and to confirm the theoretical results.     

General Interpolation Formulas for Spaces of Discrete Functions with Nonuniform Meshes

1.IntroductionThegreatnumber0fproblemsf0rthelargescalescientificandengineeringcompu-tati0nsc0ncernthenumericalsolutionsofvari0uspr0blemsforthepartialdifferentialequationsandsystemsinmathematicalphysics.Thefinitedifferencemethodisthem0stc0mm0nlyusedinthesec0mputati0ns.S0thethe0reticalandnumericalstudiesofthefinitedifferenceschemesforthepr0blems0fthepartialdifferentialequati0nsandsystemsnaturallycallpeople'sgreatattentions.Theimbeddingthe0remsandtheinterpolationformulasf0rthefunctions0fS0b0lev'…     

A stepsize control for continuation methods and its special application to multiple shooting techniques

Summary A numerically applicable stepsize control for discrete continuation methods of orderp is derived on a theoretical basis. Both the theoretical results and the performance of the proposed algorithm are invariant under affine transformation of the nonlinear system to be solved. The efficiency and reliability of the method is demonstrated by solving three real life two-point boundary value problems using multiple shooting techniques. In two of the examples bifurcations occur and are significantly marked by sharp changes in the stepsize estimates.     

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.     

Lagrange multiplier method with penalty for elliptic and parabolic interface problems

The basic requirement for the stability of the mortar element method is to construct finite element spaces which satisfy certain criteria known as inf-sup (well known as LBB, i.e., Ladyzhenskaya-Babu?ka-Brezzi) condition. Many natural and convenient choices of finite element spaces are ruled out as these spaces may not satisfy the inf-sup condition. In order to alleviate this problem Lagrange multiplier method with penalty is used in this paper. The existence and uniqueness results of the discrete problem are discussed without using the discrete LBB condition. We have also analyzed the Lagrange multiplier method with penalty for parabolic initial-boundary value problems using semidiscrete and fully discrete schemes. We have derived sub-optimal order of estimates for both semidiscrete and fully discrete schemes. The results of numerical experiments support the theoretical results obtained in this article.     

A Finite Element Algorithm for Nematic Liquid Crystal Flow Based on the Gauge-Uzawa Method

In this paper,we present a finite element algorithm for the time-dependent nematic liquid crystal flow based on the Gauge-Uzawa method.This algorithm combines the Gauge and Uzawa methods within a finite element variational formulation,which is a fully discrete projection type algorithm,whereas many projection methods have been studied without space discretization.Besides,error estimates for velocity and molecular orientation of the nematic liquid crystal flow are shown.Finally,numerical results are given to show that the presented algorithm is reliable and confirm the theoretical analysis.     

A finite volume element formulation and error analysis for the non-stationary conduction–convection problem

The non-stationary conduction–convection problem including the velocity vector field and the pressure field as well as the temperature field is studied with a finite volume element (FVE) method. A fully discrete FVE formulation and the error estimates between the fully discrete FVE solutions and the accuracy solution are provided. It is shown by numerical examples that the results of numerical computation are consistent with theoretical conclusions. Moreover, it is shown that the FVE method is feasible and efficient for finding the numerical solutions of the non-stationary conduction–convection problem and is one of the most effective numerical methods by comparing the results of the numerical simulations of the FVE formulation with those of the numerical simulations of the finite element method and the finite difference scheme for the non-stationary conduction–convection problem.     

A note on a parameterized singular perturbation problem

We consider a uniform finite difference method on Shishkin mesh for a quasilinear first-order singularly perturbed boundary value problem (BVP) depending on a parameter. We prove that the method is first-order convergent except for a logarithmic factor, in the discrete maximum norm, independently of the perturbation parameter. Numerical experiments support these theoretical results.