Abstract

A scalable parallel feedback algorithm for adaptive finite element modeling of large scale structures is presented. This algorithm is implementable on MIMD parallel processors, and uses the p-extension of the finite element method. The problem domain is partitioned into a number of suitable subdomains by using an automatic domain decomposer, and each subdomain is thereupon assigned to a processor in the multiprocessor system. Connection Machine's CM-5 system is being used for the present implementation. Most of the previous efforts to parallelize finite element analysis were confined to parallel algorithms for direct or iterative equation solvers, and did not produce satisfactory performance because of the small granularity of parallel tasks. Also, these efforts were based on the h-extension of the finite element method, and hence could not exploit some of the inherent advantages available in the p-extension. As the current algorithm utilizes the domain decomposition technique and is based on the p-version of the finite element method, it is expected to produce good performance, particularly for large scale structures. The feedback algorithm is based on an iterative scheme derived from the domain decomposition technique for applications to problems of solid mechanics. It has been tested for two-dimensional problems showing good convergence characteristics. Current efforts are also directed towards generalizing the scheme, and include adaptive model refinement.

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.