Abstract
An efficient single-step iteration method is presented for solving the large sparse non-Hermitian positive definite linear systems. We theoretically prove that this method converges to the unique solution of the system of linear equations under suitable restrictions. Moreover, we derive an upper bound for the spectral radius of the new iteration matrix. Furthermore, we consider acceleration of the new iteration by Krylov subspace methods and some special properties of the new preconditioned matrix are proposed. Numerical experiments on a few model problems are presented to further examine the effectiveness of our new method.
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.