The strength of nonstationary iteration

DOI10.1007/BF02193047zbMATH Open0543.65025OpenAlexW1968488117MaRDI QIDQ796255FDOQ796255

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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?

Cited In (5)

• Some informational requirements for convergence
• Title not available (Why is that?)
• Optimal solution of nonlinear equations
• Any iteration for polynomial equations using linear information has infinite complexity
• Title not available (Why is that?)

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)