Abstract
With the generalization of the Conjugate Gradient (CG) method, a Block CG (BCG) is presented in this paper, which can simultaneously solve symmetric and positive definite linear systems with multiple right-hand sides and still preserves all the properties of the standard CG method. Several techniques related to the efficiency enhancement of BCG, including initial residual vectors orthogonalization and flexible convergence control, are also proposed. Finally, the performances of BCG are investigated on three numerical examples. In these cases improvements between 30% and 200% in terms of both CPU time and iteration requirements are achieved by the BCG method in comparison with the standard CG approach.
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 callMore From: Computer Methods in Applied Mechanics and Engineering
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.
