Robust approximate zeros in Banach space

DOI10.1007/S11786-007-0005-7MaRDI QIDQ2465576zbMATH OpenOpenAlexFDO

Authors Vikram Sharma

Publication date 4 January 2008

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-007-0005-7

zbMATH Keywords

convergencecomplexityBanach spacecondition numbererror estimateNewton methodapproximate zerosystems of integer polynomials

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)

Recommendations

• Algorithms – ESA 2005
• scientific article; zbMATH DE number 1113610
• On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
• Approximate Zeros of Quadratically Convergent Algorithms
• On the worst-case arithmetic complexity of approximating zeros of polynomials

Cited in

(4)

• In Praise of Numerical Computation
• Algorithms – ESA 2005
• Solving equations and optimization problems with uncertainty
• Smale's \(\alpha \)-theory for inexact Newton methods under the \(\gamma \)-condition

This page was built for publication: Robust approximate zeros in Banach space

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