A Decomposition Methodology and a Class of Algorithms for the Solution of Nonlinear Equations

DOI10.1287/moor.6.2.277zbMath0517.65032OpenAlexW2060847497MaRDI QIDQ3666152

Aram K. Kevorkian

Publication date: 1981

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.6.2.277

zbMATH Keywords

iterative methodsGaussian eliminationNewton methodterm ranksparsity matrixdecomposition methodologyminimal essential setnonzero transversalfully irreducible matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of solutions to systems of equations (65H10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Iterative numerical methods for linear systems (65F10)

Related Items (4)

Numerical treatment of singularly perturbed two-point boundary value problems by using differential transformation method ⋮ A class of superlinear decomposition beetiiods in nonlinear equations ⋮ Consistent approximations in Newton-type decomposition methods ⋮ A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I

This page was built for publication: A Decomposition Methodology and a Class of Algorithms for the Solution of Nonlinear Equations