一维C~1有限元EEP超收敛位移计算简约格式的误差估计

该文对一维C1有限元后处理超收敛计算的EEP(单元能量投影)法简约格式中的位移解给出误差估计的数学证明,即对足够光滑问题的m(3)次单元的有限元解答,采用EEP法简约格式得到的单元内任一点位移超收敛解均可以达到hm+2的收敛阶,比常规有限元位移解的收敛阶至少高一阶。     

基于p型超收敛计算的一维有限元自适应分析

基于提高单元阶次的p型超收敛算法,可以在有限元解答基础上求得超收敛解。用该超收敛解代替精确解可以对有限元解答进行可靠的误差估计。对Zienkiewicz网格划分策略进行一定的改进,得到一种更有效的网格划分策略。基于可靠的误差估计和高效的网格划分,可以进行有限元自适应求解。数值试验表明,该文的自适应求解方案能够得到较优的网格和满足误差限的解答。     

关于单元能量投影法的两点注记

最近,袁驷等基于力学原理提出了一种一维有限元超收敛后处理计算格式,称为单元能量投影(EEP)法。大量数值例子显示:若真解充分光滑,对m次有限元解,EEP法后处理节点恢复导数具有h2m阶精度。首先利用限元超收敛理论中的一个基本估计式证明了线性元(m=1)节点恢复导数具有h2阶精度。另外,对EEP法高次元的内点计算公式提出了一点简化。     

一维C~1有限元后处理超收敛计算的新型算法

该文针对一维C~1有限元提出一种新型后处理超收敛算法,由该法可求得全域超收敛的位移和内力。该法在单个单元上逐单元实施,通过将单元端部结点位移有限元解设为本质边界条件,在单元域上建立单元位移恢复的局部边值问题。对该局部边值问题,以单元内任一点为结点将单元划分为两个子单元进行有限元求解,子单元次数与原单元相同,由此获得该点位移的超收敛解。对单元内所有点均作这样的超收敛求解,可获得整个单元上位移的超收敛解。该位移超收敛解光滑、连续,通过对该位移超收敛解求导可获得转角和内力的超收敛解。数值结果表明,对于m次元,该法得到的挠度和转角具备与结点位移相同的h~(2m-2)阶的最佳收敛阶;弯矩和剪力则分别具备h~(2m-3)、h~(2m-4)阶的收敛阶,均比相应有限元解高出m-2阶。该法可靠、高效、易于实施,是一种颇具潜力的后处理超收敛算法。     

一维Ritz有限元超收敛计算的EEP法简约格式的误差估计

该文对一维问题Ritz有限元后处理超收敛计算的EEP(单元能量投影)法简约格式给出误差估计的数学证明,即对足够光滑问题的(>1)次单元的有限元解答,采用EEP法简约格式计算得到的单元内任一点位移和应力(导数)超收敛解均可以达到的收敛阶,即位移比常规有限元解的收敛阶至少高一阶,而应力则至少高二阶。     

Sobolev型方程各向异性Carey元解的高精度分析

利用积分恒等式和插值后处理技术,本文在各向异性网格上对Sobolev型方程的Carey非协调有限元解进行高精度算法分析.首先,根据Carey元的特性,即其有限元解的线性插值和线性元解相同,我们构造插值后处理算子,得到了有限元解的超逼近性质和整体超收敛及后验误差估计.接着,根据误差渐近展开式,运用外推方法,进一步得到了具有四阶精度的近似解.     

二维泊松方程问题Lagrange型有限元p型超收敛算法

该文针对二维泊松方程问题的Lagrange型有限元法提出了一种p型超收敛算法。该法受有限元线法对二维问题降维思想的启发,基于网格结点位移的天然超收敛性,通过从网格中取出一行对边相邻的单元作一子域,将子域内各单元另一对边解答取为原有限元解答,在子域上建立真解近似满足的局部偏微分方程边值问题,对该局部边值问题,沿对边方向单向提高单元阶次进行有限元求解获得单元对边上的超收敛解。单元另一对边上的超收敛解可通过另一方向的单元行类似获得。在单元边超收敛解的基础上,依次取出各个单元,以单元边位移超收敛解为Dirichlet边界条件,双向提高单元阶次对原泊松方程问题进行有限元求解即可获得全域超收敛解。数值算例表明,通过简单的后处理计算本法可显著提高解答的精度和收敛阶。     

平面曲梁有限元静力分析的p型超收敛算法

该文对平面曲梁有限元静力分析提出一种p型超收敛算法,由该法可求得曲梁结构全域超收敛的位移和内力。该法基于有限元解答中结点位移的超收敛特性,通过将单元端部结点位移有限元解设为本质边界条件,在单元上建立单元位移近似满足的线性常微分方程边值问题,对该边值问题采用更高次数的多项式进行有限元求解获得单元上位移的超收敛解,将位移超收敛解代入内力表达式获得内力的超收敛解。该法简单、直接,通过很少量的计算即能显著提高位移和内力的精度和收敛阶。数值结果显示,该法高效、可靠,是一个颇具潜力的方法。     

二阶非线性常微分方程边值问题有限元p型超收敛计算

该文提出二阶非线性常微分方程边值问题有限元求解的p型超收敛算法。该法基于有限元解答中结点解的超收敛特性,以单元端部的有限元解作为单元边界条件,通过泰勒展开技术在单个单元上建立了单元解近似满足的线性常微分方程边值问题,对该局部线性边值问题采用单个高次元进行有限元求解获得该单元上的超收敛解,对每个单元实施上述过程可获得全域的超收敛解。该法为后处理法,且后处理计算仅在单个单元上进行,通过很少量的计算即能显著提高解答的精度和收敛阶。数值结果显示,该法高效、可靠,是一个颇具潜力的方法。     

高维抛物型方程的一个高精度恒稳定的交替方向格式

本文对高维抛物型方程构造了一个高精度恒稳定的交替方向格式.当2≤p≤4时,格式的局部截断误差阶可达到O(τ2+h4),当p=3时,将Richardson外推法应用于本文格式,得到了O(τ3+h6)阶精度的近似解.最后通过数值实例验证了我们对所得格式所作的理论分析是正确的.     

关于连续细分方程的一个注记

给出了连续细分方程在Ｌ＾ｐ（Ｒ＾ｓ）（１≤ｐ≤∞）中解的存在性和一些判别准则。     

各向异性网格下线性三角形元的超收敛性分析

讨论在有限制的各向异性网格下用线性三角形有限元逼近二阶椭圆边值问题,利用单元构造的特殊性和一些新的技巧得到相应的超逼近和超收敛结果。数值结果与我们的理论分析相吻合。该文的结果对发展后验估计及设计数值求解二阶问题自适应算法是很有意义的。     

General Solutions for a Class of Inverse Quadratic Eigenvalue Problems

Based on various matrix decompositions, we compare different techniques for solving the inverse quadratic eigenvalue problem, where $n×n$ real symmetric matrices $M$, $C$ and $K$ are constructed so that the quadratic pencil $Q(λ) = λ^{2}M+λC+K$ yields good approximations for the given $k$ eigenpairs. We discuss the case where $M$ is positive definite for $1≤ k≤n$, and a general solution to this problem for $n+1≤k≤2n$. The efficiency of our methods is illustrated by some numerical experiments.     

Prediction-Correction Scheme for Decoupled Forward Backward Stochastic Differential Equations with Jumps

By introducing a new Gaussian process and a new compensated Poisson random measure, we propose an explicit prediction-correction scheme for solving decoupled forward backward stochastic differential equations with jumps (FBSDEJs). For this scheme, we first theoretically obtain a general error estimate result, which implies that the scheme is stable. Then using this result, we rigorously prove that the accuracy of the explicit scheme can be of second order. Finally, we carry out some numerical experiments to verify our theoretical results.     

Superconvergence recovery technique and a posteriori error estimators

A new superconvergence recovery technique for finite element solutions is presented and discussed for one dimensional problems. By using the recovery technique a posteriori error estimators in both energy norm and maximum norm are presented for finite elements of any order. The relation between the postprocessing and residual types of energy norm error estimators has also been demonstrated.     

基于l_(2,p)-范数的ECT图像重建算法

针对电容层析成像系统图像重建过程中Tiknonov正则化解过度光滑引起的重建图像细节信息丢失问题,引入l_(2,p)(0p≤1)的混合范数作为正则化算法的数据项和正则化项。混合范数l_(2,p)利用了欧氏范数l_2的光滑性和分数范数l_p(0p≤1)的稀疏性,不仅比范数L_(2,1)具有更好的联合稀疏性,对噪声的抗干扰性也更强,进而针对l_(2,p)矩阵范数的非凸、非Lipschitz连续问题提出一种新的电容层析成像图像重建模型。实验结果表明,基于矩阵混合范数l_(2,p)极小化优化模型的正则化算法相比牛顿迭代、奇异值分解、共轭梯度算法具有更强的适应性,更高的图像分辨率及更好的成像质量。     

A superconvergent point interpolation method (SC‐PIM) with piecewise linear strain field using triangular mesh

A superconvergent point interpolation method (SC‐PIM) is developed for mechanics problems by combining techniques of finite element method (FEM) and linearly conforming point interpolation method (LC‐PIM) using triangular mesh. In the SC‐PIM, point interpolation methods (PIM) are used for shape functions construction; and a strain field with a parameter α is assumed to be a linear combination of compatible stains and smoothed strains from LC‐PIM. We prove theoretically that SC‐PIM has a very nice bound property: the strain energy obtained from the SC‐PIM solution lies in between those from the compatible FEM solution and the LC‐PIM solution when the same mesh is used. We further provide a criterion for SC‐PIM to obtain upper and lower bound solutions. Intensive numerical studies are conducted to verify these theoretical results and show that (1) the upper and lower bound solutions can always be obtained using the present SC‐PIM; (2) there exists an α_exact∈(0, 1) at which the SC‐PIM can produce the exact solution in the energy norm; (3) for any α∈(0, 1) the SC‐PIM solution is of superconvergence, and α=0 is an easy way to obtain a very accurate and superconvergent solution in both energy and displacement norms; (4) a procedure is devised to find a α_prefer∈(0, 1) that produces a solution very close to the exact solution. Copyright © 2008 John Wiley & Sons, Ltd.     

求解二阶椭圆型偏微分方程的一种有限体积元格式

针对二维二阶椭圆型偏微分方程边值问题提出了一种新型的有限体积元格式，证明了该格式按离散能量模具有二阶收敛精度，具体算例表明，该格式计算效果良好。     

Transmitter pre-filtering for the downlink of a time-division-duplex/direct sequencecode division multiple access system over time-varying multipath fading channels

In this paper, we investigate an optimised transmitter pre-filtering technique for downlink time-division-duplex (TDD) code division multiple access (CDMA) communications, which employs the conventional matched filter (MF) detector at the mobile receivers. The proposed pre-filtering technique eliminates the multiple-access interference and intersymbol interference (MAI/ISI) effects by applying a very simple transmission scheme that combines a signal transformation with a cyclic prefix strategy under a power constraint condition. Two constrained pre-filtering transformations are suggested depending on the information required at the mobile unit. An open-loop transmitter pre-filtering is first formulated; however, this solution does not consider the properties of the noise at the mobile receiver. A second solution is then presented via a closed-loop transmitter pre-filtering that includes an optimum gain for a given transmit and noise power. Some associated issues such as system efficiency, computational complexity and channel estimation errors are also addressed. Simulation results show that the proposed transmitter pre-filtering scheme can be used to increase the system performance and capacity. In addition, its performance is compared with another similar transmit pre-processing scheme in order to evaluate the performance improvement by the proposed algorithm.     

A high‐order hybridizable discontinuous Galerkin method for elliptic interface problems

We present a high‐order hybridizable discontinuous Galerkin method for solving elliptic interface problems in which the solution and gradient are nonsmooth because of jump conditions across the interface. The hybridizable discontinuous Galerkin method is endowed with several distinct characteristics. First, they reduce the globally coupled unknowns to the approximate trace of the solution on element boundaries, thereby leading to a significant reduction in the global degrees of freedom. Second, they provide, for elliptic problems with polygonal interfaces, approximations of all the variables that converge with the optimal order of k + 1 in the L²(Ω)‐norm where k denotes the polynomial order of the approximation spaces. Third, they possess some superconvergence properties that allow the use of an inexpensive element‐by‐element postprocessing to compute a new approximate solution that converges with order k + 2. However, for elliptic problems with finite jumps in the solution across the curvilinear interface, the approximate solution and gradient do not converge optimally if the elements at the interface are isoparametric. The discrepancy between the exact geometry and the approximate triangulation near the curved interfaces results in lower order convergence. To recover the optimal convergence for the approximate solution and gradient, we propose to use superparametric elements at the interface. Copyright © 2012 John Wiley & Sons, Ltd.