Abstract

This study proposes a node's residual descent method (NRDM) for the linear elasticity boundary value problem. In this method, the boundary information and deformation states are attached to the nodes, and the partial differential equations (PDEs) are then transformed into a generalized difference form with the first-order generalized finite difference (GFD) scheme. Furthermore, this study thoroughly describes the NRDM, confirms the accuracy and convergence by numerical examples, performs an error analysis, and discusses the influence of computational parameters. Results demonstrate that NRDM has high computational accuracy and superliner convergence rate. The double derivation is implemented to solve the second-order PDE boundary value problem with the first-order GFD scheme, thus simplifying the requirement for star connectivity and reducing the computational complexity. NRDM is a matrix-free iterative method that eliminates the task of assembling large global sparse matrices, thus avoiding the numerous matrix–matrix product operations. Rather than solving large systems of linear equations, many extremely small matrix multiplications are present during iterations, which are extremely friendly to parallel computing and can be adapted to the computation of ultra-multi-degree-of-freedom problems. The computational accuracy and convergence rate are considerably improved in NRDM compared to the classical GFD method.

Full Text
Published version (Free)

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