Abstract

The parameterized inexact Uzawa methods have been used to solve some of the symmetric saddle point problems. In this paper, a new preconditioned parameterized inexact Uzawa method is presented to solve indefinite saddle point problems. After preconditioning, theoretical analyses show that the iteration method converges under certain conditions. So we propose three new algorithms based on these conditions. Numerical experiments are provided to show the effectiveness of the proposed preconditioner and all these algorithms have fantastic convergence rates by choosing optimal parameters.

Full Text
Paper version not known

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.