粘弹性方程一种新的分裂正定混合元法

本文用分裂正定混合有限元方法研究二阶粘弹性方程. 首先构造一种新的分裂正定混合变分形式和基于这种分裂正定混合变分形式关于时间的半离散格式, 然后绕开关于空间变量的半离散化格式, 直接从时间半离散出发构造出全离散化的分裂正定混合有限元格式, 并给出这种分裂正定混合有限元解的误差估计. 这种研究思路使得理论论证变得更简单,这是处理二阶粘弹性方程的一种新的尝试.     

长短波方程的高阶紧致格式（英文）

在空间方向用高阶紧致格式离散,时间方向分别用CNI格式、Richardson格式和分裂步CNI格式离散,得到了长短波方程的一些数值格式.这些格式在时间方向是二阶收敛的,空间方向是四阶的,而用到的模版与二阶中心差分格式是一样的.数值结果表明,与中心格式相比,新提出的格式较已有格式计算效率更高.同时,从数值结果可以猜测CNI格式和分裂步CNI格式能够保持原问题的一些守恒量.     

椭圆型方程的重叠型区域分裂混合元方法

本文研究椭圆型方程的重叠型区域分解混合元方法，对第一边值和第二边值问题，分别给出了离散形式的区域分解混合元格式；证明了区域分裂格式解的存在唯一性和算法的收敛性，并给出数值算例．     

四阶抛物偏微分方程的H1-Galerkin混合元方法及数值模拟

到目前为止, H¹-Galerkin 混合有限元方法研究的问题仅局限于二阶发展方程. 然而对于高阶发展方程, 特别是重要的四阶发展方程问题的研究却没有出现. 本文首次提出四阶发展方程的H¹-Galerkin 混合有限元方法, 为了给出理论分析的需要, 我们考虑四阶抛物型发展方程. 通过引进三个适当的中间辅助变量, 形成四个一阶方程组成的方程组系统, 提出四阶抛物型方程的H¹-Galerkin 混合有限元方法. 得到了一维情形下的半离散和全离散格式的最优收敛阶误差估计和多维情形的半离散格式误差估计, 并采用迭代方法证明了全离散格式的稳定性. 最后, 通过数值例子验证了提出算法的可行性. 在一维情况下我们能够同时得到未知纯量函数、一阶导数、负二阶导数和负三阶导数的最优逼近解, 这一点是以往混合元方法所不能得到的.     

求解变系数Cahn-Hilliard-Brinkman方程有限元方法的误差分析

本文研究求解变系数Cahn-Hilliard-Brinkman方程有限元方法的误差分析.在时间格式上采用能量凸分裂法以及在空间格式上采用混合有限元法进行离散,证明了全离散格式是能量衰减的.在误差分析中,利用Cauchy中值定理将含浓度和Peclet数的项分解为两项,结果表明所提出的格式在时间上是二阶精度的.     

区域分裂法求非线性抛物方程的扩张混合元解

针对非线性抛物方程,给出了全离散的扩张混合元格式,利用一个建立在非重叠型区域分裂技巧上的并行迭代法求解了最后的非线性代数方程组,证明了迭代法的收敛性并给出了最优阶的误差估计.     

一类非线性抛物方程H~1-Galerkin混合有限元方法的高精度分析

研究了非线性抛物方程的H~1-Galerkin混合有限元方法.利用双线性元及零阶RaviartThomas元,在不提高原始解正则性的前提下,创新性的使用分裂技巧等讨论了半离散格式下和Euler全离散格式下的关于原始变量u的H~1(Ω)模及流量p=▽u的H(div;Ω)模的超逼近性质.数值算例证明了理论的正确性.     

带跳随机波动率模型的高阶ADI分裂格式

针对带跳随机波动率模型满足的偏积分微分方程,提出一种新的高阶交替方向隐式（ADI）有限差分格式,该模型是一个具有混合导数和非常数系数的对流扩散型初边值问题.我们将不同的高阶空间离散与时间步ADI分裂格式相结合,得到了一种空间四阶精度、时间二阶精度的有效方法,并采用Fourier方法分析了高阶ADI格式的稳定性.最后,通过对欧式看跌期权定价模型进行数值实验证实了数值方法的高阶收敛性.     

Extended Fisher-Kolmogorov方程的一类低阶非协调混合有限元方法

该文的主要目的是研究Extended Fisher-Kolmogorov(EFK)方程的一类低阶非协调元混合有限元方法.首先引入一个中间变量v=-△u将原方程分裂为两个二阶方程,建立了一个非协调混合元逼近格式,并通过构造一个李雅普诺夫泛函证明了半离散格式逼近解的一个先验估计并证明了解的存在唯一性.在半离散格式下,利用这个先验估计和单元的性质,证明了原始变量u和中间变量v的H~1-模意义下的最优误差估计.进一步地,借助高精度技巧得到了O(h~2)阶的超逼近性质.其次,建立了一个新的线性化的向后Euler全离散格式,通过对相容误差和非线性项采用新的分裂技术,导出了u和v的H~1-模意义下具有O(h+τ)和O(h~2+τ)的最优误差估计和超逼近结果.这里,h,τ分别表示空间剖分参数和时间步长.最后,给出了一个数值算例,计算结果验证了理论分析的正确性,该文的分析为利用非协调混合有限元研究其它四阶初边值问题提供了一个可借鉴的途径.     

一类四阶抛物方程一个低阶非协调混合元方法的超收敛分析

对一类四阶抛物方程利用EQ_1~(rot)元和零阶Raviart-Thomas元提出一个低阶非协调混合元逼近格式.首先证明半离散格式逼近解的存在唯一性.其次,基于上述两个单元的高精度分析,利用对时间变量的导数转移技巧并借助插值后处理技术,在半离散格式下得到了原始变量u,中间变量v=—△u的H~1-模意义下以及流量=—▽u的L~2-模意义下O(h~2)阶的超逼近性质和超收敛结果.最后,证明向后Euler全离散格式逼近解的存在唯一性,并通过采用一个新的分裂技巧,导出u和v在H~1-模意义下以及在L~2-模意义下关于h的无条件的O(h~2+τ)阶的超逼近性质和超收敛结果.这里,h及τ分别表示空间剖分参数和时间步长.     

一类广义Lyapunov矩阵方程的正定解

研究了双线性系统中的一类广义Lyapunov矩阵方程的正定解.基于混合单调算子不动点定理,给出新的存在正定解的充分条件,构造了求其正定解的不动点迭代方法,并给出了迭代误差估计公式.数值实验表明新方法是可行的.     

Splitting positive definite mixed element method for viscoelasticity wave equation

A splitting positive definite mixed finite element method is proposed for second-order viscoelasticity wave equation. The proposed procedure can be split into three independent symmetric positive definite integro-differential sub-system and does not need to solve a coupled system of equations. Error estimates are derived for both semidiscrete and fully discrete schemes. The existence and uniqueness for semidiscrete scheme are proved. Finally, a numerical example is provided to illustrate the efficiency of the method.     

多孔介质驱动问题的混合元最小二乘特征有限元方法及其收敛分析

１．引言多孔介质二相驱动问题的数学模型是偶合的非线性偏微分方程组的初边值问题．该问题可转化为压力方程和浓度方程［１－４］．浓度方程一般是对流占优的对流扩散方程,它的对流速度依赖于比浓度方程的扩散系数大得多的Ｆａｒｃｙ速度．因此Ｄａｒｃｙ速度的求解精度直接影响着浓度的求解精度．为了提高速度的求解精度,７０年代Ｐ．Ａ．Ｒａｖｉａｔ和Ｊ．Ｍ．Ｔｈｏｍａｓ提出混合有限元方法［５］．Ｊ．ＤｏｕｇｌａｓＪｒ,Ｔ．Ｆ．Ｒｕｓｓｅｌｌ,Ｒ．Ｅ．Ｅｗｉｎｇ,Ｍ．Ｆ．Ｗｈｅｅｌｅｒ［１］－［４］,［９］,［１２］袁…     

半导体器件瞬态模拟的对称正定混合元方法

提出具有对称正定特性的混合元格式求解非稳态半导体器件瞬态模拟问题。提出一个最小二乘混合元方法、一个新的具有分裂和对称正定性质的混合元格式和一个解经典混合元方程的对称正定失窃工格式求解电场位势和电场强度方程;提出一个最小二乘混合元格式求解关于电子与空穴浓度的非稳态对流扩散方程,浓度函数和流函数被同时求解;采用标准的有限元方法求解热传导方程。建立了误差分析理论。     

A Priori Error Estimate of Splitting Positive Definite Mixed Finite Element Method for Parabolic Optimal Control Problems

In this paper, we propose a splitting positive definite mixed finite element method for the approximation of convex optimal control problems governed by linear parabolic equations, where the primal state variable $y$ and its flux $σ$ are approximated simultaneously. By using the first order necessary and sufficient optimality conditions for the optimization problem, we derive another pair of adjoint state variables $z$ and $ω$, and also a variational inequality for the control variable $u$ is derived. As we can see the two resulting systems for the unknown state variable $y$ and its flux $σ$ are splitting, and both symmetric and positive definite. Besides, the corresponding adjoint states $z$ and $ω$ are also decoupled, and they both lead to symmetric and positive definite linear systems. We give some a priori error estimates for the discretization of the states, adjoint states and control, where Ladyzhenkaya-Babuska-Brezzi consistency condition is not necessary for the approximation of the state variable $y$ and its flux $σ$. Finally, numerical experiments are given to show the efficiency and reliability of the splitting positive definite mixed finite element method.     

Multilevel Preconditioners for Mixed Methods for Second Order Elliptic Problems

A new approach for constructing algebraic multilevel preconditioners for mixed finite element methods for second order elliptic problems with tensor coefficients on general geometry is proposed. The linear system arising from the mixed methods is first algebraically condensed to a symmetric, positive definite system for Lagrange multipliers, which corresponds to a linear system generated by standard nonconforming finite element methods. Algebraic multilevel preconditioners for this system are then constructed based on a triangulation of the domain into tetrahedral substructures. Explicit estimates of condition numbers and simple computational schemes are established for the constructed preconditioners. Finally, numerical results for the mixed finite element methods are presented to illustrate the present theory.     

Positive definite balancing Neumann–Neumann preconditioners for nearly incompressible elasticity

In this paper, a positive definite Balancing Neumann–Neumann (BNN) solver for the linear elasticity system is constructed and analyzed. The solver implicitly eliminates the interior degrees of freedom in each subdomain and solves iteratively the resulting Schur complement, involving only interface displacements, using a BNN preconditioner based on the solution of a coarse elasticity problem and local elasticity problems with natural and essential boundary conditions. While the Schur complement becomes increasingly ill-conditioned as the materials becomes almost incompressible, the BNN preconditioned operator remains well conditioned. The main theoretical result of the paper shows that the proposed BNN method is scalable and quasi-optimal in the constant coefficient case. This bound holds for material parameters arbitrarily close to the incompressible limit. While this result is due to an underlying mixed formulation of the problem, both the interface problem and the preconditioner are positive definite. Numerical results in two and three dimensions confirm these good convergence properties and the robustness of the methods with respect to the almost incompressibility of the material.     

An improved Perry conjugate gradient method with adaptive parameter choice

In this paper, we present a conjugate gradient method for solving unconstrained optimization problems. Motivated by Perry conjugate gradient method and Dai-Liao method, an improved Perry update matrix is proposed to overcome the non-symmetric positive definite property of the Perry matrix. The parameter in the update matrix is determined by minimizing the condition number of the iterative matrix which can ensure the positive definite property. The obtained method can also be considered as a modified form of CG-DESCENT method with an adjusted term. Under some mild conditions, the presented method is global convergent. Numerical experiments under CUTEst environment show that the proposed algorithm is promising.     

On the nonlinear matrix equation

Based on fixed point theorems for monotone and mixed monotone operators in a normal cone, we prove that the nonlinear matrix equation always has a unique positive definite solution. A conjecture which is proposed in [X.G. Liu, H. Gao, On the positive definite solutions of the matrix equation X^s±A^TX^-tA=I_n, Linear Algebra Appl. 368 (2003) 83–97] is solved. Multi-step stationary iterative method is proposed to compute the unique positive definite solution. Numerical examples show that this iterative method is feasible and effective.