Optimal Eighth Order Iterative Methods

We develop an eighth order family of methods, consisting of three steps and three parameters, for solving nonlinear equations. Per iteration the methods require four evaluations (three function evaluations and one evaluation of the first derivative). Convergence analysis shows that the family is eighth-order convergent which is also substantiated through the numerical work. Computational results ascertain that family of methods are efficient and demonstrate equal or better performance as compared with other well known methods.     

几类非线性二元算子方程的迭代解法及其应用

利用锥与半序理论和单调迭代技巧，讨论几类非线性二元算子方程解的存在唯一性，并给出迭代序列收敛速度的估计，改进和推广了某些已有结果．最后给出所得结果的应用。     

两类半隐式随机Runge-Kutta方法

本文针对一般的Ito随机微分方程,应用彩色树理论构造了两类稳定性较好的强1阶半隐式Runge-Kutta(RK)方法,数值实验证明了所得方法的精度和有效性.     

Iterative Methods for General Mixed Quasivariational Inequalities

It is well known that mixed quasivariational inequalities are equivalent to implicit fixed-point problems. We use this alternative equivalent formulation to suggest and analyze a new self-adaptive resolvent method for solving mixed quasivariational inequalities in conjunction with a technique updating the solution. We show that the convergence of this method requires pseudomonotonicity, which is a weaker condition than monotonicity. Since mixed quasivariational inequalities include various classes of variational inequalities as special cases, our results continue to hold for these problems.     

Quadrature Based Optimal Iterative Methods with Applications in High-Precision Computing

We present a simple yet effective and applicable scheme, based on quadrature, for constructing optimal iterative methods. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on $n+1$ evaluations could achieve a maximum convergence order of $2^n$. Through quadrature, we develop optimal iterative methods of orders four and eight. The scheme can further be applied to develop iterative methods of even higher orders. Computational results demonstrate that the developed methods are efficient as compared with many well known methods.     

求解单调变分不等式的两类迭代算法

给出了求解单调变分不等式的两类迭代算法．通过解强单调变分不等式子问题,产生两个迭代点列,都弱收敛到变分不等式的解．最后,给出了这两类新算法的收敛性分析．     

General Methods for Monitoring Convergence of Iterative Simulations

Abstract

We generalize the method proposed by Gelman and Rubin (1992a) for monitoring the convergence of iterative simulations by comparing between and within variances of multiple chains, in order to obtain a family of tests for convergence. We review methods of inference from simulations in order to develop convergence-monitoring summaries that are relevant for the purposes for which the simulations are used. We recommend applying a battery of tests for mixing based on the comparison of inferences from individual sequences and from the mixture of sequences. Finally, we discuss multivariate analogues, for assessing convergence of several parameters simultaneously.     

两类新的最优变重量光正交码

变重量光正交码用于光码分多址通信系统以满足不同服务质量用户需求.给出当u≥5为素数时,最优(16u,{3,5},1,{2/3,1/3))交重量光正交码的具体构造.同时证明了当u≥5为素数时,存在一个最优(25u,{3,4,5},1,{1/4,2/4,1/4})变重量光正交码.这将改进变重量光正交码的存在性结果.     

Newton Methods for Solving Two Classes of Nonsmooth Equations

The paper is devoted to two systems of nonsmooth equations. One is the system of equations of max-type functions and the other is the system of equations of smooth compositions of max-type functions. The Newton and approximate Newton methods for these two systems are proposed. The Q-superlinear convergence of the Newton methods and the Q-linear convergence of the approximate Newton methods are established. The present methods can be more easily implemented than the previous ones, since they do not require an element of Clarke generalized Jacobian, of B-differential, or of b-differential, at each iteration point.     

Some New Iterative Methods for General Mixed Variational Inequalities

In this paper, we use the auxiliary principle technique to suggest a class of predictorcorrector methods for solving general mixed variational inequalities. The convergence of the proposed methods only requires the partially relaxed strongly monotonicity of the operator, which is weaker than co-coercivity. From special cases, we obtain various known and new results for solving various classes of variational inequalities and related problems.AMS Subject Classification (1991): 49J40, 90C33.     

Banach空间中二元算子方程组解的存在唯一性及其迭代解法

利用锥理论与半序方法对Banach空间中几类二元算子方程组解的存在唯一性进行探讨,给出它们的迭代求解法,得到了一些新结果.     

Optimal Control of Iterative Solution Methods for Linear Systems of Equations

Iterative solution methods for linear systems of equations can be regarded as discrete-time control systems, for which a stabilizing feedback control has to be found. Well known algorithms such as GMRES(m) may exhibit unstable dynamics or sensitive dependence on initial conditions, thus preventing the algorithm to converge to the desired solution. Based on linear system feedback design techniques a new algorithm is proposed that does not suffer under such shortcomings. Global convergence to the desired solution is shown for any initial state. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

二元算子方程组的迭代求解方法

利用锥理论和单调迭代方法,本文在Banach空间中对三类二元算子方程组的求解进行了探讨,利用较简捷的条件得出方程组的唯一解和迭代逼近式及误差估计式并推广到了n元算子方程组的情形,得到相应结果．     

两类下降的非线性共轭梯度法的全局收敛性

本文在文献[1]中提出了一类新共轭梯度法的基础上,给出求解无约束优化问题的两类新的非线性下降共轭梯度法,此两类方法在无任何线搜索下,能够保证在每次迭代中产生下降方向.对一般非凸函数,我们在Wolfe线搜索条件下证明了两类新方法的全局收敛性.     

Gregarious GDDs with Two Associate Classes

The existence of group divisible designs with two associate classes has been studied for over 50 years. Probably the most difficult cases to solve are those in which the number of groups is less than the size of the blocks. Recently, such an existence problem was solved in the case where the groups have the same size and the blocks have size 3. In this paper, we continue to focus on blocks of size 3, solving the existence problem when the required designs are gregarious (each block intersects each group). These designs are tight to construct in the sense that they satisfy equality in one of the bounds required for GDDs to exist.     

General Iterative Methods for Semigroups of Nonexpansive Mappings Related to Optimization Problems

Abstract

In this article, we introduce two general iterative methods for a certain optimization problem of which the constrained set is the set of the solution set of the variational inequality problem for the fixed point set of nonexpansive semigroups in Hilbert spaces. Under some control conditions, we establish the strong convergence of the proposed methods to the fixed point set, which is the unique solution of a certain optimization problem. Applications to solutions of equilibrium problems are also presented.     

求解刚性振荡问题的两类带显式级的三级对角隐式Runge-Kutta方法

针对刚性振荡问题,讨论了两类带显式级的三级对角隐式Runge-Kutta方法的阶、级阶、A-稳定性、相误差和耗散误差,所构造的方法成功应用于一类大气化学反应问题的求解.     

求m阶递推数列通项公式的两种方法

利用分析中的解析函数方法和代数中的矩阵方法,得到了m阶常系数齐次线性递推数列通项公式的解析表达式,是对已有结果的完善和推广.     

Alignment空间中比对序列数目研究

利用组合数学中穷举方法与生成函数方法,得到了Alignment空间中两序列的比对序列数目的一系列表达式,并且对比对序列数目的上下界进行了估计.     

Families of Optimal Derivative-Free Two- and Three-Point Iterative Methods for Solving Nonlinear Equations

Computational Mathematics and Mathematical Physics - Necessary and sufficient conditions for derivative-free two- and three-point iterative methods to have the optimal convergence order are...