An algorithm to initialize the search of solutions of polynomial systems
type: Item
instance of: scholarly article
title: An algorithm to initialize the search of solutions of polynomial systems
zbMATH Open document ID: 1086.65052
author: N. E. Zubov
publication date: 2006-02-16T00:00:00Z
review text: 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.
reviewed by: Vasile Berinde
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 30C15
Mathematics Subject Classification ID: 26C10
zbMATH DE Number: 5006974
zbMATH Keywords: zeros
zbMATH Keywords: initial approximation
zbMATH Keywords: iterative method
zbMATH Keywords: algorithm
zbMATH Keywords: convergence
MaRDI profile type: Publication
full work available at URL: j.camwa.2004.12.016
OpenAlex ID: W1980780834
cites work: An improvement of the finite-element method for computing the electric field of waveguides with complex geometry
cites work: Local results for the Gauss-Newton method on constrained rank-deficient nonlinear least squares
cites work: Solving Real Polynomial Systems with Real Homotopies
cites work: Quasi-Newton Methods, Motivation and Theory
cites work: A Class of Methods for Solving Nonlinear Simultaneous Equations
cites work: Recent applications and numerical implementation of quasi-Newton methods for solving nonlinear systems of equations
cites work: Practical quasi-Newton methods for solving nonlinear systems
DOI: 10.1016/J.CAMWA.2004.12.016
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 5006974