Abstract
Secant type methods are useful for finding zeros of analytic equations that include polynomial systems. This paper proves new results concerning contraction and robustness theorems for secant maps. It is also shown that numerical path-following using secant maps has the same order of complexity that numerical path-following using Newton's map to approximate a zero. Such an algorithm was implemented and some numerical experiments are displayed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
