Consistent approximations in Newton-type decomposition methods (Q799346): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the R-order of coupled sequences. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3710465 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Newton‐Type Decomposition Methods for Equations Arising in Network Analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Decomposition Methodology and a Class of Algorithms for the Solution of Nonlinear Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5652137 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A multilevel Newton algorithm with macromodeling and latency for the analysis of large-scale nonlinear circuits in the time domain / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4187244 / rank | |||
Normal rank |
Latest revision as of 15:46, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Consistent approximations in Newton-type decomposition methods |
scientific article |
Statements
Consistent approximations in Newton-type decomposition methods (English)
0 references
1985
0 references
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.
0 references
Newton-type decomposition methods
0 references
large systems
0 references
consistency
0 references
local convergence
0 references
numerical example
0 references
0 references