Abstract
An efficient numerical algorithm for solving system of linear equations based on modified homotopy perturbation method (MHPM) is presented. We also study the convergence of the proposed algorithm. The convergent conditions of the proposed algorithm are constructed. The connection with the well-known algorithms such as successive over-relaxation (SOR) method is discussed. The proposed algorithm is compared with SOR method and those obtained by the original homotopy perturbation method. Some examples from the literature are given to illustrate that the proposed algorithm is outperform the results obtained by SOR and the original homotopy perturbation method.
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 callMore From: International Journal of Intelligent Technologies and Applied Statistics
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.
