非齐次弹性力学问题双互易边界元方法研究北大核心CSCD

基于弹性力学边界元方法理论,将边界元法与双互易法结合,采用指数型基函数对非齐次项进行插值得到双互易边界积分方程.将边界积分方程离散为代数方程组,利用已知边界条件和方程特解求解方程组,得出域内位移和边界面力.指数型基函数的形状参数是由插值点最近距离的最小值决定,采用这种形状参数变化方案,分析径向基函数(RBF)插值精度以及插值稳定性.再次将指数型基函数应用到双互易边界元法中,分析双互易边界元方法下计算精度及稳定性,验证了指数型插值函数作为双互易边界元方法的径向基函数解决弹性力学域内体力项问题的有效性.     

轴对称Poisson方程的Trefftz有限元解法

将径向基函数应用到一类轴对称Poisson方程的数值求解中,提出了一种Trefftz有限元计算格式.非0右端项将问题的特解引入Trefftz单元域内场,致使单元刚度方程涉及区域积分.利用径向基函数对特解近似处理,可消除区域积分,从而保持Trefftz有限元法只含边界积分的优势.为获得特解,选取求解域内所有单元的节点和形心作为基本插值点,而在求解域之外构造一个虚拟边界,在其上布置一定数目的虚拟点作为额外插值点.数值算例验证了该方法的有效性和可行性.     

基于径向基函数插值的积分方程求解

将径向基函数(radial basis function,RBF)插值引入积分方程的求解中,具体将待求函数表示为RBF的线性组合,再通过配点法将积分方程离散为线性或非线性方程组,求得权系数后给出待求函数的近似表示.论文选用的RBF是插值性能优异的多重二次曲面(multiquadric,MQ)函数,能在较少节点下取得较高的近似精度;而且RBF定义为距离的函数,在三维或高维插值时仅需改变距离公式,因而便于推广到高维积分方程求解中.在RBF插值矩阵的构造中,元素的积分计算分别通过高斯积分或基于区域剖分的数值求积完成,实现了一维、二维下Fredholm和Volterra方程的求解.算例结果表明:论文方法具有实施方便和精度较高的优点,是一种适合积分方程求解的新方法.     

改进的无奇异局部边界积分方程方法

在局部边界积分方程方法中,当源节点位于分析域的整体边界上时,局部边界积分将出现奇异积分问题,这些奇异积分需要做特别的处理．为此,提出了对域内节点采用局部积分方程,而对边界节点直接采用移动最小二乘近似函数引入边界条件来解决奇异积分问题,这同时也解决了对积分边界进行插值引入近似误差的问题．作为应用和数值实验,对Laplace方程和Helmholtz方程问题进行了分析,取得了很好的数值结果．进而,在Helmholtz方程求解中,采用了含波解信息的修正基函数来代替单项式基函数进行近似．数值结果显示,这样处理是简单高效的,在高波数声传播问题的求解中非常具有前景．     

薄板的局部Petrov-Galerkin方法

利用薄板控制微分方程的等效积分对称弱形式和对变量(挠度)采用移动最小二乘近似函数进行插值,研究了薄板弯曲问题的无网格局部Petrov-Galerkin方法．这是一种真正的无网格方法,它不需要任何有限元或边界元网格,不管这种网格是用于能量积分还是进行插值的目的．所有的积分都在规则形状的子域及其边界上进行,并用罚因子法施加本质边界条件．数值例子表明,无网格局部Petrov-Galerkin法不但能够求解二阶微分方程的边值问题,而且求解四阶微分方程的边值问题也很有效,也具有收敛快、稳定性好、对挠度和内力都具有精度高的特点．     

二维瞬态热传导的PDDO分析北大核心CSCD

采用近场动力学微分算子(peridynamic differential operator, PDDO)理论求解了二维瞬态热传导问题.将热传导方程和边界条件由其局部微分形式重构为非局部积分形式,引入Lagrange乘数法,采用变分原理的概念,建立了二维瞬态热传导问题的非局部分析模型.通过误差与收敛性分析,与其他数值方法计算结果进行比较,验证了本模型的准确性.在此基础上,将本模型应用于计算不规则边界板和内部含微缺陷(裂纹和圆孔)板的二维瞬态热传导问题.结果表明该方法计算精度高、适用范围广、具有较好的收敛性,为计算二维瞬态热传导问题提供了新的思路.     

求解Helmholtz方程的无网格重心插值配点法

本文针对Helmholtz方程,借助Chebyshev插值节点,运用重心Lagrange插值基函数和重心有理插值基函数推导了求解该类方程的两种无网格配点法.首先,将插值基函数应用于空间变量及其偏导数,建立了基于配点法的二阶微分方程组.其次,在给定的插值节点上,利用微分矩阵对其进行了简化.最后通过三种测试节点来计算数值算...     

积分形式非局部本构关系的界带分析方法

基于Hamilton体系研究了Eringen的非局部线弹性本构关系.Eringen的非局部线弹性理论存在积分型和微分型两类本构关系.由于方程的形式简单,目前多采用微分型本构;而积分型本构方程是典型的积分-微分方程,数值求解较为困难.在分析结构力学中提出的界带分析方法,成功求解了时间滞后问题的积分-微分方程.根据分析动力学与分析结构力学的模拟关系,将界带分析方法引入到非局部理论的积分型本构方程,可以实现积分-微分方程的数值求解.通过杆件的振动分析算例验证了该套理论算法的准确性和可行性,也指出了辛体系算法在非局部力学问题中的潜力.     

三次样条插值及其在第一类积分方程求解中的应用

从三次样条插值的定义出发,通过研究第一类积分方程中未知函数的三次样条函数逼近,给出了第一类积分方程的三次样条插值离散化.利用该离散化形式,将第一类积分方程转化成线性方程组的形式.由于第一类积分方程的求解通常是不适定的,进而引起线性方程组的病态性.最后,为克服线性方程组的病态性,通过引入未知函数的多重光滑化约束,得到第一...     

非参数频响函数辨识的约束局部多项式法

对于线性系统中频响函数的估计问题,文章提出一种新的非参数辨识法-局部多项式法.与其它基于加窗策略的非参数辨识法相比较可知,在不使用周期输入激励信号下,局部多项式法在应用离散傅里叶变换时可有效地降低泄露误差的影响.将频响函数和泄露项围绕某中心频率处的窄窗展开成两个局部多项式模型,局部参数的估计可通过多个局部最小二乘问题来求解.当考虑相邻频率处多项式系数间的约束时,对局部多项式法做改进得到约束局部多项式法.改进后的约束局部多项式法通过多目标最小二乘准则来求解,并可降低频响函数估计的均方误差.最后用仿真算例验证文章辨识方法的有效性.     

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.