Consistent approximations in Newton-type decomposition methods
From MaRDI portal
Publication:799346
DOI10.1007/BF01389589zbMATH Open0548.65034MaRDI QIDQ799346FDOQ799346
Authors: Jochen W. Schmidt, Wolfgang Hoyer, Christian Haufe 
Publication date: 1985
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133043
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- A Decomposition Methodology and a Class of Algorithms for the Solution of Nonlinear Equations
- On the R-order of coupled sequences. II
- Title not available (Why is that?)
Cited In (11)
- Newton‐Type Decomposition Methods for Equations Arising in Network Analysis
- Title not available (Why is that?)
- Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems
- Variants of the reduced Newton method for nonlinear equality constrained optimization problems
- Title not available (Why is that?)
- An Approximate Newton-Like Coupling of Subsystems
- A class of superlinear decomposition beetiiods in nonlinear equations
- 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
- 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)
