一类求解鞍点问题的广义不精确Uzawa方法

本文提出了一类求解大型稀疏鞍点问题的新的广义不精确Uzawa算法.该方法不仅可以包含 前人的方法, 而且可以拓展出很多新方法. 理论分析给出该方法收敛的条件, 并详细的分析了其收敛性质和参数矩阵的选取方法. 通过对有限元离散的Stokes问题的数值实验表明, 新方法是行之有效的, 其收敛速度明显优于原来的算法.     

一族多步二阶导数方法的收缩性

１．引言 １９７８年 Ｎｅｖａｎｌｉｎｎａ和 Ｌｉｎｉｇｅｒ［１,２］研究了常微分方程初值问题的单支方法和线性多步法的收缩性,就基于线性模型方程的收缩性建立了比较完整的理论．他们指出,收缩方法比绝对稳定方法能更好地给出间断问题的数值解,因而研究数值方法的收缩性具有重要理论和实践意义． １９７４年 Ｅｎｒｉｇｈｔ［３］构造了 ｋ步 ｋ ＋ ２阶二阶导数方法由于它是Ａｄｍａｓ型的且只含一个二阶导数项,因而方法在原点附近具有较理想的稳定性和稳定程度（参见［７］）,同时在 ∞处是极端稳定的．赵双锁和董国雄 ［４］…     

THE STABILITY OF A CLASS OF FUNCTIONAL DIFFERENTIAL EQUATIONS WITH INFINITE DELAYS

1 IntroductionConsider the following functional differential equationX'(t) = A(t)x(t) [' C(t,s)x(s)ds, (1)icwhere x E m; A(t) = (ail(t))... is a n x n function matrix, which continuesin [0, co); C(t,s) = (qj(t,8))... is a n x n function matrix, which conti-nues when 0 5 s 5 t < co, and L oo IIC(u,t)lldu continues in [0, co).The problem on the stability for the zero solution of (1) has been studied bymany papers. But in the known results, the boundedness of j: IIC(t, s)lldsor L " IIC…     

THE BOUNDARY VALUE PROBLEMS OF A CLASS OF ELLIPTIC EQUATION WITH A CURVE OF TURNING POINT

The boundary value problems of a class of elliptic equation with a curveof turning point are considered. Using the method of multiple scales and thecomparison theorem, the asymptotic behavior of solution for the boundary valueproblem is studied.     

一类二阶非线性阻尼微分方程的振动性

研究了一类二阶非线性阻尼微分方程解的振动性,建立了三个新的振动性定理,推广了Cecchi M和Marini M(Rocky Mount J Math,1992,22:1259-1276)的结果.     

一类带参数的修正Fletcher-Reeves共轭梯度法

提出了求解无约束优化问题的一类带参数的Fletcher-Reeves共轭梯度法（FR方法）。结合Armiio非精确线性搜索技术,证明了所提出的方法在较弱的条件下是全局收敛的。数值实验表明所提出的方法是有效的。     

A HOMOTOPY METHOD OF SWITCHING SOLUTION BRANCHES AT THE PITCHFORK BIFURCATION POINT

1. IntroductionIn order to compute all solutions of a nonlinear system of equations, a numerical methodis needed for changing solution branches at biftircation points. Suppose that a bifurcationpoint (x*,A*) base been located. H.B.Keller [4] proposed a method of switching solutionbranches at (x*, A*) by means of distinct roots of a homogeneously quadratic system of equations, W.C.Rheinboldt [5] gave a method for switching solution branches at a simple bifUIcationpoint, using a singular cho…     

一类具有高阶奇点的竞争扩散系统的波前解

In this paper,the existence of travelling front solution for a class of competition-diffusion system with high-order singular pointwit=diwixx-wαiifi(w),x∈R,t>0,I=1,2 (Ⅰ)is studied,where di,αi>0 (I=1,2) and w=(w1(x,t),w2(x,t)).Under the certain assumptions on f,it is showed that if αi<1 for some I,then (Ⅰ) has no travelling front solution,if αi≥1 for I=1,2,then there is a c0,c*:c0≥c*>0,where c* is called the minimal wave speed of (Ⅰ),such that if c≥c0 or c=c*,then (Ⅰ) has a travelling front solution,if相似文献   

INFINITE ELEMENT METHOD FOR THE EXTERIOR PROBLEMS OF THE HELMHOLTZ EQUATIONS

1. IntroductionThe infinite element method has been successfully applied to some boundary valueproblems of partial differential equations, where the solutions possess corner singularpoints or the domains are exterior ones. If the equations are invariant under similaritytransformation the approaches have been given in [11] [131 for singular solutions, and in[12][15][181119] for the exterior problems. If the equations do not admit the above invariant property? one approach has been given in [14]…     

具C^∞系数的非主型方程的Goursat问题

本文以逼近和正则化方法，对一类具Ｃ＾∞系数和数据的非主型方程的Ｇｏｕｒｓａｔ问题证明了Ｃ＾∞解的存在唯一性。     

有向网络中具有一个枢纽点的最小支撑树的计算方法

对有向网络中具有一个枢纽点的支撑树的问题和性质进行了研究,给出了在有向网络图中寻找以某一定点为枢纽点的最小支撑树的计算方法,并对算法的复杂性进行了讨论,最后将该算法应用于实际算例的计算．     

一维热传导系数定层逐点方法

针对一类一维热传导反演问题，导出了一种稳定的定层逐点反演方法，推证了该方法的热传导系数离散解具有整体二阶精度。     

基于中心路径大邻域上的一类非单调线性互补问题的高阶可行内点算法

In this paper a high-order feasible interior point algorithm for a class of nonmonotonic (P-matrix) linear complementary problem based on large neighborhoods of central path is presented and its iteration complexity is discussed.These algorithms are implicitly associated with a large neighborhood whose size may depend on the dimension of the problems. The complexity of these algorithms bound depends on the size of the neighborhood. It is well known that the complexity of large-step algorithms is greater than that of short- step ones. By using high-order power series (hence the name high-order algorithms), the iteration complexity can be reduced. We show that the upper bound of complexity for our high-order algorithms is equal to that for short-step algorithms.     

求解加权线性最小二乘问题的一类预处理GAOR方法

为了快速求解一类来自加权线性最小二乘问题的2×2块线性系统,本文提出一类新的预处理子用以加速GAOR方法,也就是新的预处理GAOR方法.得到了一些比较结果,这些结果表明当GAOR方法收敛时,新方法比原GAOR方法和之前的一些预处理GAOR方法有更好的收敛性.而且,数值算例也验证了新预处理子的有效性．     

THE GENERALIZED LOCAL HERMITIAN AND SKEW-HERMITIAN SPLITTING ITERATION METHODS FOR THE NON-HERMITIAN GENERALIZED SADDLE POINT PROBLEMS

For large and sparse saddle point problems, Zhu studied a class of generalized local Hermitian and skew-Hermitian splitting iteration methods for non-Hermitian saddle point problem [M.-Z. Zhu, Appl. Math. Comput. 218 （2012） 8816-8824 ]. In this paper, we further investigate the generalized local Hermitian and skew-Hermitian splitting （GLHSS） iteration methods for solving non-Hermitian generalized saddle point problems. With different choices of the parameter matrices, we derive conditions for guaranteeing the con- vergence of these iterative methods. Numerical experiments are presented to illustrate the effectiveness of our GLHSS iteration methods as well as the preconditioners.     

解y"=g(x,y)初值问题含参数线性多步方法的相容阶和收敛阶

1 引 言对于直接积分二阶常微分方程的初值问题 y"=g(x,y) y (x_0)=y_0,y'(x_0)=y"_0,x_0 x T,(1)     

一类无限路幂圈嵌套图边–平衡指数的研究

本文研究了无限路幂圈嵌套图C3m×Pm3(m≥3)的边-平衡指数集.利用套圈计算的方法给出无限路幂圈嵌套图C3m×Pm3(m≥3)最大的边-平衡指数的计算公式和其他指数对应图形的构造性证明,最后完全解决此类图的边-平衡指数集问题.     

解初值问题y″=g(x，y)的含参数块方法

1引言对于二阶常微分方程的初值问题y″=g(x,y),y(x_0)=y_0,y′(x_0)=y_0′,x_0(?)x(?)T(1)的数值解法的研究引起人们的广泛兴趣．对于直接积分(1),自从1976年J．D．Lambert和I．A．Waston提出二阶P-稳定方法和1978年G．Dahlquist证明P-稳定常系数线性多步方法的最高相容阶不超过2的重要结论以来,截止目前,已积累了许多高于2阶的P-稳定方法．例如,修正的Numerov方法,混合法(特殊形式RK的方法),多导法,Obrechkoff方法,显式RKN方法,单隐方法和对角隐式RKN方法等(顺便指出,文献[5,16]中所说的高阶方法的相容阶均不超过4)．所有这些方法,有些相     

关于单调变分不等式的不精确邻近点算法的收敛性分析

We consider a proximal point algorithm(PPA) for solving monotone variational inequalities. PPA generates a sequence by solving a sequence of strongly monotone subproblems .However,solving the subproblems is either expensive or impossible. Some inexact proximal point algorithms(IPPA) have been developed in many literatures. In this paper, we present a criterion for approximately solving subproblems. It only needs one simple additional work on the basis of original algorithm, and the convergence criterion becomes milder. We show that this method converges globally under new criterion provided that the solution set of the problem is nonempty.     

A CLASS OF REDUCED GRADIENT METHODS FOR HANDLING OPTIMIZATION PROBLEMS WITH LINEAR INEQUALITY CONSTRAINTS

A class of reduced gradient methods for handling general optimization problems with linear equality and inequality constraints is suggested in this paper. Although a slack vector is introduced, the dimension of the problem is not increased, which is unlike the conventional way of transferring the inequality constraints into the equality constraints by introducing slack variables. When an iterate x(k) is not a K-T point of the problem under consideration, different feasible descent directions can be obtained by different choices of the slack vectors. The suggested method is globally convergent and the numerical experiment given in the paper shows that the method is efficient.