Abstract
A modified preconditioned conjugate gradient method for solution of large sparse symmetric linear equations is presented. Two controlling parameters are used to reduce the computation time of the incomplete decomposition and each iterative step of the conjugate gradient method. Theoretical analysis and numerical examples show that the method is problem-independent to a certain extent, and could decrease the computation time by 30%/spl sim/50% than the conventional method.
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.
