An algorithm to initialize the search of solutions of polynomial systems (Q815282)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm to initialize the search of solutions of polynomial systems |
scientific article; zbMATH DE number 5006974
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to initialize the search of solutions of polynomial systems |
scientific article; zbMATH DE number 5006974 |
Statements
An algorithm to initialize the search of solutions of polynomial systems (English)
0 references
16 February 2006
0 references
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.
0 references
zeros
0 references
initial approximation
0 references
iterative method
0 references
algorithm
0 references
convergence
0 references
0 references
0 references
0 references