...
首页> 外文期刊>computing >On the rate of convergence for two-term recursions
【24h】

On the rate of convergence for two-term recursions

机译:On the rate of convergence for two-term recursions

获取原文
           

摘要

LetBbe a compact interval in ℝ,M=B×Band φ:M→Ba map inC3(M). Suppose that ξ is a fixed point of φ. We study the behaviour of the iteratesxn+2=φ(xn+1,xn) (x0,x1∈B). Of particular interest is the situation where ϕx(ξ,ξ)=ϕy(ξ,ξ)=0. In case of the wellknown “Regula falsi” we also have ϕxx(ξ,ξ)=ϕyy(ξ,ξ)=0 and the order of convergence is$$tfrac{1}{2}(1 + sqrt 5 )$$. We consider the case where ϕyy(ξ,ξ)≠0. It turns out that there is a constant γ∈(1,2) such that successive iterates gain factors γ, 2/γ, γ, 2/γ, ... on the number of valid decimals. Depending on the initial iteratesx0,x1the number λ may range over all of (1, 2) such that in the extreme cases an additional iterative step may have virtually no effect on the number o

著录项

  • 来源
    《computing》 |1988年第4期|329-335|共页
  • 作者单位

    Universität Ulm;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 英语
  • 中图分类
  • 关键词

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号