Any iteration for polynomial equations using linear information has infinite complexity

DOI10.1016/0304-3975(83)90144-5zbMath0496.65024OpenAlexW2046483610MaRDI QIDQ1170011

Grzegorz W. Wasilkowski

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90144-5

zbMATH Keywords

complexitypolynomial equationslinear informationglobally convergent iterations

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Related Items (4)

On the existence of generally convergent algorithms ⋮ On a class of omnibus algorithms for zero-finding ⋮ Study of linear information for classes of polynomial equations ⋮ The strength of nonstationary iteration

Cites Work

• The strength of nonstationary iteration
• Can Any Stationary Iteration Using Linear Information Be Globally Convergent?
• Unnamed Item

This page was built for publication: Any iteration for polynomial equations using linear information has infinite complexity