The strength of nonstationary iteration

DOI10.1007/BF02193047MaRDI QIDQ796255zbMATH OpenOpenAlexFDO

Authors 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 zerosanalytical multivariate functionglobally convergent iterationsnonstationary iterationone-point iteration

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3982415
• On an iterative algorithm of order 1.839… for solving nonlinear operator equations^∗)
• scientific article; zbMATH DE number 3338111
• scientific article; zbMATH DE number 4024654
• Iterative Solution of Nonlinear Equations in Several Variables

Cites work

• scientific article; zbMATH DE number 3279592 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• Any iteration for polynomial equations using linear information has infinite complexity
• Can Any Stationary Iteration Using Linear Information Be Globally Convergent?
• Optimal radius of convergence of interpolatory iterations for operator equations

Cited in

(8)

• Some informational requirements for convergence
• On the Computation of Nonhyperbolic Fixed Points
• Nonstationary vs. stationary iterative processes
• scientific article; zbMATH DE number 2096222 (Why is no real title available?)
• A note on the ``constructing of nonstationary methods for solving nonlinear equations with raised speed of convergence
• Optimal solution of nonlinear equations
• Any iteration for polynomial equations using linear information has infinite complexity
• scientific article; zbMATH DE number 3982415 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796255)