scientific article; zbMATH DE number 710644
algebraic equationsapproximate zeroaverage-case analysiscomplex polynomialcomputational complexityconvergencedegree theoryincremental algorithmKuhn's algorithmmonotonicityNewton methodSard's theoremsimplicial homotopy algorithmsystems of nonlinear algebraic equationsworst-case analysis
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical computation of solutions to single equations (65H05) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Complexity and performance of numerical algorithms (65Y20)
- Some computational methods for systems of nonlinear equations and systems of polynomial equations
- Nonlinear equations. Paper from the 28th Brazilian mathematics colloquium -- 28\(^{\text o}\) Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 2011
- Computational complexity of a piecewise linear homotopy algorithm
- scientific article; zbMATH DE number 4145674 (Why is no real title available?)
- scientific article; zbMATH DE number 3933053 (Why is no real title available?)
- scientific article; zbMATH DE number 66626 (Why is no real title available?)
- Localization and perturbations of roots to systems of polynomial equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4319640)
