On the problem of starting points for iterative methods

DOI10.1007/s11075-018-0589-9zbMath1434.65076OpenAlexW2891008028WikidataQ129217874 ScholiaQ129217874MaRDI QIDQ2424042

Laura Măruşter, Ștefan Mărușter

Publication date: 21 June 2019

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-018-0589-9

zbMATH Keywords

numerical experimentsiterative methodsPicard iterationstarting point

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• An interval Newton method
• Existence test for solution of nonlinear systems applying affine arithmetic
• Estimating the radius of an attraction ball
• A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations
• On the local convergence of a third order family of iterative processes
• On the Bisection Method for Triangles
• Abstract Generalized Bisection and a Cost Bound
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• The Solution by Iteration of Nonlinear Equations in Hilbert Spaces

This page was built for publication: On the problem of starting points for iterative methods