二次Lagrangian有限元方程的几何多重网格法

为了构造快速求解二次Lagrangian有限元方程的几何多重网格法,在选择二次Lagrangian有限元空间和一系列线性Lagrangian有限元空间分别作为最细网格层和其余粗网格层以及构造一种新限制算子的基础上,提出了一种新的几何多重网格法,并对它的计算量进行了估计.数值实验结果,与通常的几何多重网格法和AMG01法相比,表明了新算法计算量少且稳健性强.     

求解二次Lagrangian有限元方程的代数两水平方法

基于矩阵图集的粗化算法,构造一种新的插值算子,提出了瀑布型代数两重网格法;然后结合部分几何信息,提出了求解二次Lagrangian有限元方程的代数两水平方法.数值实验表明该算法稳健性强、计算量更少.     

高波数波动问题的多水平方法

本文主要讨论求解高波数Helmholtz方程的多水平方法,主要回顾了一些具有代表性的多重网格方法.如Erlangga等人的shifted Laplacian预处理的多重网格法;Elman等提出的修正的多重网格方法;以及我们的基于连续内罚有限元(CIP-FEM)离散代数系统的多水平算法.最后还介绍了求解高波数时谐Maxwell方程的CIP-FEM离散代数系统的多水平算法.     

抛物问题的mortar有限元逼近的瀑布型多重网格法

用瀑布型多重网格法解决椭圆、抛物问题，已有不少研究工作[1-2]，本文对抛物问题的mortar有限元的全离散格式提出瀑布型多重网格法，证明了该方法是最优的，即具有最优精确度和复杂度．     

角域上边界有限元的多重校正法

有关有限元法的校正技术,文[1]林群、杨一都作了较为系统的综述。文[2]林群、周爱辉提出了几个算子相乘的观点,并对二维一次有限元作了三重校正。文[3]朱起定等对两点边值问题和带光滑核边界积分方程的有限元解给出了多重校正公式。从理论上讲,这些问题可以任意次校正。然而,对多角形域上边界积分方程,由于角点的存在,解函数在角点有奇性,文[3]的方法失效。本文采用局部加密网格方法,对角域上边界有限元给出了多重校正公式。本文采用的符号同文[4]。     

非协调Wilson有限元的多重网格方法

§1.引言 非协调Wilson有限元[1—3]对解弹性力学方程有实用价值,在工程上有用。本文分析Wilson元的多重网格法,给出用多重网格方法求得的近似解按L~2模和能量模的最佳收敛阶误差估计。对于W-循环,可以证明其计算量与离散空间的维数为同一量级O(N_k)。 考虑二阶椭圆Dirchlet边值问题:     

求解二维三温能量方程的基于AMG预条件子的Krylov子空间迭代法

本文对一类二维三温能量方程的实际应用问题，建立了一种半粗化的代数多重网格法（SAMG），进而得到了以该SAMG方法为预条件子的Krylov子空间迭代法。数值实验结果表明，该方法对求解二维三温能量方程的实际问题是十分有效和健壮的。     

粘塑性动力学问题的最优控制变分原理与有限元分析

本文运用最优控制变分理论，对Perzyna型粘塑性体，提出了粘塑性动力问题的参数变分原理，并给出了相应的动力有限元方程和参数二次解法．     

旋转Q1非协调元的V循环多重网格法

1．引言近年来,多重网格法已成为行之有效的偏微分方程数值解法,而对非协调元的多重网格法也有众多的研究,例在[1,3］中,作者研究了非协P1元的w循环多重网格法,[10］中,作者研究了＊11s。n非协调元的V循环多重网格法．此外在K豆1,12］中,作者研究了板问题非协调有限元的多重网格法．最近,Rannacher和Turek同构造了所谓的QI非协调元,并用该元离散StokeS问题．而在问中,利用该元来计算晶体,数值效果非常好．同时在同中,作者给出了该元的误差估计和超收敛分析．最近,Chen和oswald同又讨论了该元的多重网格法,并证明了W循环…     

Wilson非协调元的V循环多重网格法 *

非协调有限元V循环多重网格法的收敛性至今仍是一个没有很好解决的问题 .给出了Wilson非协调有限元的两类V循环多重网格法的收敛性证明 .     

On the sufficiency of finite support duals in semi-infinite linear programming

We consider semi-infinite linear programs with countably many constraints indexed by the natural numbers. When the constraint space is the vector space of all real valued sequences, we show that the finite support (Haar) dual is equivalent to the algebraic Lagrangian dual of the linear program. This settles a question left open by Anderson and Nash (1987). This result implies that if there is a duality gap between the primal linear program and its finite support dual, then this duality gap cannot be closed by considering the larger space of dual variables that define the algebraic Lagrangian dual. However, if the constraint space corresponds to certain subspaces of all real-valued sequences, there may be a strictly positive duality gap with the finite support dual, but a zero duality gap with the algebraic Lagrangian dual.     

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.     

PRECONDITIONING HIGHER ORDER FINITE ELEMENT SYSTEMS BY ALGEBRAIC MULTIGRID METHOD OF LINEAR ELEMENTS

We present and analyze a robust preconditioned conjugate gradient method for the higher order Lagrangian finite element systems of a class of elliptic problems. An auxiliary linear element stiffness matrix is chosen to be the preconditioner for higher order finite elements. Then an algebraic multigrid method of linear finite element is applied for solving the preconditioner. The optimal condition number which is independent of the mesh size is obtained. Numerical experiments confirm the efficiency of the algorithm.     

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.     

Superconvergence analysis of fully discrete finite element methods for semilinear parabolic optimal control problems

We study the superconvergence property of fully discrete finite element approximation for quadratic optimal control problems governed by semilinear parabolic equations with control constraints. The time discretization is based on difference methods, whereas the space discretization is done using finite element methods. The state and the adjoint state are approximated by piecewise linear functions and the control is approximated by piecewise constant functions. First, we define a fully discrete finite element approximation scheme for the semilinear parabolic control problem. Second, we derive the superconvergence properties for the control, the state and the adjoint state. Finally, we do some numerical experiments for illustrating our theoretical results.     

Navier-Stokes方程的最佳有限元非线性Galerkin算法

1．引言对于Navier－Stokes方程有限元数值求解方面的研究已有很多的文章和专著,多数是采用有限元Galerkin算法,例见文献[1-4]．然而,由于Navier-Stokes方程在大雷诺数时有其强的非线性性和对时间土的长期依赖性,用计算机求解Navier－Stokes方程在速度和容量方面是难以承受的．为了克服这些困难,最近人们提出了有限元非线性Galerkin算法,见文献卜8］,然而这种算法只是在某一有限时刻之后具有好的收敛速度,在初始时刻的某一区间不能达到好的收敛速度．本文应用Taylor展开技术导出了数值求解二维非定常Navier－Stokes方程的最佳…     

Galerkin-FEM for obtaining the numerical solution of the linear fractional Klein-Gordon equation

In this paper, an efficient numerical method for solving the linear fractional Klein-Gordon equation (LFKGE) is introduced. The proposed method depends on the Galerkin finite element method (GFEM) using quadratic B-spline base functions and replaces the Caputo fractional derivative using $L2$ discretization formula. The introduced technique reduces LFKGE to a system of algebraic equations, which solved using conjugate gradient method. The study the stability analysis to the approximation obtained by the proposed scheme is given. To test the accuracy of the proposed method we evaluated the error norm $L_{2}$. It is shown that the presented scheme is unconditionally stable. Numerical example is given to show the validity and the accuracy of the introduced algorithm.     

A quadrature finite element method for semilinear second‐order hyperbolic problems

In this work we propose and analyze a fully discrete modified Crank–Nicolson finite element (CNFE) method with quadrature for solving semilinear second‐order hyperbolic initial‐boundary value problems. We prove optimal‐order convergence in both time and space for the quadrature‐modified CNFE scheme that does not require nonlinear algebraic solvers. Finally, we demonstrate numerically the order of convergence of our scheme for some test problems. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

A robust optimal preconditioner for the mixed finite element discretization of elliptic optimal control problems

In this paper, we consider the efficient solving of the resulting algebraic system for elliptic optimal control problems with mixed finite element discretization. We propose a block‐diagonal preconditioner for the symmetric and indefinite algebraic system solved with minimum residual method, which is proved to be robust and optimal with respect to both the mesh size and the regularization parameter. The block‐diagonal preconditioner is constructed based on an isomorphism between appropriately chosen solution space and its dual for a general control problem with both state and gradient state observations in the objective functional. Numerical experiments confirm the efficiency of our proposed preconditioner.     

加罚Navier—Stokes方程的最佳非线性Galerkin算法

该文提出了求解二维加罚Navier-Stokes方程的最佳非线性Galerkin算法．这个算法在于在粗网格有限元空间上求解一非线性子问题，在细网格增量有限元空间Wh上求解一线性子问题．如果线性有限元被使用及，则该算法具有和有限元Galerkin算法同阶的收敛速度．然而该文提出的算法可以节省可观的计算时间．