On the problem of starting points for iterative methods

DOI10.1007/S11075-018-0589-9MaRDI QIDQ2424042zbMATH OpenOpenAlexWikidataFDO

Authors L. Maruster, Şt. Măruşter

Publication date 21 June 2019

Published in Numerical Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

iterative methodsnumerical experimentsPicard iterationstarting point

Mathematics Subject Classification ID

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

Review text

The authors present an experimentally verified algorithm that finds the starting point of a given Picard iteration. It is shown that the algorithm gives the starting points for various iterative methods with low computational cost. Results of numerical experiments are given.

Recommendations

• scientific article; zbMATH DE number 3905743
• scientific article; zbMATH DE number 5787345
• scientific article; zbMATH DE number 2154210
• Extending the choice of starting points for Newton's method
• An algorithm to initialize the search of solutions of polynomial systems

Cites work

• A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations
• Abstract Generalized Bisection and a Cost Bound
• An interval Newton method
• Estimating the radius of an attraction ball
• Existence test for solution of nonlinear systems applying affine arithmetic
• scientific article; zbMATH DE number 7238281 (Why is no real title available?)
• On the Bisection Method for Triangles
• On the local convergence of a third order family of iterative processes
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• The Solution by Iteration of Nonlinear Equations in Hilbert Spaces

Cited in

(6)

• Optimal absolute error starting values for Newton-Raphson calculation of square root
• scientific article; zbMATH DE number 5696744 (Why is no real title available?)
• scientific article; zbMATH DE number 3905743 (Why is no real title available?)
• scientific article; zbMATH DE number 1995854 (Why is no real title available?)
• An iterative starting method to control parasitism for the Leapfrog method
• Power bounded prolongations and Picard-Lindelöf iteration

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

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