A global Newton-type scheme based on a simplified Newton-type approach

From MaRDI portal
Publication:2053141

DOI10.1007/S12190-020-01393-WzbMATH Open1484.37119arXiv1910.03296OpenAlexW3041448612MaRDI QIDQ2053141FDOQ2053141


Authors: Mario Amrein Edit this on Wikidata


Publication date: 29 November 2021

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Abstract: Globalization concepts for Newton-type iteration schemes are widely used when solving nonlinear problems numerically. Most of these schemes are based on a predictor/corrector step size methodology with the aim of steering an initial guess to a zero of f without switching between different attractors. In doing so, one is typically able to reduce the chaotic behavior of the classical Newton-type iteration scheme. In this note we propose a globalization methodology for general Newton-type iteration concepts which changes into a simplified Newton iteration as soon as the transformed residual of the underlying function is small enough. Based on Banach's fixed-point theorem, we show that there exists a neighborhood around a suitable iterate xn such that we can steer the iterates---without any adaptive step size control but using a simplified Newton-type iteration within this neighborhood---arbitrarily close to an exact zero of f. We further exemplify the theoretical result within a global Newton-type iteration procedure and discuss further an algorithmic realization. Our proposed scheme will be demonstrated on a low-dimensional example thereby emphasizing the advantage of this new solution procedure.


Full work available at URL: https://arxiv.org/abs/1910.03296




Recommendations




Cites Work


Cited In (2)





This page was built for publication: A global Newton-type scheme based on a simplified Newton-type approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053141)