几乎不可压缩线性弹性问题的多重网格Uzawa型混合有限元方法

该文针对几乎不可压缩弹性问题,设计了多重网格Uzawa型混合有限元方法,成功克服了"闭锁"现象.通过引入"压力"变量p将弹性问题转化为一个鞍点型系统,对该系统将Uzawa型迭代法和多重网格方法相结合,建立了多重网格和套迭代多重网格Uzawa型混合有限元方法,并给出了该算法的收敛性.数值算例验证了方法的有效性和稳定性.     

自由边界问题的自适应Uzawa块松弛算法

利用增广Lagrange乘子法和自适应法则，得到求解单侧障碍自由边界问题的自适应Uzawa块松弛法.单侧障碍自由边界问题离散为有限维线性互补问题，等价于一个用辅助变量和增广Lagrange函数表示的鞍点问题.采用Uzawa块松弛算法求解该问题得到一个两步迭代法，主要的子问题为一个线性问题，同时能显式求解辅助变量.由于Uzawa块松弛算法的收敛速度显著依赖于罚参数，而且对具体问题很难选择合适的罚参数.为提高算法的性能，提出了自适应法则，该方法自动调整每次迭代所需的罚参数.数值结果验证了该算法的理论分析.     

具有滑动边界条件Stokes问题的自适应Uzawa块松弛算法

对一类具有非线性滑动边界条件的Stokes问题,得到了求其数值解的自适应Uzawa块松弛算法（SUBRM）.通过该问题导出的变分问题,引入辅助变量将原问题转化为一个基于增广Lagrange函数表示的鞍点问题,并采用Uzawa块松弛算法（UBRM）求解.为了提高算法性能,提出利用迭代函数自动选取合适罚参数的自适应法则.该算法的优点是每次迭代只需计算一个线性问题,同时显式计算辅助变量.对算法的收敛性进行了理论分析,最后用数值结果验证了该算法的可行性和有效性.     

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

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

基于对偶混合变分形式的Uzawa型算法

基于弹性接触问题的三变量（应力，位移，接触边界位移）对偶混合变分形式，对混合有限元离散化的单边约束问题，提出了一种Uzawa型算法。首先证明了迭代算法的收敛性，然后用数值例子验证了迭代算法的有效性。     

一类求解鞍点问题的广义不精确Uzawa方法

本文提出了一类求解大型稀疏鞍点问题的新的广义不精确Uzawa算法.该方法不仅可以包含 前人的方法, 而且可以拓展出很多新方法. 理论分析给出该方法收敛的条件, 并详细的分析了其收敛性质和参数矩阵的选取方法. 通过对有限元离散的Stokes问题的数值实验表明, 新方法是行之有效的, 其收敛速度明显优于原来的算法.     

Hilbert空间中的非严格凸情况的Uzawa算法

无穷维空间中目标泛函为严格凸时的Uzawa算法已由Bensoussan等提出.一般说来,对于普通凸泛函,这种算法无效.这是因为在非严格凸情况时,对偶泛函一般是不可微的.本文提出Hilbert空间中的非严格凸情况的Uzawa算法.对于可分离问题,我们就得到了价格分解方法.考虑问题这里,     

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

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

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

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

平面弹性问题自适应有限元方法的收敛性分析

针对平面弹性问题,首先采用基于最新顶点二分法的网格加密方法,给出一种不需要标记振荡项和加密单元、不需要满足"内节点"性质的自适应有限元方法.其次,通过对各层网格上解函数和误差指示子的分析,利用相邻网格层上解函数的正交性、解函数和真解函数的能量误差的上界估计、相邻网格层上误差指示子的近似压缩性等结果,从理论上严格证明了该自适应有限元方法是收敛的.最后数值实验验证了该自适应有限元方法是收敛的和鲁棒的.     

Multiphysics mixed finite element method with Nitsche's technique for Stokes-poroelasticity problem

In this article, we propose a multiphysics mixed finite element method with Nitsche's technique for Stokes-poroelasticity problem. Firstly, we reformulate the poroelasticity part of the original problem by introducing two pseudo-pressures to into a “fluid–fluid” coupled problem so that we can use the classical stable finite element pairs to deal with this problem conveniently. Then, we prove the existence and uniqueness of weak solution of the reformulated problem. And we use Nitsche's technique to approximate the coupling condition at the interface to propose a loosely-coupled time-stepping method to solve three subproblems at each time step–a Stokes problem, a generalized Stokes problem and a mixed diffusion problem. And the proposed method does not require any restriction on the choice of the discrete approximation spaces on each side of the interface provided that appropriate quadrature methods are adopted. Also, we give the stability analysis and error estimates of the loosely-coupled time-stepping method. Finally, we give the numerical tests to show that the proposed numerical method has a good stability and no “locking” phenomenon.     

An overlapping domain decomposition preconditioner for a class of discontinuous Galerkin approximations of advection-diffusion problems

We consider a scalar advection-diffusion problem and a recently proposed discontinuous Galerkin approximation, which employs discontinuous finite element spaces and suitable bilinear forms containing interface terms that ensure consistency. For the corresponding sparse, nonsymmetric linear system, we propose and study an additive, two-level overlapping Schwarz preconditioner, consisting of a coarse problem on a coarse triangulation and local solvers associated to a family of subdomains. This is a generalization of the corresponding overlapping method for approximations on continuous finite element spaces. Related to the lack of continuity of our approximation spaces, some interesting new features arise in our generalization, which have no analog in the conforming case. We prove an upper bound for the number of iterations obtained by using this preconditioner with GMRES, which is independent of the number of degrees of freedom of the original problem and the number of subdomains. The performance of the method is illustrated by several numerical experiments for different test problems using linear finite elements in two dimensions.

     

Analysis of optimal preconditioners for CutFEM

In this article, we consider a class of unfitted finite element methods for scalar elliptic problems. These so-called CutFEM methods use standard finite element spaces on a fixed unfitted triangulation combined with the Nitsche technique and a ghost penalty stabilization. As a model problem we consider the application of such a method to the Poisson interface problem. We introduce and analyze a new class of preconditioners that is based on a subspace decomposition approach. The unfitted finite element space is split into two subspaces, where one subspace is the standard finite element space associated to the background mesh and the second subspace is spanned by all cut basis functions corresponding to nodes on the cut elements. We will show that this splitting is stable, uniformly in the discretization parameter and in the location of the interface in the triangulation. Based on this we introduce an efficient preconditioner that is uniformly spectrally equivalent to the stiffness matrix. Using a similar splitting, it is shown that the same preconditioning approach can also be applied to a fictitious domain CutFEM discretization of the Poisson equation. Results of numerical experiments are included that illustrate optimality of such preconditioners for the Poisson interface problem and the Poisson fictitious domain problem.     

Local projection stabilization of equal order interpolation applied to the Stokes problem

The local projection stabilization allows us to circumvent the Babuška-Brezzi condition and to use equal order interpolation for discretizing the Stokes problem. The projection is usually done in a two-level approach by projecting the pressure gradient onto a discontinuous finite element space living on a patch of elements. We propose a new local projection stabilization method based on (possibly) enriched finite element spaces and discontinuous projection spaces defined on the same mesh. Optimal order of convergence is shown for pairs of approximation and projection spaces satisfying a certain inf-sup condition. Examples are enriched simplicial finite elements and standard quadrilateral/hexahedral elements. The new approach overcomes the problem of an increasing discretization stencil and, thus, is simple to implement in existing computer codes. Numerical tests confirm the theoretical convergence results which are robust with respect to the user-chosen stabilization parameter.

     

New algorithms for the split variational inclusion problems and application to split feasibility problems

ABSTRACT

In this paper, we suggest two new iterative methods for finding an element of the solution set of split variational inclusion problem in real Hilbert spaces. Under suitable conditions, we present weak and strong convergence theorems for these methods. We also apply the proposed algorithms to study the split feasibility problem. Finally, we give some numerical results which show that our proposed algorithms are efficient and implementable from the numerical point of view.     

A modified streamline diffusion method for solving the stationary Navier-Stokes equation

Summary Recently, Hughes et al. [11, 12] proposed new finite element schemes of Petrov-Galerkin type for solving the Stokes problem which do not require the discrete version of the Ladyshenskaya-Babuka-Brezzi-condition (LBB-condition). In this paper we derive a conforming finite element method for solving the stationary Navier-Stokes equations which combines the advantages of arbitrary finite element spaces for velocity/pressure with the favourable properties of the streamline diffusion method in the case of moderate and high Reynolds number.     

Weak Galerkin finite element methods combined with Crank-Nicolson scheme for parabolic interface problems

This article is devoted to the a priori error estimates of the fully discrete Crank-Nicolson approximation for the linear parabolic interface problem via weak Galerkin finite element methods (WG-FEM). All the finite element functions are discontinuous for which the usual gradient operator is implemented as distributions in properly defined spaces. Optimal order error estimates in both $L^{\infty}(H^1)$ and $L^{\infty}(L^2)$ norms are established for lowest order WG finite element space $({\cal P}_{k}(K),\;{\cal P}_{k-1}(\partial K),\;\big[{\cal P}_{k-1}(K)\big]^2)$. Finally, we give numerical examples to verify the theoretical results.     

Stokes问题的一种新的混合有限元逼近

为了求解Ｓｔｏｋｅｓ问题，本文构造出了一类新的满足ＢＢ－条件的有限元空间对，并给出了相应的超收敛分析．     

Local projection stabilization for advection–diffusion–reaction problems: One-level vs. two-level approach

Local projection stabilization (LPS) of finite element methods is a new technique for the numerical solution of transport-dominated problems. The main aim of this paper is a critical discussion and comparison of the one- and two-level approaches to LPS for the linear advection–diffusion–reaction problem. Moreover, the paper contains several other novel contributions to the theory of LPS. In particular, we derive an error estimate showing not only the usual error dependence on the mesh width but also on the polynomial degree of the finite element space. Based on this error estimate, we propose a definition of the stabilization parameter depending on the data of the solved problem. Unlike other papers on LPS methods, we observe that the consistency error may deteriorate the convergence order. Finally, we explain the relation between the LPS method and residual-based stabilization techniques for simplicial finite elements.     

The Uzawa–HSS method for saddle-point problems

Based on the Hermitian and skew-Hermitian splitting iteration scheme, we propose a Uzawa-type iteration method for solving a class of saddle-point problems whose coefficient matrix has non-Hermitian positive definite (1, 1)-block. The convergence properties of this novel method are analyzed, which show that the Uzawa-type iteration method is convergent if the iteration parameters satisfy suitable restrictions.