Consistent approximations in Newton-type decomposition methods

DOI10.1007/BF01389589zbMath0548.65034MaRDI QIDQ799346

Wolfgang Hoyer, Christian Haufe, Jochen W. Schmidt

Publication date: 1985

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133043

zbMATH Keywords

numerical exampleconsistencylocal convergencelarge systemsNewton-type decomposition methods

Mathematics Subject Classification ID

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

Related Items (8)

Complexities in modeling of heterogeneous catalytic reactions ⋮ A class of superlinear decomposition beetiiods in nonlinear equations ⋮ Parallel ABS projection methods for linear and nonlinear systems with block arrowhead structure ⋮ The nonlinear inexact Uzawa hybrid algorithms based on one-step Newton method for solving nonlinear saddle-point problems ⋮ Variants of the reduced Newton method for nonlinear equality constrained optimization problems ⋮ An Approximate Newton-Like Coupling of Subsystems ⋮ Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems ⋮ Global convergence of nonmonotone strategies in parallel methods for block-bordered nonlinear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the R-order of coupled sequences. II
• 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
• Newton‐Type Decomposition Methods for Equations Arising in Network Analysis

This page was built for publication: Consistent approximations in Newton-type decomposition methods