Abstract
In this study, an efficient technique for satisfying multi-point constraints in the parallel conjugate gradient method is proposed. Our strategy is to eliminate the dependent degrees of freedom from the system matrix equations (Ku = f ) by using the constraint conditions (Bu = 0 ). The elimination process is implemented in the conjugate gradient solver in such a way that the “MPC preconditioning matrix” is multiplied at each iteration step. In addition, a preconditioning based on the system matrix without multi-point constraints is introduced. The proposed method was implemented in a parallel finite element structural analysis software and its performance was measured. In a practical example problem with over one million degrees of freedom, both the number of iterations and computational time for convergence were reduced by about 94% compared to the penalty method. Parallel performance was also measured and 7.7 times speed-up was achieved with eight MPI processes. The result shows the effectiveness of the proposed method against large-scale assembled structural analyses.
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: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series A
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.
