Abstract

In this paper, the Newton-Raphson method is combined with three different algorithms. These algorithms are the generalized minimum residual (GMRES), the least squares (LSQR), and the biconjugate gradient (BCG). Of these algorithms, the most effective at reducing the number of iterations and the time required is identified. A common characteristic of these algorithms is that they replace the inversion of the tangent stiffness matrix with an iterative procedure to solve the linearized system of equations. A computer program based on three algorithms is developed to numerically solve a system of nonlinear equations. The procedure can be applied to analysis of structures with complex behaviors, including unloading, snap-through buckling, and inelastic postbuckling analyses. To demonstrate the efficiency and accuracy of the method developed here, some well-known trusses are investigated and analyzed using the various aforementioned algorithms. Results show that the biconjugate gradient algorithm is a more effective scheme to be coupled with the Newton-Raphson method when nonlinear structural problems are to be solved, having considerable savings in computational cost and time. Furthermore, the BCG algorithm is improved for solving a system of nonlinear equations. Finally, results reveal that the improved BCG method drastically reduces the computational time and the number of iterations while the accuracy of the results is maintained.

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.