A globally convergent inexact-Newton method for solving reducible nonlinear systems of equations

DOI10.1080/10556780008805772zbMath0959.65069OpenAlexW1977633295WikidataQ126249286 ScholiaQ126249286MaRDI QIDQ4954022

Nataša Krejić, José Mario Martínez

Publication date: 16 April 2001

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780008805772

zbMATH Keywords

algorithmconvergenceinexact-Newton methodsnonlinear reducible systems

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (4)

A generalized Jacobian based Newton method for semismooth block-triangular system of equations ⋮ Newton-like method for nonlinear banded block diagonal system ⋮ Sensitivity analysis of large-scale time dependent PDEs ⋮ Inexact-Newton methods for semismooth systems of equations with block-angular structure

Cites Work

• Numerical solution of partial differential equations. Transl. from the German by Peter R. Wadsack
• Efficient sensitivity analysis of large-scale differential-algebraic systems
• Numerical methods and software for sensitivity analysis of differential-algebraic systems
• Inexact Newton Methods
• Triangular Decomposition Methods for Solving Reducible Nonlinear Systems of Equations
• Globally Convergent Inexact Newton Methods
• Parameter selection for inexact Newton method
• Choosing the Forcing Terms in an Inexact Newton Method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A globally convergent inexact-Newton method for solving reducible nonlinear systems of equations