An algorithm to initialize the search of solutions of polynomial systems

From MaRDI portal





When applying a certain iterative method for solving systems of nonlinear equations, a very important issue is how to choose the initial guess (approximation) in order to be sure that the iterative method will converge. The author proposes, in the case of systems of polynomial equations, an algorithm that is able to locate the zeros of the system inside small enough \(p\)-cubes in \(\mathbb{R}^p\), to guarantee the convergence.











This page was built for publication: An algorithm to initialize the search of solutions of polynomial systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q815282)