松弛型并行多分裂方法解非线性方程组的安全界

本文对某些非线性方程组F(x)=0,导出了一个算法,用它可以迭代建立F(x)=0的解的紧致上、下界。算法基于某些矩阵的多分裂,因此具有自然的并行性。我们证明了趋向于解的界之收敛原则,给出了参数的收敛性区域并考察了方法的收敛速度。     

BroWn-Broyden修正算法

1　引　　言求解非线性方程组F(x) =f1 (x1 ,… ,xn)廸n(x1 ,… ,xn)=0　　 F:D Rn→ Rn,(1.1)的 Brown方法 ,是将广义的 L U分解用于 Newton迭代过程 ,而形成的一类具有内外迭代形式的有效算法 .这类算法的特点是每步迭代的函数计算量仅仅为 Newton法的一半 ,而收敛速度则与 Newton法相同 .因此 ,按 Ostrowskii定义的效率指数去衡量 ,Brown方法为一效率较高的算法之一 ,是倍受推崇的 .本文 ,采用修正算法的思想 ,对 Brown方法作进一步改造 ,在不破坏原来的内外迭代形式下 ,使算法在每步迭代中的函数计值量由原来的 O(n2 )下降到 O(…     

适用于任意初始值条件的两侧逼近区间迭代法

本文提出了一个解非线性方程组f(x)=x的两侧逼近区间迭代法,该算法在任意的初值条件下都可使用,并在f(x)较弱的条件下,线性收敛到f(x)=x的解.     

解非线性方程的一个非线性迭代法

1 引 言 用常微分方程及其数值解的理论和方法(简称ODE方法)来构造解非线性方程组的方法见Branin.F.H.等,但未能讨论收敛性。其后对线性方程组A_x=b和非线性方程f(x)=0都有专门的论述且论证了方法的大范围收敛性,对于求非线性方程f(x)=0在[a,b]内的根x~·的不使用导数的大范围收敛的算法使我们容易想到两分法和试位法,是否有其它更为有效的不使用导数的大范围收敛的方法,下面我们来讨论基于ODE方法原理的非线性迭代方法。     

再论Broyden方法的收敛性

本文用 Smale 提出的点估计理论,建立了在点估计条件下的求解非线性方程组 F(x)=0的著名的 Broyden 方法的收敛性及解的存在唯一性定理.从而在 R~n 空间的解析映射类上,解除了由于 F′的区域性 Lipschitz 条件带来的 Broyden 方法收敛判据之间的相互制约性.它为一大类修正算法点估计理论的建立,提供了新的途径.     

再论Broyden方法的收敛性

本文用Smale提出的点估计理论,建立了在点估计条件下的求解非线性方程组F(x)=0的著名的Broyden方法的收敛性及解的存在唯一性定理,从而在R~n空间的解析映射类上,解除了由于F′的区域性Lipschitz条件带来的Broyden方法收敛判据之间的相互制约性。它为一大类修正算法点估计理论的建立,提供了新的途径。     

一类弱非线性方程组的Picard-MHSS迭代方法

修正的Hermite/反Hermite分裂(MHSS)迭代方法是一类求解大型稀疏复对称线性代数方程组的无条件收敛的迭代算法.基于非线性代数方程组的特殊结构和性质,我们选取Picard迭代为外迭代方法,MHSS迭代作为内迭代方法,构造了求解大型稀疏弱非线性代数方程组的Picard-MHSS和非线性MHSS-like方法.这两类方法的优点是不需要在每次迭代时均精确计算和存储Jacobi矩阵,仅需要在迭代过程中求解两个常系数实对称正定子线性方程组.除此之外,在一定条件下,给出了两类方法的局部收敛性定理.数值结果证明了这两类方法是可行、有效和稳健的.     

一类抛物型方程系数反问题的分裂算法

考虑利用终端时刻的温度u(x,T)=Z_T(x)反演热传导方程u_t-a~2u_(xx) q(x)u=0,x∈(0,1)中的未知系数q(x)的反问题.通过引进变换v(x,t)=(u_t(x,t)/u(x,t))将此非线性不适定问题的求解分解为两步.首先利用输入数据迭代求解一个非线性的正问题(该过程独立于未知系数),得到其迭代解v~(k)(x,t).其次利用q(x)与v(x,t)的关系式求出q(x)的近似解.对提出的反演方法,证明了采用的变换的可行性,得到了原反问题与由变换后的非线性正问题反演q(x)的等价性并且证明了迭代解的收敛性,给出了收敛速度.数值结果表明了该方法的有效性.     

Banach空间非线性混合型微分-积分方程整体解的存在性和唯一解

研究了Banach空间中非线性混合型微分-积分方程初值问题u′=f(t,u,Tu,Su),u(0)=x0的整体解,完全没有要求f的任何增性,利用Mnch不动点定理和比较结果得到了初值问题整体解的存在性和唯一解,并且给出了一致收敛于唯一解的迭代序列,改进推广和统一了已有的许多结果.     

非线性时滞反应扩散有限差分方程组的高阶单调迭代方法

对一类非线性时滞反应扩散方程的有限差分方程组建立了一类高阶单调迭代方法.这类方法给出了一个有效的线性迭代算法.迭代序列单调收敛于方程组的唯一解,并且序列的单调性使得每一步迭代都给出了解的改进的上下界.迭代收敛率具有p+2阶,这里p≥1是一个正整数,它依赖于迭代方法的构造.数值结果显示了方法的有效性.     

一种基于Chebyshev迭代解非线性方程组的方法

本文根据牛顿迭代和Chebyshev迭代法给出了一种新的迭代方法,该方法有较高的收敛阶,并在理论上给予了证明.最后给出了四个实例,将本文的实验结果与现有的几种方法的实验结果进行比较,表明我们的方法迭代次数少,有明显的优势.     

Third-order iterative methods free from second derivatives for nonlinear equation

In this paper, we suggest and analyze a new two-step iterative method for solving nonlinear equations, which is called the modified Householder method without second derivatives for nonlinear equation. We also prove that the modified method has cubic convergence. Several examples are given to illustrate the efficiency and the performance of the new method. New method can be considered as an alternative to the present cubic convergent methods for solving nonlinear equations.     

三步五阶迭代方法解非线性方程组

本文根据求积公式, 给出了三种求解非线性方程组的迭代方法, 并证明了所提出的三步迭代方法具有五阶收敛性. 最后给出了四个数值实例, 将本文的实验结果与现有的几种迭代方法的实验结果作了比较分析, 表明本文所提出的方法具有明显的优越性.     

一类非线性方程组的Newton-PSS迭代法

正定反Hermite分裂(PSS)方法是求解大型稀疏非Hermite正定线性代数方程组的一类无条件收敛的迭代算法.将其作为不精确Newton方法的内迭代求解器,我们构造了一类用于求解大型稀疏且具有非Hermite正定Jacobi矩阵的非线性方程组的不精确Newton-PSS方法,并对方法的局部收敛性和半局部收敛性进行了详细的分析.数值结果验证了该方法的可行性与有效性.     

Certain improvements of Newton’s method with fourth-order convergence

In this paper we present two new schemes, one is third-order and the other is fourth-order. These are improvements of second-order methods for solving nonlinear equations and are based on the method of undetermined coefficients. We show that the fourth-order method is more efficient than the fifth-order method due to Kou et al. [J. Kou, Y. Li, X. Wang, Some modifications of Newton’s method with fifth-order covergence, J. Comput. Appl. Math., 209 (2007) 146–152]. Numerical examples are given to support that the methods thus obtained can compete with other iterative methods.     

求解非线性方程根四阶收敛的迭代格式

提出了求解非线性方程根新的四阶收敛迭代方法,新方法每次迭代只需要两次函数计算,一次一阶导数值计算,效能指数达到1.587.通过几个数值算例来解释该方法的有效性.     

Numerical comparison of three stochastic methods for nonlinear PN junction problems

We apply the Monte Carlo, stochastic Galerkin, and stochastic collocation methods to solving the drift-diffusion equations coupled with the Poisson equation arising in semiconductor devices with random rough surfaces. Instead of dividing the rough surface into slices, we use stochastic mapping to transform the original deterministic equations in a random domain into stochastic equations in the corresponding deterministic domain. A finite element discretization with the help of AFEPack is applied to the physical space, and the equations obtained are solved by the approximate Newton iterative method. Comparison of the three stochastic methods through numerical experiment on different PN junctions are given. The numerical results show that, for such a complicated nonlinear problem, the stochastic Galerkin method has no obvious advantages on efficiency except accuracy over the other two methods, and the stochastic collocation method combines the accuracy of the stochastic Galerkin method and the easy implementation of the Monte Carlo method.     

Uniform convergent monotone iterates for semilinear singularly perturbed parabolic problems

This paper deals with discrete monotone iterative methods for solving semilinear singularly perturbed parabolic problems. Monotone sequences, based on the accelerated monotone iterative method, are constructed for a nonlinear difference scheme which approximates the semilinear parabolic problem. This monotone convergence leads to the existence-uniqueness theorem. An analysis of uniform convergence of the monotone iterative method to the solutions of the nonlinear difference scheme and continuous problem is given. Numerical experiments are presented.     

Monotone iterates with quadratic convergence rate for solving weighted average approximations to semilinear parabolic problems

This paper deals with discrete monotone iterative methods for solving semilinear singularly perturbed parabolic problems. Monotone sequences, based on the accelerated monotone iterative method, are constructed for a nonlinear difference scheme which approximates the semilinear parabolic problem. This monotone convergence leads to the existence-uniqueness theorem. An analysis of convergence of the monotone iterative method to the solutions of the nonlinear difference scheme is given. Numerical experiments are presented.     

Variational iteration technique for solving nonlinear equations

In this paper, we use the variational iteration technique to suggest some new iterative methods for solving nonlinear equations f(x)=0. We also discuss the convergence criteria of these new iterative methods. Comparison with other similar methods is also given. These new methods can be considered as an alternative to the Newton method. We also give several examples to illustrate the efficiency of these methods. This technique can be used to suggest a wide class of new iterative methods for solving system of nonlinear equations.