A family of iterative methods with higher-order convergence (Q861130)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5083701
Language Label Description Also known as
default for all languages
No label defined
    English
    A family of iterative methods with higher-order convergence
    scientific article; zbMATH DE number 5083701

      Statements

      A family of iterative methods with higher-order convergence (English)
      0 references
      0 references
      0 references
      9 January 2007
      0 references
      The nonlinear equation \(f(x)=0\) in Banach space, where \(f\) is a nonlinear \(m\)-times Fréchet differentiable operator on a convex domain is considered. For the problem to approximate a simple root of this equation the authors present a new family of iterative methods based on the generalization of the Newton-Cotes quadrature formula \(\int^x_{x_n} f'(t)dt\approx^\circ(x-x_n)\sum^{m-1}_{i=0}A_if'(\eta^*_{i,n})\), where \(\eta^*_{i,n}=x_n+\tau_i(x-x_n)\), \(\tau_I\) are equidistant points in \([0,1]\) and \(A_i\) are corresponding Newton-Cotes coefficients. It is proved that if there exist constants \(A\), \(0\leq\tau_I\leq 1\), \(I,\dots, m-1\) such that \(\sum^{m-1}_{i=0}A_i(1-\overline\omega)^p=\frac{1} {p+1}\), for \(p=0,1,\dots,m-1\), than the order of convergence of the proposed method is \(m+1(m\geq 2)\).
      0 references
      Newton-Cotes quadrature formula
      0 references
      iterative method
      0 references
      algebraic precision
      0 references
      nonlinear operator equation
      0 references
      Banach space
      0 references
      Fréchet differentiable operator
      0 references
      convergence
      0 references

      Identifiers