三级四阶显式辛R-K-N格式的完全构造

s级p阶辛Runge-Kutta-Nystr\"om(R-K-N)方法的一种充要条件是用关于参数的非线性方程组来表示的,辛R-K-N格式的构造问题因而转化为该方程组的求解问题. 在一些特殊的限定条件下, 已有该方程组在s=3,p=4时的两组解,即得到了两个三级四阶显式辛格式. 对于s=3,p=4情形,基于吴方法,利用计算机代数系统Maple及软件包wsolve给出了对应的非线性方程组的全部解, 这样就构造了所有的三级四阶显式辛R-K-N格式, 并证明了三级四阶显式辛R-K-N方法所满足的条件方程有冗余. 数值实验结果显示出新的辛格式在一定的条件下有着较好的误差精度.     

传统隐式Runge-Kutta方法的转换方法

多级隐式Runge-Kutta(RK)方法簇中,除Gauss类方法是s级2s阶的辛方法以外,Radau类方法和Lobatto类方法既不是s级2s阶的方法也不是辛方法.基于隐式RK方法是一类转换RK方法这一特征,利用V-变换和Pade对角逼近,提出了构造高阶RK方法的转换定理.依据转换定理,导出了s级2s阶的Radau方法和s级2s阶的Lobatto方法.利用V-变换和待定系数法,导出了辛Radau方法和辛Lobatto方法.在此基础上,发现并证明了辛Radau方法是s级2s阶的方法.     

二维三温热传导方程组的分数步隐式差分格式

本文给出一个解二维三温热传导方程组的分数步隐式有限差分格式，利用离散变分形式及能量方法，给出差分格式的最优阶离散H^1范数先验误差及稳定性估计。     

Construction and analysis of a new second order nonconforming finite element

构造一个新的二阶非协调有限元,通过新的技巧和方法,将该单元用于一般二阶椭圆问题,得到插值误差和相容性误差,同时达到O(h2)误差阶.     

结构动力学方程的辛RK方法

针对有阻尼和外载荷的线性动力学常微分方程,给出了s级2s阶隐式Gauss-Legendre辛RK(Gauss-Legendre symplectic Runge-Kutta,GLSRK)方法的一种显式高效的执行格式,首次给出了Gauss-Legendre辛RK方法和经典RK方法(classical RK,CRK)的谱半径和单步相位误差的显式表达式,并将两者进行了比较.线性多自由度系统和非线性Rayleigh系统数值算例表明,对结构动力学系统而言,辛RK方法远比经典RK方法优越,在运动学特性和长时间数值模拟方面尤为明显.     

隐式重新启动的Lanczos算法在模型降阶中的应用

主要研究了一种隐式重新启动的L anczos算法在模型降阶中的应用.分析了由这个算法得到的降价后的模型的一些性质,对于一个n阶稳定的线性时不变系统,模型降阶的思想是寻找一个m阶转换函数来近似原系统的n阶转换函数H(s),其中n m.传统的kry lov子空间方法仅仅产生一个不稳定的实现,并且在低频处的误差较大,本文所考虑的隐式重新启动的L anczos方法,能较好的解决上述两个问题.     

基于Mori-Zwanzig格式和偏最小二乘的非线性模型降阶

本征正交分解及Galerkin投影是解决复杂非线性系统模型降阶问题常用的方法.然而,该方法在构造降阶系统过程中只截取基函数的部分模态,这通常会使得降阶系统不准确.针对该问题,提出了对降阶系统误差进行快速校正的方法.首先应用Mori-Zwanzig格式对降阶系统的误差进行分析,理论上得到误差模型的形式和有效预测变量.再通过偏最小二乘方法构造预测变量和系统误差的多元回归模型,建立误差预测模型.将所构造的误差预测模型直接嵌入到原降阶系统,得到新的降阶系统在形式上等价于对原模型的右端采用Petrov-Galerkin投影.最后给出了新的降阶系统的误差估计.数值结果进一步说明了所提方法能有效地提高降阶系统的稳定性和准确性,且具有较高计算效率.     

非协调板元的一般性误差估计式

１．引言 薄板弯曲问题对应于４阶椭圆边值问题,协调有限元求解此问题需要单元具有Ｃ~１连续性,这难于构造且应用不便,因此求解该问题主要应用非协调元．当非协调板元不具有 Ｃ０连续性时,标准能量模误差估计是 ,这一结果不理想,因为对一般的区域,甚至是凸多边形区域,真解只能属于 Ｈ３．近年来,企图将真解属于 Ｈ４的假定改为真解属于 Ｈ３的研究引起重视．针对最简单的三角形非协调板元－Ｍｏｒｌｅｙ元,石钟慈［２］在 Ｈ３假定下,直接利用非协调元分析技巧得到弯距和转角的误差估计式．本文将［２］的结果一般化,同时通过修…     

Taylor公式逼近精度的研究

Taylor公式在数值计算中占有很重要的地位;它的余项反映了多项式Qn(x)逼近函数f(x)的程度.在数值计算中,逼近精度的提高,往往要提高其误差的阶,因此本文对Taylor公式的阶进行了提高,并给出了其误差的表达式.     

一种自适应的四阶Newton-Cotes求积方法

本文给出了一种基于四阶Newton-Cotes公式的自适应求积算法，该算法能根据给定的容许误差，由计算机自动选取积分步长，克服了由于被积函数的性态不好而导致积分较复杂的缺陷．     

A posteriori error estimator for expanded mixed hybrid methods

In this article, we construct an a posteriori error estimator for expanded mixed hybrid finite‐element methods for second‐order elliptic problems. An a posteriori error analysis yields reliable and efficient estimate based on residuals. Several numerical examples are presented to show the effectivity of our error indicators. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 23: 330–349, 2007     

A POSTERIORI ERROR ESTIMATES FOR A MODIFIED WEAK GALERKIN FINITE ELEMENT APPROXIMATION OF SECOND ORDER ELLIPTIC PROBLEMS WITH DG NORM

In this paper,we derive a residual based a posteriori error estimator for a modified weak Galerkin formulation of second order elliptic problems.We prove that the error estimator used for interior penalty discontinuous Galerkin methods still gives both upper and lower bounds for the modified weak Galerkin method,though they have essentially different bilinear forms.More precisely,we prove its reliability and efficiency for the actual error measured in the standard DG norm.We further provide an improved a priori error estimate under minimal regularity assumptions on the exact solution.Numerical results are presented to verify the theoretical analysis.     

Nordsieck representation of DIMSIMs

A new representation for diagonally implicit multistage integration methods (DIMSIMs) is derived in which the vector of external stages directly approximates the Nordsieck vector. The methods in this formulation are zero-stable for any choice of variable mesh. They are also easy to implement since changing step-size corresponds to a simple rescaling of the vector of external approximations. The paper contains an analysis of local truncation error and of error accumulation in a variable step-size situation. This revised version was published online in June 2006 with corrections to the Cover Date.     

Error estimates for irregular sampling of band-limited functions on a locally compact Abelian group

Band-limited functions f can be recovered from their sampling values (f(x_i)) by means of iterative methods, if only the sampling density is high enough. We present an error analysis for these methods, treating the typical forms of errors, i.e., jitter error, truncation error, aliasing error, quantization error, and their combinations. The derived apply uniformly to whole families of spaces, e.g., to weighted L^p-spaces over some locally compact Abelian group with growth rate up to some given order. In contrast to earlier papers we do not make use of any (relative) separation condition on the sampling sets. Furthermore we discard the assumption on polynomial growth of the weights that has been used over Euclidean spaces. Consequently, even for the case of regular sampling, i.e., sampling along lattices in G, the results are new in the given generality.     

Some error expansions for Gaussian quadrature

Complex-variable methods are used to obtain some expansions in the error in Gaussian quadrature formulae over the interval [– 1, 1]. Much of the work is based on an approach due to Stenger, and both circular and elliptical contours are used. Stenger's theorem on monotonicity of convergence of Gaussian quadrature formulae is generalized, and a number of error bounds are obtained.     

One-leg variable-coefficient formulas for ordinary differential equations and local–global step size control

In this paper we discuss a class of numerical algorithms termed one-leg methods. This concept was introduced by Dahlquist in 1975 with the purpose of studying nonlinear stability properties of multistep methods for ordinary differential equations. Later, it was found out that these methods are themselves suitable for numerical integration because of good stability. Here, we investigate one-leg formulas on nonuniform grids. We prove that there exist zero-stable one-leg variable-coefficient methods at least up to order 11 and give examples of two-step methods of orders 2 and 3. In this paper we also develop local and global error estimation techniques for one-leg methods and implement them with the local–global step size selection suggested by Kulikov and Shindin in 1999. The goal of this error control is to obtain automatically numerical solutions for any reasonable accuracy set by the user. We show that the error control is more complicated in one-leg methods, especially when applied to stiff problems. Thus, we adapt our local–global step size selection strategy to one-leg methods.     

Robust optimization using computer experiments

During metamodel-based optimization three types of implicit errors are typically made. The first error is the simulation-model error, which is defined by the difference between reality and the computer model. The second error is the metamodel error, which is defined by the difference between the computer model and the metamodel. The third is the implementation error. This paper presents new ideas on how to cope with these errors during optimization, in such a way that the final solution is robust with respect to these errors. We apply the robust counterpart theory of Ben-Tal and Nemirovsky to the most frequently used metamodels: linear regression and Kriging models. The methods proposed are applied to the design of two parts of the TV tube. The simulation-model errors receive little attention in the literature, while in practice these errors may have a significant impact due to propagation of such errors.     

ORDER RESULTS OF GENERAL LINEAR METHODS FOR MULTIPLY STIFF SINGULAR PERTURBATION PROBLEMS

In this paper we analyze the error behavior of general linear methods applied to some classes of one-parameter multiply stiff singularly perturbed problems. We obtain the global error estimate of algebraically and diagonally stable general linear methods. The main result of this paper can be viewed as an extension of that obtained by Xiao [13] for the case of Runge-Kutta methods.     

Discontinuous Galerkin finite element method for a nonlinear boundary value problem

In this paper, we investigate the a priori and a posteriori error estimates for the discontinuous Galerkin finite element approximation to a regularization version of the variational inequality of the second kind. We show the optimal error estimates in the DG-norm （stronger than the H1 norm） and the L2 norm, respectively. Furthermore, some residual-based a posteriori error estimators are established which provide global upper bounds and local lower bounds on the discretization error. These a posteriori analysis results can be applied to develop the adaptive DG methods.     

A new a priori error estimate of nonconforming finite element methods

This paper is devoted to a new error analysis of nonconforming finite element methods.Compared with the classic error analysis in literature,only weak continuity,the F-E-M-Test for nonconforming finite element spaces,and basic Hm regularity for exact solutions of 2m-th order elliptic problems under consideration are assumed.The analysis is motivated by ideas from a posteriori error estimates and projection average operators.One main ingredient is a novel decomposition for some key average terms on(n.1)-dimensional faces by introducing a piecewise constant projection,which defines the generalization to more general nonconforming finite elements of the results in literature.The analysis and results herein are conjectured to apply for all nonconforming finite elements in literature.