Abstract
The Generalized Conjugate Residual (GCR) method with a variable preconditioning is an efficient method for solving a large sparse linear system Ax = b. It has been clarified by some numerical experiments that the Successive Over Relaxation (SOR) method is more effective than Krylov subspace methods such as GCR and ILU(0) preconditioned GCR for performing the variable preconditioning. However, SOR cannot be applied for performing the variable preconditioning, when solving the singular linear system, where the coefficient matrix has diagonal elements of 0 or is rectangular matrix. Therefore, we reconsider the splitting of A, and propose a variant of SOR. By numerical experiments on the singular linear system, we show the efficiency of the variable preconditioned GCR method using the variant of SOR.
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.
