On the Attainable Order of Convergence for Some Multipoint Iteration Functions

Abstract

In this paper, we deal with a class of multipoint iterative formulas that find new approximations to a zero of a function f(x). First of all, we show that the attainable order of convergence is equal to 7 for a class of formulas that require two evaluations off(x) and two of f'(x) per iteration. Furthermore, we show that the attainable order of convergence is equal to 4 for a class of formulas that require one evaluation of f(x) and two of f'(x) per iteration and that the attainable order of convergence is equal to 4 for a class of formulas that require two evaluations of f(x) and one of f'(x) per iteration.

Journal

Journal of information processing   [List of Volumes]

Journal of information processing 13(4), 514-521, 1991-02-10  [Table of Contents]

Information Processing Society of Japan (IPSJ)

Cited by:  2

You must have a user ID to see the cited references.If you already have a user ID, please click "Login" to access the info.New users can click "Sign Up" to register for an user ID.

Preview

Preview

Codes

  • NII Article ID (NAID) :
    110002673549
  • NII NACSIS-CAT ID (NCID) :
    AA00700121
  • Text Lang :
    ENG
  • Article Type :
    Journal Article
  • ISSN :
    03876101
  • Databases :
    CJPref  NII-ELS