Construction of Globally Convergent Iteration Functions for the Solution of Polynomial Equations

Traub, Joseph F.

Iteration functions for the approximation of zeros of a polynomial P are usually given as explicit functions of P and its derivatives. We introduce a class of iteration functions which are themselves constructed according to a certain algorithm given below. The construction of the iteration functions requires only simple polynomial manipulation which may be performed on a computer.


  • thumnail for Traub__construction_of_globally_convergent_iteration_functions_for_the_solution_of_polynomial_equations.pdf Traub__construction_of_globally_convergent_iteration_functions_for_the_solution_of_polynomial_equations.pdf application/pdf 138 KB Download File

Also Published In

Bulletin of the American Mathematical Society

More About This Work

Academic Units
Computer Science
Published Here
October 10, 2013