Premium
Newton‐Type Decomposition Methods for Equations Arising in Network Analysis
Author(s) -
Hoyer W.,
Schmidt J. W.
Publication year - 1984
Publication title -
zamm ‐ journal of applied mathematics and mechanics / zeitschrift für angewandte mathematik und mechanik
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 51
eISSN - 1521-4001
pISSN - 0044-2267
DOI - 10.1002/zamm.19840640904
Subject(s) - newton's method , local convergence , type (biology) , decomposition method (queueing theory) , diagonal , nonlinear system , decomposition , iterative method , block (permutation group theory) , mathematics , computer science , lu decomposition , network analysis , system of linear equations , algorithm , mathematical optimization , matrix decomposition , mathematical analysis , discrete mathematics , physics , geometry , ecology , eigenvalues and eigenvectors , quantum mechanics , biology
This paper presents two‐ and multilevel Newton‐type decomposition methods for the iterative solution of large nonlinear systems of equations which arise with a special block‐wise sparsity pattern e.g. in electric circuit analysis. The structure of the systems is widely utilized by the proposed algorithms, which only require soling linear subsystems of the sizes of the diagonal blocks. The methods developed are shown to be locally superlinearly convergent.