On a third order iterative method for solving polynomial operator equations

Authors

  • Emil Cătinaş Tiberiu Popoviciu, Institute of Numerical Analysis, Romanian Academy
  • Ion Păvăloiu Tiberiu Popoviciu, Institute of Numerical Analysis, Romanian Academy

Keywords:

two-step Newton method, Chebyshev method, eigenpair problems

Abstract

We present a semilocal convergence result for a Newton-type method applied to a polynomial operator equation of degree \(2\). The method consists in fact in evaluating the Jacobian at every two steps, and it has the \(r\)-convergence order at least \(3\). We apply the method in order to approximate the eigenpairs of matrices. We perform some numerical examples on some test matrices and compare the method with the Chebyshev method. The norming function we have proposed in a previous paper shows a better convergence of the iterates than the classical norming function for both the methods.

Downloads

Published

2002-02-01

How to Cite

Cătinaş, E., & Păvăloiu, I. (2002). On a third order iterative method for solving polynomial operator equations. Rev. Anal. Numér. ThéOr. Approx., 31(1), 21-28. Retrieved from https://ictp.acad.ro/jnaat/journal/article/view/2002-vol31-no1-art4

Issue

Section

Articles