Consistent approximations in Newton-type decomposition methods
A class of superlinearly convergent Newton-type decomposition methods for solving structured large systems of nonlinear equations recently introduced by the first two authors [Newton-type decomposition methods for equations arising in Network Analysis Z. Angew. Math. Mech. 64, 397- 405 (1984)] is extended in such a way that consistent approximations to the appearing partial and directional derivatives are permitted. As a concrete realization appropriate directional difference quotients are recommended, which reduce the required number of function evaluations and arithmetical operations considerably. Based on suitable consistency conditions, for a general model algorithm local convergence is established with an R-order \(\lambda >1\) depending on the choice of discretization parameters. The paper concludes with an illustrating numerical example.
- A Decomposition Methodology and a Class of Algorithms for the Solution of Nonlinear Equations
- A multilevel Newton algorithm with macromodeling and latency for the analysis of large-scale nonlinear circuits in the time domain
- scientific article; zbMATH DE number 3937103 (Why is no real title available?)
- scientific article; zbMATH DE number 3624709 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Newton‐Type Decomposition Methods for Equations Arising in Network Analysis
- On the R-order of coupled sequences. II
- Global convergence of nonmonotone strategies in parallel methods for block-bordered nonlinear systems
- Parallel ABS projection methods for linear and nonlinear systems with block arrowhead structure
- Complexities in modeling of heterogeneous catalytic reactions
- Variants of the reduced Newton method for nonlinear equality constrained optimization problems
- scientific article; zbMATH DE number 4145237 (Why is no real title available?)
- scientific article; zbMATH DE number 3921838 (Why is no real title available?)
- A class of superlinear decomposition beetiiods in nonlinear equations
- scientific article; zbMATH DE number 1078407 (Why is no real title available?)
- An Approximate Newton-Like Coupling of Subsystems
- Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems
- Newton‐Type Decomposition Methods for Equations Arising in Network Analysis
- The nonlinear inexact Uzawa hybrid algorithms based on one-step Newton method for solving nonlinear saddle-point problems
This page was built for publication: Consistent approximations in Newton-type decomposition methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799346)
