## Abstract

A procedure which accelerates the convergence of iterative methods for the numerical solution of systems of nonlinear algebraic and/or transcendental equations in Rn is introduced. This procedure uses a rotating hyperplane in Rn +1, whose rotation axis depends on the current approximation of n - 1 components of the solution. The proposed procedure is applied here on the traditional Newton's method and on a recently proposed “dimension-reducing” method [5] which incorporates the advantages of nonlinear SOR and Newton's algorithms. In this way, two new modified schemes for solving nonlinear systems are correspondingly obtained. For both of these schemes proofs of convergence are given and numerical applications are presented.

Original language | English |
---|---|

Pages (from-to) | 133-151 |

Number of pages | 19 |

Journal | International Journal of Computer Mathematics |

Volume | 35 |

Issue number | 1-4 |

DOIs | |

Publication status | Published - Jan 1990 |

## Keywords

- Newton's method
- bisection method
- dimension-reducing method
- implicit function theorem
- imprecise function values
- m-step SOR-Newton
- nonlinear SOR
- nonlinear equations
- numerical solution
- quadratic convergence
- reduction to one-dimensional equations
- zeros

## ASJC Scopus subject areas

- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics