CONVERGENCE BALL OF ITERATIONS WITH ONE PARAMETER

§1Introduction OfthevariousiterationmethodsusedtosolvetheequationF(x)=0,thefamilyof iterativemethodswithoneparameter xn+1=xn-I+12PF(I-αPF)-1F′(xn)-1F(xn),PF(x)=F′(x)-1F″(x)F′(x)-1F(x),α∈[0,1],(1)isremarkablebecauseitincludesthesuper-Halleymethod,theChebyshevmethodand Halley'smethodasitsspecialcaseswhenαisequalto1,0and1/2,respectively.Thereareanumberofpapersconcerningtheabovethreeiterations.In[1-7],Halley's methodisstudied.Amongthesereferences,[1]givestheconvergenceofHalley'sme…     

复合凸优化问题的Gauss-Newton法的收敛性

本文研究解决复合凸优化问题:min F(x):=h(f(x)) （P）x∈X的Gauss-Newton法的收敛性.这里f是从Banach空间X到Banach空间Y的具有Frechet导数的非线性映照,h是定义在Y上的凸泛函. 复合凸优化问题近年来一直受到广泛的关注,目前它已成为非线性光滑理论中的一个主流方向.它在非线性包含,最大最小问题,罚函数技巧 [1-5]等许多重要的问题和技巧中得到了广泛的应用.同时它也提供了一个新的统一框架,使优化问题数值解的理论分析得到别开生面的发展.并且它也是研究有限区域内一阶或二阶最优性条件的一个便利工具[3,5,6,7].     

一道数学分析试题的注记

东北师范大学 1 981年研究生入学考试数学分析科目有这样一道试题[1] ,为方便起见 ,我们以命题形式给出 .命题 1　若 f′( x)在 [a,b]上连续 .对任意自然数 n且 0≤ k≤ n,令xk=a+kb-an ,r( n) =b-an ∑nk=1f( xk) -∫baf( x) dx,则limn→∞nr( n) =b-a2 [f ( b) -f ( a) ]. ( 1 )证　因为r( n) =b-an ∑nk=1f ( xk) -∑nk=1∫xkxk-1f ( x) dx=∑nk=1∫xkxk-1[f( xk) -f( x) ]dx=∑nk=1∫xkxk-1∫xkxf′( t) dt dx,交换二次积分的积分次序 ,于是r( n) =∑nk=1∫xkxk-1f′( t) dt∫txk-1dx=∑nk=1∫xkxk-1( t-xk- 1) f′( t) dt.由于 t-xk- 1…     

一道填空题(2018全国卷Ⅰ)的多种解法

<正>题目(2018全国卷Ⅰ理16)已知函数f(x)=2sinx+sin2x,则f(x)的最小值是___.解法一(导数法):由sinx的周期为2π,sin2x的周期为π,而2π和π的最小公倍数是2π,∴函数f(x)的最小周期为2π,在[0,2π]上考虑其最小值.f′(x)=2cosx+2cos2x=2(2cosx-1)(cosx+1),令f′(x)=0,得cosx=-1或cosx=1/2,     

也谈函数f(x)=sum from i=1 to n=1(︱a_ix+b_i︱)的最小值

文[1]对函数f(x)=∑ni=1aix+bi的最小值进行了研究,得到如下结论:对于函数f(x)=∑ni=1aix+bi(ai∈Q,且ai≠0,bi∈R,i∈N*),总可以写成f(x)=m1[x-x1+x-x2+…+x-xn](x1≤x2≤…≤xn,m,n∈N*)的形式.(1)若n=2k-1(k∈N*),则x=xk时,f(x)取值最小;(2)若n=2k(k∈N*),则x∈[xk,xk+1]时,f(x)取值最小.上述结论只解决了ai∈Q的情形,并要对f(x)进行变形写成m1[x-x1+x-x2+…+x-xn]的形式.为此,笔者进一步研究得到更一般结论,使得问题彻底解决.因f(x)=∑ni=1aix+bi=∑ni=1ai x+biai,所以只要研究f(x)=∑ni=1ai x-xi(ai>0,x1相似文献   

从一道数学竞赛题谈起

第四届 ( 1 992年 )北京市大学生数学竞赛 (非数学专业 )有这样一道试题 :若函数 f ( x)对一切 u≠ v均有f( u) - f( v)u- v =αf′( u) + βf′( v) , ( 1 )其中 α,β>0且 α+ β=1 ,试求 f( x)的表达式 .本题有多种解法 ,现介绍两种不同于 [1 ]的解法 .解法一　 1°若 f′( x)≡ k( k为常数 ) ,则 f( x)为一次函数 ,问题已经解决 .2°若 f′( x)不恒为常数 ,则至少存在两点 x1与 x2 使 f′( x1)≠ f′( x2 ) ,在 ( 1 )式中分别令 u=x1,v=x2 及 u=x2 ,v=x1,可得f ( x1) - f ( x2 )x1- x2=αf′( x1) + βf′( x2 ) , ( 2 )f ( x2 ) - f ( …     

对一道微分问题的修正

文[1]习题3-1(P81)第3题(是非题)如下:设函数f(x),g(x)在[a,b]上连续,在(a,b)内可导,且在[a,b]上f′(x)≤g′(x),则有f(b)-f(a)≤g(b)-g(a).与文[1]配套的[2](P105)给出的解答是:答不对.虽然由拉格朗日定理得f(b)-f(a)b-a=f′(ξ),ξ∈(a,b)(1)g(b)-g(a)b-a=g′(ξ),ξ∈(a,b)(2)且有f′(x)≤g(x).但f′(ξ)不一定小于等于g′(ξ),因为(1)(2)式中的ξ不一定是相同的.我们认为上述解答是错的,也就是说,原命题是成立的.下面给出证明.证明令F(x)=f(x)-g(x),由题意,F(x)在[a,b]上连续,在(a,b)内可导,再由拉格朗日定理得F(b)-F(a)b-a=F′(ξ),…     

从一道研究生入学试题谈起

例 1 [1]　设 f于 [1 ,+∞ )连续可微 ,且 f′( x) =1f2 ( x) +1 [1x -ln( 1 +1x) ].求证 :limx→∞ f ( x)存在 .文 [2 ]将其作为例题 ,其解答为 :由简单的不等式 [3] hh +1 -1 ,h≠ 0 ) ,得1x +1 ) 0 ,从而 f ( x)在 [1 ,+∞ )上单调增加 .又因f′( x) 1x -ln( 1 +1x) <1x -1x +1 =　　 1x x +1 . 1x +x +1 <1x . 12 x =12 x32注意到 f′( x)连续牛顿—莱布尼兹公式 ,得f ( x) -f ( 1 ) =∫x1f′( t) dt ∫x112 t32dt=1 -1x <1于是 f ( x) <1 +f ( 1 ) ,即 f ( x)在 [1 ,+∞ )上有上界 …     

超线性收敛的指数下降迭代法

1　引　　言文[1]中借助于常微分方程的Liapunov方法建立了与非线性方程f(x)=0(1)在区间[a,b]内的解x*相对应的Cauchy问题dx/dt=-w(x)f(x)(2)x(0)=x0,　x0∈[a,b](3)其中f(x)在[a,b]上连续可导,f′(x)≠0,而w(x)满足w(x)f′(x)>0且使得Cauachy问题(2)—(3)的饱和解x=x(t,x0)存在唯一.于是非线性方程(1)在[a,b]内的解x*为自治系统(2)的渐近稳定的奇点,从而有limt→+∞x(t,x0)=x*,　　x0∈[a,b](4)成立.这说明对任一初值x0∈[a,b]通过解Cauchy问题(2)—(3)可得非线性方程(1)在[a,b]内的解x*.在文[2]中利用Lambert的非线性方法[3],导出了一个…     

循环搜索法在三参数双指数曲面拟合中的应用

在最小二乘意义下用 Gauss-Newton法拟合三参数双指数曲面z =γ[exp( -αx) +exp( -βy) ]时 ,充分利用观测值 ,应用循环搜索法确定了参数初始值 .并成功地以由 Meyer &Roth给出的观测值为例对此进行了验证 .     

Local convergence results of Gauss-Newton's like method in weak conditions

In this paper, we study the convergence of Gauss-Newton's like method for nonlinear least squares problems. Under the hypothesis that derivative satisfies some kind of weak Lipschitz condition, we obtain the sharp estimates of the radii of convergence ball of Gauss-Newton's like method and the uniqueness ball of the solution.     

VORONOI POLYHEDRA OF UNIT BALL PACKINGS WITH SMALL SURFACE AREA

In this note, first, we give a very short new proof of the theorem which yields a lower bound for the surface area of Voronoi cells of unit ball packings in E ^d and implies Rogers' upper bound for the density of unit ball packings in E ^d for all d ≥ 2. Second we sharpen locally a classical result of Gauss by finding the locally smallest surface area Voronoi cells of lattice unit ball packings in E ³. This revised version was published online in August 2006 with corrections to the Cover Date.     

Local convergence theorems of Newton's method for nonlinear equations using outer or generalized inverses

We provide local convergence theorems for Newton's method in Banach space using outer or generalized inverses. In contrast to earlier results we use hypotheses on the second instead of the first Fréchet-derivative. This way our convergence balls differ from earlier ones. In fact we show that with a simple numerical example that our convergence ball contains earlier ones. This way we have a wider choice of initial guesses than before. Our results can be used to solve undetermined systems, nonlinear least squares problems and ill-posed nonlinear operator equations.     

空间C^n中单位球里Poisson积分的边界极限

本文考虑了Ｃ＾ｎ中单位球Ｂ里的Ｐｏｉｓｓｏｎ积分,得到该积分边界上,下极限的准确值。     

HOMOCENTRIC CONVERGENCE BALL OF THE SECANT METHOD

A local convergence theorem and five semi-local convergence theorems of the secant method are listed in this paper.For every convergence theorem,a convergence ball is respectively introduced,where the hypothesis conditions of the corresponding theorem can be satisfied.Since all of these convergence balls have the same center x~*,they can be viewed as a homocentric ball. Convergence theorems are sorted by the different sizes of various radii of this homocentric ball, and the sorted sequence represents the degree of weakness on the conditions of convergence theorems.     

SCHWARZ-PICK ESTIMATES FOR PARTIAL DERIVATIVES OF ARBITARY ORDER OF BOUNDED HOLOMORPHIC FUNCTIONS IN THE UNIT BALL OF C~n

This paper gives a Schwarz-Pick estimate for bounded holomorphic functions in the unit ball of C n .     

On the complexity of extending the convergence ball of Wang’s method for finding a zero of a derivative

Ball convergence results are very important, since they demonstrate the complexity in choosing initial points for iterative methods. One of the most important problems in the study of iterative methods is to determine the convergence ball. This ball is small in general restricting the choice of initial points. We address this problem in the case of Wang’s method utilized to determine a zero of a derivative. Finding such a zero has many applications in computational fields, especially in function optimization. In particular, we find the convergence ball of Wang’s method using hypotheses up to the second derivative in contrast to earlier studies using hypotheses up to the fourth derivative. This way, we also extend the applicability of Wang’s method. Numerical experiments used to test the convergence criteria complete this study.     

THE UNIT BALL OF C*-ALGEBRA AND DIFFERENTIABILITY OF SUPPORT FUNCTION

In this paper we show that the unit ball of an infinite dimensional commutative C-algebra lacks strongly exposed points, so they have no predual. Also in the second part, we use the concept of strongly exposed points in the Frechet differentiability of support convex functions.     

求複數根的舗D法

<正> 一. 引言 代數方程f(x)=0的實數根的逐步接近法已有多種,其中計算簡單收斂最快的是用牛頓公式     

Affine invariant convergence results for Newton's method

We present a unified derivation of affine invariant convergence results for Newton's method. Initially we derive affine invariant forms of the perturbation lemma and a mean value theorem. With their aid we obtain an optimal radius of convergence for Newton's method, from which further radius of convergence estimates follow. From the Newton-Kantorovitch theorem we derive other estimates of the radius of convergence. We discuss estimation of the parameters in the expressions we have derived.