一类非线性对流扩散方程两重网格特征有限元方法及误差估计

主要研究了一类非线性对流扩散方程的全离散特征有限元方法的两重网格算法及其误差估计.首先在网格步长为H的粗网格上计算一个较小的非线性问题,然后利用一阶牛顿迭代和粗网格解将网格步长为h的细网格上的非线性问题转化为线性问题求解.由于非线性问题的求解仅在粗网格上进行,该两重网格算法可以节省大量的计算工作量,同时具有较高的精度,证明了该两重网格算法L~2模先验误差估计结果为O(△t+h~2+H~(4-d/2)),其中d为空间维数.     

一维非线性抛物问题两层网格有限体积元逼近

该文主要研究一维非线性抛物问题两层网格有限体积元逼近.对一维非线性抛物问题有限体积元解的存在性进行了讨论,给出了最优阶L~2-模和H~1-模误差估计结果,并研究了其两层网格算法.证明了当粗细网格步长满足h=O(H~2)时两层网格算法具有最优阶H~1-模误差估计.数值算例验证了理论结果.     

拟线性双相滞热传导方程的一个H~1-Galerkin混合有限元方法分析

利用不完全双二次元Q_2~-和一阶BDFM元,对拟线性双相滞热传导方程构造了一个新的H~1-Galerkin混合元格式.在不借助投影算子的条件下,直接利用单元插值算子的特殊性质,对于半离散和全离散格式,分别给出了原始变量在H~1-模及流量在H(div)-模下的具有O(h~3)及O(h~3+(△t)~2)阶的超逼近估计.     

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,τ分别表示空间剖分参数和时间步长.最后,给出了一个数值算例,计算结果验证了理论分析的正确性,该文的分析为利用非协调混合有限元研究其它四阶初边值问题提供了一个可借鉴的途径.     

一类非线性四阶双曲方程扩展的混合元方法的超收敛分析

对一类非线性四阶双曲方程利用双线性元Q_(1)及Nedelec's元建立一个扩展的协调混合元逼近格式.首先证明了逼近解的存在唯一性.其次,基于上述两个单元的高精度结果,给出了插值和投影之间的误差估计,再利用对时间t的导数转移技巧和插值后处理技术,在半离散和全离散格式下分别导出了原始变量u和中间变量v=-△u在H~1模及中间变量q=▽u,σ=-▽(△u)在(L~2)~2模意义下单独利用插值和投影所无法得到的具有O(h~2)和O(h~2+τ~2)阶的超收敛结果.最后通过数值算例,表明逼近格式是行之有效的.这里,h和τ分别表示空间剖分参数及时间步长.     

抛物型积分微分方程新混合元格式的超逼近分析

基于双二次元及其梯度空间,建立了抛物型积分微分方程的一种新混合有限元逼近格式.在不需要Ritz-Volterra投影的前提下,直接利用双二次元插值的高精度结果及关于时间变量的导数转移技巧,在半离散格式下,得到了原始变量u和中间变量p=▽u+integral from n=0 to t▽u(s)ds分别关于H~1模和L~2模的O(h~4)阶超逼近结果,相比插值误差估计,提高了二阶精度.与此同时,对向后Euler格式,导出了u和p分别在H~1模与L~2模意义下的O(h~4+τ)阶超逼近;对Crank-Nicolson-Galerkin格式,在L~2模意义下证明了u和p分别具有O(h~4+τ~2)和O(h~3+τ~2)阶的超逼近性质.其中,h,τ分别表示空间剖分参数和时间步长,t代表时间变量.     

拟线性双曲方程类Wilson非协调元的高精度分析

主要研究类Wilson元对拟线性双曲方程的逼近.首先证明了当问题的解u∈H~3(Ω)或u∈H~4(Ω)时,u与其双线性插值之差的梯度与类Wilson元空间任意元素的梯度,在分片意义下的内积可以达到O(h~2)这一重要结论.其次运用能量模意义下该元的非协调误差可以分别达到O(h~2)/O(h~3),即比插值误差高一阶/二阶这一性质,并利用对时间t的导数转移技巧,结合双线性元的高精度结果及插值后处理技术,获得了O(h~2)阶的超逼近性和整体超收敛性,从而进一步拓广了该元的应用范围.     

黏弹性方程的Wilson元收敛性分析

对一类黏弹性方程利用Wilson元提出新的半离散和全离散逼近格式.基于单元的性质,通过定义新的双线性型,在不需要外推和插值后处理技术的前提下,分别得到了比传统的H~1-范数更大的模意义下相应的O(h~2)阶和O(h~2+τ~2)阶的误差分析结果,正好比通常的关于Wilson元的误差估计高出一阶.这里,h,τ表示空间剖分参数和时间步长.     

一类非线性四阶双曲方程一个低阶混合元方法的超收敛分析

对一类非线性四阶双曲方程利用双线性元Q_(11)给出一个低阶混合元逼近格式.利用双线性元的高精度结果,关于时间t的导数转移技巧,插值与投影相结合的思想及分裂技术,在半离散格和全离散式下,分别导出原始变量u和中间变量v=-?u在H~1模意义下具有O(h~2)/O(h~2+τ~2)阶的超逼近性质.与此同时,借助插值后处理技术,证明在H1模意义下具有O(h~2)/O(h~2+τ~2)阶的整体超收敛结果.这里,h和τ分别表示空间剖分参数和时间剖分参数.     

非线性湿气迁移方程H~1-Galerkin混合有限元的超逼近分析

本文利用不完全双二次元Q_2~-和一阶BDFM元,对一类非线性Sobolev-Galpern型的湿气迁移方程,建立了一个新的混合元逼近模式.利用这两个单元插值算子的特殊性质和平均值技巧,一方面,对半离散格式,证明了逼近格式解的存在唯一性.同时导出了原始变量在H~1-模和中间变量在H (div)-模意义下具有O(h~3)阶的超逼近性质.另一方面,对于线性化Crank-Nicolson(C-N)全离散格式,在没有网格比的要求下,导出了具有O(h~3+τ~2)阶的超逼近结果.这里h是空间细分参数,τ是时间步长.     

Long-step primal-dual target-following algorithms for linear programming

In this paper we propose a long-step target-following methodology for linear programming. This is a general framework, that enables us to analyze various long-step primal-dual algorithms in the literature in a short and uniform way. Among these are long-step central and weighted path-following methods and algorithms to compute a central point or a weighted center. Moreover, we use it to analyze a method with the property that starting from an initial noncentral point, generates iterates that simultaneously get closer to optimality and closer to centrality.This work is completed with the support of a research grant from SHELL.The first author is supported by the Dutch Organization for Scientific Research (NWO), grant 611-304-028.The fourth author is supported by the Swiss National Foundation for Scientific Research, grant 12-34002.92.     

Trefftz,collocation, and other boundary methods—A comparison

In this article we survey the Trefftz method (TM), the collocation method (CM), and the collocation Trefftz method (CTM). We also review the coupling techniques for the interzonal conditions, which include the indirect Trefftz method, the original Trefftz method, the penalty plus hybrid Trefftz method, and the direct Trefftz method. Other boundary methods are also briefly described. Key issues in these algorithms, including the error analysis, are addressed. New numerical results are reported. Comparisons among TMs and other numerical methods are made. It is concluded that the CTM is the simplest algorithm and provides the most accurate solution with the best numerical stability. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Volume preserving RK methods for linear systems

1. IntroductionIn recent yearss there has been a great interest in constructing numerical integrationschemes for ODEs in such a way that some qualitative geometrical properties of the solutionof the ODEs are exactly preserved. R.th[ll and Feng Kang[2'31 has proposed symplectic algorithms for Hamiltollian systems, and since then st ruct ure s- preserving me t ho ds fordynamical systems have been systematically developed[4--7]. The symplectic algorithms forHamiltonian systems, the volume-pre…     

求解离散不适定问题的正则化GMERR方法

迭代极小残差方法是求解大型线性方程组的常用方法, 通常用残差范数控制迭代过程.但对于不适定问题, 即使残差范数下降, 误差范数未必下降. 对大型离散不适定问题,组合广义最小误差(GMERR)方法和截断奇异值分解(TSVD)正则化方法, 并利用广义交叉校验准则(GCV)确定正则化参数,提出了求解大型不适定问题的正则化GMERR方法.数值结果表明, 正则化GMERR方法优于正则化GMRES方法.     

A note on the biasing of Newton's direction

This note deals with the geometric interpretation of the Levenberg-Marquardt search direction when the augmented Hessian is not positive definite.     

Diagonalized multiplier methods and quasi-Newton methods for constrained optimization

Two approaches to quasi-Newton methods for constrained optimization problems inR ⁿ are presented. These approaches are based on a class of Lagrange multiplier approximation formulas used by the author in his previous work on Newton's method for constrained problems. The first approach is set in the framework of a diagonalized multiplier method. From this point of view, a new update rule for the Lagrange multipliers which depends on the particular quasi-Newton method employed is given. This update rule, in contrast to most other update rules, does not require exact minimization of the intermediate unconstrained problem. In fact, the optimal convergence rate is attained in the extreme case when only one step of a quasi-Newton method is taken on this intermediate problem. The second approach transforms the constrained optimization problem into an unconstrained problem of the same dimension.The author would like to thank J. Moré and M. J. D. Powell for comments related to the material in Section 13. He also thanks J. Nocedal for the computer results in Tables 1–3 and M. Wright for the results in Table 4, which were obtained via one of her general programs. Discussions with M. R. Hestenes and A. Miele regarding their contributions to this area were very helpful. Many individuals, including J. E. Dennis, made useful general comments at various stages of this paper. Finally, the author is particularly thankful to R. Byrd, M. Heath, and R. McCord for reading the paper in detail and suggesting many improvements.This work was supported by the Energy Research and Development Administration, Contract No. E-(40-1)-5046, and was performed in part while the author was visiting the Department of Operations Research, Stanford University, Stanford, California.     

s个几乎相等的素数的k次方和(Ⅰ)

假定pθ‖k,当p=2,2|k时，γ=θ 2；其它情况时，γ=θ 1。而R＝П(p-1)|kp^γ。本文在GRH（广义Riemann假设下），证明了当s=2^k 1,1≤k≤11时，任何足够大的整N≡s(modR)都可以表示为s个几乎相等的素数的k次方程。     

投入产出技术在计划平衡中的理论与应用

在用投入产出技术作计划平衡时，目前一般采用最终产品法、总产品法及国民收入法等．本文从理论上研究了这些方法的可行性问题，并在此基础上提出一个较理想的综合法．最后附有实例并说明综合法的现实意义．     

A comparison of some ODE solvers which require Jacobian evaluations

A variety of third-order ODE solvers which have a minimum configuration (i.e. minimum work per step) have been numerically tested and the results compared. They include implicit and explicit processes, and share the property that a Jacobian matrix must be evaluated at least once during the integration. Some of these processes have not been previously described in the literature.     

Stabilization of algebraic multilevel iteration methods; additive methods

There exist two main versions of preconditioners of algebraic multilevel type, the additive and the multiplicative methods. They correspond to preconditioners in block diagonal and block matrix factorized form, respectively. Both can be defined and analysed as recursive two-by-two block methods. Although the analytical framework for such methods is simple, for many finite element approximations it still permits the derivation of the strongest results, such as optimal, or nearly optimal, rate of convergence and optimal, or nearly optimal order of computational complexity, when proper recursive global orderings of node points have been used or when they are applied for hierarchical basis function finite element methods for elliptic self-adjoint equations and stabilized in a certain way. This holds for general elliptic problems of second order, independent of the regularity of the problem, including independence of discontinuities of coefficients between elements and of anisotropy. Important ingredients in the methods are a proper balance of the size of the coarse mesh to the finest mesh and a proper solver on the coarse mesh. This paper presents in a survey form the basic results of such methods and considers in particular additive methods. This method has excellent parallelization properties. This revised version was published online in June 2006 with corrections to the Cover Date.