The strength of nonstationary iteration

DOI10.1007/BF02193047zbMath0543.65025OpenAlexW1968488117MaRDI QIDQ796255

Grzegorz W. Wasilkowski

Publication date: 1983

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/136939

zbMATH Keywords

global convergencesimple zerosnonstationary iterationanalytical multivariate functionglobally convergent iterationsone-point iteration

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (2)

Optimal solution of nonlinear equations ⋮ Any iteration for polynomial equations using linear information has infinite complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal radius of convergence of interpolatory iterations for operator equations
• Any iteration for polynomial equations using linear information has infinite complexity
• Can Any Stationary Iteration Using Linear Information Be Globally Convergent?

This page was built for publication: The strength of nonstationary iteration