Abstract

In this paper, a kind of modified GMRES(m) algorithm is proposed and its convergence theory is well established. By properly varying the restart parameter m in the GMRES(m) algorithm, the computational efficiency and precision can be significantly improved. Because the parameter m can be very small, the storage and computations are greatly saved. In addition, the new algorithm is successfully used to solve a heat conduction problem and a Laplace equation problem. Numerical results show that it is not only highly effective and accurate, but also can avoid slow convergence or failure behaviour of the GMRES(m) algorithm. The superiorities will be much more remarkable for the solution of large scale problems. So it has extensive prospect in scientific computing and engineering applications.

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 call

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.