Multi-Step Preconditioned Newton Methods for Solving Systems of Nonlinear Equations
preprint
OA: closed
Abstract
The study of different forms of preconditioners for solving a system of nonlinear equations, by using Newton’s method, is presented. The preconditioners provide numerical stability and rapid convergence with reasonable computation cost, whenever chosen accurately. Different families of iterative methods can be constructed by using a different kind of preconditioners. The multi-step iterative method consists of a base method and multi-step part. The convergence order of base method is quadratic and each multi-step add an additive factor of one in the previously achieved convergence order. Hence the convergence of order of an m-step iterative method is m + 1. Numerical simulations confirm the claimed convergence order by calculating the computational order of convergence. Finally, the numerical results clearly show the benefit of preconditioning for solving system of nonlinear equations.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00