Factored solution of nonlinear equation systems
From MaRDI portal
Abstract: This article generalizes a recently introduced procedure to solve nonlinear systems of equations, radically departing from the conventional Newton-Raphson scheme. The original nonlinear system is first unfolded into three simpler components: 1) an underdetermined linear system; 2) a one-to-one nonlinear mapping with explicit inverse; and 3) an overdetermined linear system. Then, instead of solving such an augmented system at once, a two-step procedure is proposed in which two equation systems are solved at each iteration, one of them involving the same symmetric matrix throughout the solution process. The resulting factored algorithm converges faster than Newton's method and, if carefully implemented, can be computationally competitive for large-scale systems. It can also be advantageous for dealing with infeasible cases.
Recommendations
Cites work
Cited in
(6)- A modified 2-factor method for solving systems of nonlinear equations
- Offset-assisted factored solution of nonlinear systems
- Properties of nonlinear systems and convergence of the Newton-Raphson method in geometric constraint solving
- scientific article; zbMATH DE number 3919644 (Why is no real title available?)
- Modified Matrix Factorizations for Solving Systems of Nonlinear Equations
- scientific article; zbMATH DE number 4110579 (Why is no real title available?)
This page was built for publication: Factored solution of nonlinear equation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942585)