Abstract
In this paper we show the results of some research carried out on parallel iterative methods to solve equations. In particular we study general classes of one point parallel methods and multipoint ones without memory, and we point out the convergence order of these methods and the conditions which are both necessary and sufficient for them to be optimal. In addition we prove that the convergence order for multipoint parallel procedures without memory cannot be more thenr(r+)m−1, wherer indicates the number of the parallel processor used andm the number of the functions and eventual derivatives, calculated not simultaneously in every iteration.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.