Abstract
The restrictive preconditioning technique applied to Chebyshev semi-iterative methods for solving a nonsingular system of linear equations is studied. Motivated by the fact that linear systems involving a preconditioner are solved inexactly at each step, we present the inexact restrictively preconditioned Chebyshev method. The convergence behaviors of the new methods are analyzed, particularly for solving two-by-two block systems. Numerical experiments show that the new methods may be more efficient than the restrictively preconditioned conjugate gradient method in the presence of inexactness. Moreover, the inexact restrictively preconditioned Chebyshev method is a strong competitor to the block upper triangular preconditioned GMRES and flexible GMRES methods for solving generalized saddle point problems.
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 callDisclaimer: 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.
