Can Any Stationary Iteration Using Linear Information Be Globally Convergent?
From MaRDI portal
Publication:3881819
DOI10.1145/322186.322191zbMath0439.65045OpenAlexW2001767283MaRDI QIDQ3881819
Publication date: 1980
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322186.322191
Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)
Related Items (4)
Optimal solution of nonlinear equations ⋮ On a class of omnibus algorithms for zero-finding ⋮ Any iteration for polynomial equations using linear information has infinite complexity ⋮ The strength of nonstationary iteration
This page was built for publication: Can Any Stationary Iteration Using Linear Information Be Globally Convergent?