解超越方程的平行弦方法

众所周知,牛顿法和弦截法是解超越方程的两个最简单和常用的方法.其中弦截法无需计算导数,实用上较方便,但牛顿法有更快的敛速.另一常用的抛物线法,虽然在敛速方面比弦截法有所提高,但它的每一步迭代却较复杂,而且敛速阶数低于牛顿法.所以,就计算效能而言,这三个方法各有优缺点.     

关于非线性方程的牛顿迭代格式初始值选取的注记

基于构造非线性方程的牛顿迭代格式简便和牛顿迭代格式具有收敛快的特点,在解决实际问题时,牛顿迭代格式显得尤为重要,但是,牛顿迭代格式的初始值选取具有很大的局限性.利用泰勒级数展开,对牛顿迭代格式的收敛性进行分析,从而提出改进牛顿迭代格式的初始值选取方案,并利用不同的数值算例验证牛顿迭代格式收敛区域的改进方案的可行性,同时数值算例表明该方法具有操作简单的特点.     

基于牛顿迭代构造新的五阶预估校正格式

基于对三阶牛顿迭代法的预估校正格式的改进,提出了求解非线性方程的三种五阶牛顿迭代格式,迭代格式利用差商思想无须计算函数的导数值,并证明该格式具有五阶收敛性.通过数值算例,验证构造的三种迭代格式的有效性.     

牛顿方法的两个新格式

给出牛顿迭代方法的两个新格式,S im pson牛顿方法和几何平均牛顿方法,证明了它们至少三次收敛到单根,线性收敛到重根.文末给出数值试验,且与其它已知牛顿法做了比较.结果表明收敛性方法具有较好的优越性,它们丰富了非线性方程求根的方法,在理论上和应用上都有一定的价值.     

求函数稳定点的反插值算法及其收敛速率

§1.引言 一维搜索在非线性规划中非常重要,它常可归结为方程f′(x)=0的求解问题.本文基于牛顿反插值法对该问题提出了一个迭代求解格式,对于一般的n点迭代格式,该算法利用前n点的信息构造迭代的第n+1点.因此具有良好的局部收敛性;而且计算格式简单,易于计算机实现.数值试验表明,用三点格式已收敛得很快.     

含参无导数有记忆迭代方法与其动力系统的构造

借鉴含导数两步迭代格式转化成不含导数两步迭代格式的思想,提出了一种更通用的两步无导数迭代格式,通过权值保证了两步无导迭代格式达到最优阶;利用自加速参数和Newton(牛顿)插值多项式得到了两参和三参有记忆迭代格式,并与已有的两参和三参有记忆迭代格式进行比较;给出了几个格式的吸引域,比较了几个迭代格式的性能.     

精确牛頓法及其应用

(一) 引言在各种科学实验及工程技术问题中,会遇到大量代数方程和超越方程求根的问题,我们知道,在实际计算中,方程的根总是以有限位数字表出的。求方程的根的方法很多,其中牛顿法计算简单,收敛速度也好,为一般科技人员所采用。牛顿法的本质是以切线代替曲线,其计算程序为 x_(n+1)=x_n-f(x_n)/f′(x_n)。(1) 为了使计算工作量减少,有简化的牛顿程序 x_(n+1)=x_n-f(x_n)/f′(x_0)。(2) 在泛函分析中,为了加速收敛,还有将牛顿程序改进的契比雪夫程序及切双曲线程序,它们都是精确牛顿法的计算程序,为了深入了解其中内容,要求具备泛函知识。下面准备用简单的数学分析方法导出精确的牛顿法并讨论契比雪夫程序之实际应用。     

一类变形的牛顿法求解矩阵平方根

提出一些改进的方法来计算矩阵A的平方根,也就是应用一些牛顿法的变形来解决二次矩阵方程．研究表明,改进的方法比牛顿算法和一些已有的牛顿算法的变形效果要好．通过迭代方法,举出一些数值例子说明改进的方法的性能．     

对牛顿迭代法的一个重要修改

对解非线性和超越方程ｆ（ｘ）＝０的牛顿迭代法作了重要的改进·利用动力系统的李雅普诺夫方法,构造了新的“牛顿类”方法·这些新的迭代方法保持了牛顿法的收敛速率和计算效能,摒弃了强加于ｆ（ｘ）的单调性要求ｆ′（ｘ）≠０·     

一类基于Halley-Newton型的有效修正算法

基于Halley方法及经典的牛顿法,通过引入适当参数和线搜索技术,该文提出了求解非线性方程组的一类新的牛顿型算法,并给出两种具体修正迭代格式.在适当假设下,证明了新算法的全局收敛性.数值实验结果表明该方法是可行有效的.     

Efficient Hybrid Algorithms for Finding Zeros of Convex Functions

We consider two hybrid algorithms for finding an ϵ-approximation of a root of a convex real function that is twice differentiable and satisfies a certain growth condition on the intervial [0, R]. The first algorithm combines a binary search procedure with Newton′s method. The binary search produces an interval contained in the region of quadratic convergence of Newton′s method. The computational cost of the binary search, as well as the computational cost of Newton′s method, is of order O(log log(R/ϵ)). The second algorithm combines a binary search with the secant method in a similar fashion. This results in a lower overall computational cost when the cost of evaluating the derivative is more than .44042 of the cost of evaluating the function. Our results generalize same recent results of Ye.     

MODIFIED NEWTON AND SECANT METHODS FOR SOLVING AN ORDER O(h~4) FINITE-DIFFERENCE PROBLEM

1IntroductionSolution0fn0nlineartwo-pointb0undaryvaIuepr0blems(NBVP)canoftenbefoundbythefinite-differenceappr0ach,wheref(t,y)isaconti-nuousfunction.Collatz[1]firstpresentedanapproximation0ffourthorderfwherey=(y1,''tyN)',g=(g1,'-,gN)'andtherelativepaperscanals0beseenin[2].Toestablishthesolutionof(1.l),thef0llowingmethodscanbeusedfnonlinearsuccessiverelaxati0n(NSOR)method[3],thedifferenceNewt0nmethod(0rNewtonmethod)[4],therelativesparsenonlinearequationpr0blemscanals0beseenin[5-8]-lnthisp…     

Scaling on the Spectral Gradient Method

This paper presents a new method for steplength selection in the frame of spectral gradient methods. The steplength formula is based on the interpolation scheme as well as some modified secant equations. The corresponding algorithm selects the initial positive steplength per iteration according to the satisfaction of the secant condition, and then a backtracking procedure along the negative gradient is performed. The numerical experience shows that this algorithm improves favorably the efficiency property of the standard Barzilai–Borwein method as well as some other recently modified Barzilai–Borwein approaches.     

Directional secant method for nonlinear equations

We present a directional secant method, a secant variant of the directional Newton method, for solving a single nonlinear equation in several variables. Under suitable assumptions, we prove the convergence and the quadratic convergence speed of this new method. Numerical examples show that the directional secant method is feasible and efficient, and has better numerical behaviour than the directional Newton method.     

Modified Ostrowski’s method with eighth-order convergence and high efficiency index

In this paper, based on Newton’s method, we derive a modified Ostrowski’s method with an eighth-order convergence for solving the simple roots of nonlinear equations by Hermite interpolation methods. Per iteration this method requires three evaluations of the function and one evaluation of its first derivative, which implies that the efficiency index of the developed method is 1.682, which is optimal according to Kung and Traub’s conjecture Kung and Traub (1974) [2]. Numerical comparisons are made to show the performance of the derived method, as shown in the illustrative examples.     

A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs

We propose a modified alternating direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, therefore requires much less computational effort per iteration than the second-order approaches such as the interior point methods or the smoothing Newton methods. In fact, only a single inexact metric projection onto the positive semidefinite cone is required at each iteration. We prove global convergence and provide numerical evidence to show the effectiveness of this method.     

Some iterative methods for the largest positive definite solution to a class of nonlinear matrix equation

In this paper, we propose some inversion-free iteration methods for finding the largest positive definite solution of a class of nonlinear matrix equation. Then, we consider the properties of the solution for this nonlinear matrix equation. Also, we establish Newton’s iteration method for finding the largest positive definite solution and prove its quadratic convergence. Furthermore, we derive the semi-local convergence of the Newton’s iteration method. Finally, some numerical examples are presented to illustrate the effectiveness of the theoretical results and the behavior of the considered methods.     

基于等距节点积分公式的牛顿迭代法及其收敛阶

利用等距节点的数值积分公式构造牛顿迭代法的变形格式.我们证明了利用4等分5个节点的Newton-Cotes公式构造的变形牛顿迭代法收敛阶为3,并进一步证明了对于最常用的3等分4节点、5等分6节点、6等分7节点、7等分8节点积分公式,所得到的变形牛顿迭代法收敛阶都是3.最后,本文猜想,利用任意等分的积分公式构造变形牛顿迭代法,所得的迭代格式收敛阶都是3.     

Some geometrical iteration methods for nonlinear equations

This paper describes geometrical essentials of some iteration methods （e.g. Newton iteration, secant line method, etc.） for solving nonlinear equations and advances some geometrical methods of iteration that are flexible and efficient.