拋物型界面问题的变网格有限元方法

本文针对抛物型界面问题,提出了一种线性三角形变网格有限元方法.其主要思路是针对空间变量采用有限元离散,对时间变量采用差分离散,但是不同时刻的有限元剖分网格可以不同.在不引入Ritz投影这一传统分析工具的情况下,得到了最优误差估计结果,使得证明过程更加简洁.给出的数值算例验证了理论分析的正确性.     

双曲型界面问题的变网格低阶有限元方法

本文针对双曲型界面问题,讨论线性三角形有限元的变网格方法,其主要思想是针对空间变量采用有限元离散,对时间变量采用差分离散,但不同时刻的有限元剖分网格可以不同.在不引入Ritz投影这一传统分析工具的情况下,得到了相应的最优误差估计结果.最后将该方法进行推广应用,为界面问题的数值计算提供另一种解决途径.     

二维空间中分数阶扩散方程的变网格有限元方法

针对二维空间分数阶偏微分方程,给出了一个变网格全离散有限元格式,并得到了相应最优误差估计.其主要思想是对空间变量采用有限元离散,对时间交量采用差分,但不同时刻的有限元网格可以不同.这对于没计相应的自适应算法是十分有益的.     

细菌模型的连续时空有限元方法

本文针对细菌模型提出一种连续时空有限元方法,通过引入时空投影算子,得到了在时间离散节点处能量模意义下的最优误差估计结果.与传统全离散方式不同的是,该方法对时间变量和空间变量同时采用有限元离散,且无时间离散步长和空间网格尺寸的网格比限制,这对于拓宽各向异性有限元方法的应用范围是有益的.     

两个带变时间步的两重网格算法的稳定性分析

对用于求解非线性发展方程的两个带变时间步的两重网格算法，对空间变量用有限元离散，对时间变量分别用一阶精度Euler显式和二阶精度半隐式差分格式离散，然后构造两重网格算法，通过深入的稳定性分析，得出本文的算法优于标准全离散有限元算法。     

中子输运方程误差估计及自适应计算

 本文研究了全离散方法求解二维中子输运方程的有限元自适应算法, 角度变量用离散纵坐标方法展开, 空间变量用间断元方法求解. 基于间断元方法给出了空间离散的残量型后验误差估计. 在后验误差估计的基础上, 我们设计了自适应有限元算法.由残量型后验估计可以给出局部加密网格的自适应算法. 最后, 我们给出了数值算例来验证我们的理论结果.     

对流反应扩散方程的SUPG稳定化时空有限元解的误差估计（英文）

将时空有限元方法和流线扩散迎风Petrov-Galerkin方法(SUPG)相结合,构造对流扩散反应方程的一种全离散稳定化时空有限元方法.和传统的SUPG方法不同,本文为得到高精度尤其是时间高精度格式,在时空两个方向同时使用离散变分形式.该类格式曾被工程师用来数值模拟一些实际问题,但很难看到相关文献的理论分析证明.本文时间方向利用Gauss-Legendre和Gauss-Lobatto积分,并和有限元方法相结合,证明数值解的稳定性和误差估计.不但去掉时空网格的限制条件,而且将时间和空间变量解耦,克服了时空有限元方法在建立格式时由于时空变量统一处理而导致的理论分析和数值模拟中的高维度难度和复杂性,本文不需要引入对偶问题的证明思路丰富了稳定化SUPG时空有限元方法的理论.     

粒子输运方程的子网格平衡格式的稳定性和收敛性

本文研究四边形网格上求解粒子输运方程的有限体积格式,其中角方向变量采用离散纵标(Sn)方法,空间离散采用子网格平衡(SCB)格式.利用能量估计方法,证明了在正交网格上该格式的稳定性和离散解的收敛性.数值实验结果验证了格式的稳定性和离散解的收敛性.     

粘性Cahn-Hilliard方程的时间双层网格混合有限元方法

主要针对在求解粘性Cahn-Hilliard方程时非线性项引起的时间耗时问题,提出了时间双层网格混合有限元方法.在空间上采用混合有限元方法进行离散,时间上采用Crank-Nicolson格式.首先在时间粗网格上,通过非线性牛顿迭代方法求解非线性混合有限元系统.其次基于初始迭代数值解和拉格朗日插值公式在时间细网格上求解线性混合有限元系统,然后证明了该方法的稳定性和误差估计,并通过数值算例对理论部分进行验证.结果表明,理论与数值算例相一致.     

对流扩散方程的时空间断有限元方法

研究对流扩散方程的时空间断Galerkin有限元方法,该方法采用时,空两个变量都允许间断的基函数,更适用于移动网格,自适应算法以及并行计算.本文利用拉格朗日欧拉方法,采用F.Brezzi数值流通量,给出对流扩散方程的间断时空有限元离散格式,并证明格式的相容性,强制性,稳定性,解的存在唯一性,以及总体误差估计.     

Least‐squares finite element method on adaptive grid for PDEs with shocks

We apply the least‐squares finite element method with adaptive grid to nonlinear time‐dependent PDEs with shocks. The least‐squares finite element method is also used in applying the deformation method to generate the adaptive moving grids. The effectiveness of this method is demonstrated by solving a Burgers' equation with shocks. Computational results on uniform grids and adaptive grids are compared for the purpose of evaluation. The results show that the adaptive grids can capture the shock more sharply with significantly less computational time. For moving shock, the adaptive grid moves correctly with the shock. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

A Simple Finite Element Method for Meteorological Problems

A Galerkin method is applied to simple two dimensional equationsimportant in meteorological problems. The construction of thespace of trial functions for the Galerkin method is done usingthe "finite element" method, where the functions are definedas polynomials on individual elements and values are matchedon element boundaries. This method is applied to passive advectionproblems and to a non-linear gravity wave problem. The resultsare compared with those obtained by finite difference methodsand the computation time for given accuracy is shown to be atleast as short using the finite element method as with finitedifferences. Sharp local gradients are especially well handled.Extension of this approach to irregular grids and the possibleuse of higher order polynomials are proposed.     

An algebraic multigrid method for finite element systems on criss-cross grids

In this paper, we design and analyze an algebraic multigrid method for a condensed finite element system on criss-cross grids and then provide a convergence analysis. Criss-cross grid finite element systems represent a large class of finite element systems that can be reduced to a smaller system by first eliminating certain degrees of freedoms. The algebraic multigrid method that we construct is analogous to many other algebraic multigrid methods for more complicated problems such as unstructured grids, but, because of the specialty of our problem, we are able to provide a rigorous convergence analysis to our algebraic multigrid method. Dedicated to Professor Charles A. Micchelli on the occasion of his 60th birthday The work was supported in part by NSAF(10376031) and National Major Key Project for basic researches and by National High-Tech ICF Committee in China.     

Convergence of multipoint flux approximations on quadrilateral grids

This article presents a convergence analysis of the multipoint flux approximation control volume method, MPFA, in two space dimensions. The MPFA version discussed here is the so‐called O‐method on general quadrilateral grids. The discretization is based on local mappings onto a reference square. The key ingredient in the analysis is an equivalence between the MPFA method and a mixed finite element method, using a specific numerical quadrature, such that the analysis of the MPFA method can be done in a finite element setting. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

惩罚函数法在三维等参杂交元的应用

提出在等参杂交元中用惩罚函数法引入平衡约束条件,具体讨论了惩罚函数法在三维等参杂交元中的运用,并提出采用分项罚数的方法,建立最佳的罚平衡杂交元模型．罚平衡法可以在不增加自由度的前提下,有效地扼制寄生应力．数值实验表明,新建立的单元,可以有效地抑制单元畸变对计算精度的影响,从而大幅度提高畸变网格下的计算精度,方法带有普遍性．     

A generalized finite difference method for solid mechanics

Procedures are developed that improve the applicability of the finite difference method to problems in solid mechanics. This is accomplished by formulating the coefficients of the Taylor series expansion used to approximate derivative quantities in terms of physically interpretable strain gradients. Improvements realized include modeling of boundary conditions that has intuitive appeal and the use of irregular grids in a natural manner. These developments are demonstrated for the analysis of plane stress problems with traction boundary conditions. The results compare well with finite element solutions. The approach suggests further generalization of the finite difference method.     

Model reduction on inertial manifolds for N–S equations approached by multilevel finite element method

Approximate Inertial Manifolds (AIMs) is approached by multilevel finite element method, which can be referred to as a Post-processed nonlinear Galerkin finite element method, and is applied to the model reduction for fluid dynamics, a typical kind of nonlinear continuous dynamic system from viewpoint of nonlinear dynamics. By this method, each unknown variable, namely, velocity and pressure, is divided into two components, that is the large eddy and small eddy components. The interaction between large eddy and small eddy components, which is negligible if standard Galerkin algorithm is used to approach the original governing equations, is considered essentially by AIMs, and consequently a coarse grid finite element space and a fine grid incremental finite element space are introduced to approach the two components. As an example, the flow field of incompressible flows around airfoil is simulated numerically and discussed, and velocity and pressure distributions of the flow field are obtained accurately. The results show that there exists less essential degrees-of-freedom which can dominate the dynamic behaviors of the discretized system in comparison with the traditional methods, and large computing time can be saved by this efficient method. In a sense, the small eddy component can be captured by AIMs with fewer grids, and an accurate result can also be obtained.     

Optimal adaptive grids of least-squares finite element methods in two spatial dimensions

This article concerns a procedure to generate optimal adaptive grids for convection dominated problems in two spatial dimensions based on least-squares finite element approximations. The procedure extends a one dimensional equidistribution principle which minimizes the interpolation error in some norms. The idea is to select two directions which can reflect the physics of the problems and then apply the one dimensional equidistribution principle to the chosen directions. Model problems considered are the two dimensional convection-diffusion problems where boundary and interior layers occur. Numerical results of model problems illustrating the efficiency of the proposed scheme are presented. In addition, to avoid skewed mesh in the optimal grids generated by the algorithm, an unstructured local mesh smoothing will be considered in the least-squares approximations. Comparisons with the Gakerkin finite element method will also be provided.     

A multipoint flux mixed finite element method on distorted quadrilaterals and hexahedra

In this paper, we develop a new mixed finite element method for elliptic problems on general quadrilateral and hexahedral grids that reduces to a cell-centered finite difference scheme. A special non-symmetric quadrature rule is employed that yields a positive definite cell-centered system for the pressure by eliminating local velocities. The method is shown to be accurate on highly distorted rough quadrilateral and hexahedral grids, including hexahedra with non-planar faces. Theoretical and numerical results indicate first-order convergence for the pressure and face fluxes.     

An efficient hierarchical preconditioner for quadratic discretizations of finite element problems

Higher order finite element discretizations, although providing higher accuracy, are considered to be computationally expensive and of limited use for large‐scale problems. In this paper, we have developed an efficient iterative solver for solving large‐scale quadratic finite element problems. The proposed approach shares some common features with geometric multigrid methods but does not need structured grids to create the coarse problem. This leads to a robust method applicable to finite element problems discretized by unstructured meshes such as those from adaptive remeshing strategies. The method is based on specific properties of hierarchical quadratic bases. It can be combined with an algebraic multigrid (AMG) preconditioner or with other algebraic multilevel block factorizations. The algorithm can be accelerated by flexible Krylov subspace methods. We present some numerical results on the convection–diffusion and linear elasticity problems to illustrate the efficiency and the robustness of the presented algorithm. In these experiments, the performance of the proposed method is compared with that of an AMG preconditioner and other iterative solvers. Our approach requires less computing time and less memory storage. Copyright © 2010 John Wiley & Sons, Ltd.