Abstract
AbstractA general iterative algorithm for the solution of large finite element systems of arbitrary domain geometry is designed to operate efficiently on modern computers with concurrent processors. The domain is recursively and automatically subdivided into the same number of subdomains as available processors. Convergence is ensured because of the Gauss–Seidel type of iterations operated on each subdomain and corresponding interface. This subdomain iterative solution approach is compatible with the other phases of a complete concurrent finite element analysis (concurrent stiffness formation and assembly and concurrent element post‐processing), from both the data structure and computation points of view. Implementation of the resulting stratagem on MIMD computers is presented. Several examples are run on a hypercube multiprocessor to validate the proposed algorithm and assess its performance. An efficiency of 91 per cent is achieved for a problem with 16,000 degrees‐of‐freedom.
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 callDisclaimer: 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.
