A global Newton-type scheme based on a simplified Newton-type approach
From MaRDI portal
Publication:2053141
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 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 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 . 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 2051062 (Why is no real title available?)
- scientific article; zbMATH DE number 2104353 (Why is no real title available?)
- A posteriori error analysis for linearization of nonlinear elliptic problems and their discretizations
- A posteriori estimation of the linearization error for strongly monotone nonlinear operators
- A posteriori existence in numerical computations
- A robust adaptive strategy for the nonlinear Poisson equation
- Adaptive Newton-type schemes based on projections
- Adaptive iterative linearization Galerkin methods for nonlinear problems
- An \(hp\)-adaptive Newton-Galerkin finite element procedure for semilinear boundary value problems
- An adaptive Newton-method based on a dynamical systems approach
- Backward step control for global Newton-type methods
- Computable error estimators for the approximation of nonlinear problems by linearized models
- Continuous Newton's method for polynomials.
- Fully adaptive Newton-Galerkin methods for semilinear elliptic partial differential equations
- Guaranteed and robust a posteriori error estimates and balancing discretization and linearization errors for monotone nonlinear problems
- Iterative Galerkin discretizations for strongly monotone problems
- On the convergence of adaptive iterative linearized Galerkin methods
- The Continuous Newton's Method, Inverse Functions, and Nash-Moser
- The Newton-Raphson method and adaptive ODE solvers
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)