Abstract
AbstractThe performance of the multigrid algorithm is investigated by solving some large, practical, three dimensional solid mechanics problems. The convergence of the method is sensitive to factors such as the amount of bending present and the degree of mesh non‐uniformity, as was also observed in Part I for two dimensional problems. However, in contrast to Part I, no proportionality is observed between the total number of operations to convergence and the problem size. Despite such behaviour, the multigrid algorithm proves to be an effective matrix equation solver for solid mechanics poblems. It is orders of magnitude faster than a direct factorization method, and yields converged solutions several times faster than the Jacobi preconditioned conjugate gradient 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 callMore From: International Journal for Numerical Methods in 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.
