Abstract

The preconditioned conjugate gradient algorithm is a well-known and powerful method used to solve large sparse symmetric positive definite linear systems Such system are generated by the finite element discretisation in structural analysis but users of finite elements in this contest generally still rely on direct methods It is our purpose in the present work to highlight the improvement brought forward by some new preconditioning techniques and show that the preconditioned conjugate gradient method performs better than efficient direct methods.

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.